</div>');\\n\\n boundingBox.css('position', 'absolute');\\n // boundingBox.css('border', '1px solid black');\\n boundingBox.css('border-radius', '3px');\\n boundingBox.css('background', '#f1f1f1');\\n boundingBox.css('z-index', 99);\\n var contentBox = $('<div></div>');\\n contentBox.css('position', 'relative');\\n boundingBox.css('opacity', '0.85');\\n\\n boundingBox.append(contentBox);\\n contentBox.css({\\n 'background': '#f1f1f1',\\n 'border-radius': '4px',\\n 'padding': '4px',\\n 'width': '140px'\\n });\\n // Context Box\\n // Remove Label Button \\n\\n var labelMenuStyle = {\\n 'background': '#d3e2ee',\\n 'padding': '2px',\\n 'font-family': 'Arial',\\n 'font-weight': 'bold',\\n 'font-size': '12px',\\n 'border-radius': '2px',\\n // 'margin-top':'3px'\\n }\\n\\n var removeLabelMenu = $('<div></div>');\\n removeLabelMenu.text('Remove Label');\\n removeLabelMenu.css(labelMenuStyle);\\n removeLabelMenu.css('margin-bottom', '3px');\\n\\n contentBox.append(removeLabelMenu);\\n removeLabelMenu.hide();\\n\\n // Label Property List \\n var propertyKeys = Object.keys(validAtomSpecs);\\n var propertyList = [];\\n var propertyObjectList = [];\\n\\n propertyKeys.forEach((prop) => {\\n var propObj = validAtomSpecs;\\n if (propObj[prop].prop === true) {\\n propertyList.push(prop);\\n }\\n });\\n\\n // Property Menu \\n var propertyMenu = $('<div></div>');\\n contentBox.append(propertyMenu);\\n\\n /*\\n * Property object used in property menu \\n * \\n * @function Property \\n * @param {String} key Name of the atom property\\n * @param {*} value Value of the property \\n */\\n function Property(key, value) {\\n this.row = $('<tr></tr>');\\n var propLabelValue = this.control = {\\n key: '',\\n value: null,\\n active: true,\\n name: key,\\n }\\n\\n this.key = key;\\n this.value = value;\\n\\n var checkbox = new $3Dmol.UI.Form.Checkbox(propLabelValue);\\n var checkboxHolder = $('<td></td>');\\n checkboxHolder.append(checkbox.ui);\\n var keyHolder = $('<td></td>');\\n var separatorHolder = $('<td></td>').text(':');\\n var valueHolder = $('<td></td>');\\n\\n this.row.append(checkboxHolder, keyHolder, separatorHolder, valueHolder);\\n\\n keyHolder.text(key);\\n\\n if (typeof (value) == \\\"number\\\") {\\n valueHolder.text(value.toFixed(2));\\n } else {\\n valueHolder.text(value.replace(/\\\\^/g, ''));\\n }\\n\\n console.log('Type of value', typeof (value), value);\\n }\\n\\n /*\\n * @param {AtomSpec} atom Value of different property of the atom, if the atom has prop : true\\n * then that option is made visible in the context menu\\n */\\n function setProperties(atom) {\\n propertyMenu.empty();\\n propertyObjectList = [];\\n\\n var propertyTable = $('<table></table>');\\n\\n propertyList.forEach((prop) => {\\n var propObj = new Property(prop, atom[prop]);\\n propertyTable.append(propObj.row);\\n propertyObjectList.push(propObj);\\n });\\n\\n propertyMenu.append(propertyTable);\\n\\n var labelStyleHolder = $('<div><div>');\\n\\n var labelStyle = $('<div><div>');\\n labelStyle.text('Style');\\n labelStyle.css({\\n 'display': 'inline-block',\\n 'font-family': 'Arial',\\n 'font-size': '14px',\\n 'margin-right': '6px',\\n 'margin-left': '6px'\\n });\\n\\n var stylesForLabel = new $3Dmol.UI.Form.ListInput(labelStyle, Object.keys($3Dmol.labelStyles));\\n stylesForLabel.ui.css({\\n 'display': 'inline-block'\\n });\\n\\n stylesForLabel.setValue('milk');\\n\\n labelStyleHolder.append(labelStyle, stylesForLabel.ui);\\n propertyMenu.append(labelStyleHolder);\\n\\n var submit = new button(icons.tick, 18, { backgroundColor: 'lightgreen', tooltip: 'Submit' });\\n var cancel = new button(icons.cross, 18, { backgroundColor: 'lightcoral', tooltip: 'Cancel' });\\n\\n var controlButtons = $('<div></div>');\\n controlButtons.append(submit.ui, cancel.ui);\\n // controlButtons.css('text-align', 'center');\\n\\n var alertBox = new AlertBox();\\n propertyMenu.append(alertBox.ui);\\n\\n propertyMenu.append(controlButtons);\\n\\n\\n submit.ui.on('click', () => {\\n var props = processPropertyList();\\n var labelStyleValidation = stylesForLabel.validate();\\n\\n if (props != null) {\\n if (labelStyleValidation) {\\n stateManager.addAtomLabel(props, atom, stylesForLabel.getValue().value);\\n stateManager.exitContextMenu(false);\\n }\\n else {\\n alertBox.error('Select style for label');\\n }\\n }\\n else {\\n alertBox.error('No value selected for label');\\n }\\n });\\n\\n cancel.ui.on('click', () => {\\n stateManager.exitContextMenu();\\n });\\n }\\n\\n // Previous Labels \\n var labelHolder = $('<div></div>');\\n contentBox.append(labelHolder);\\n\\n // Add Menu \\n var addMenu = $('<div></div>');\\n contentBox.append(addMenu);\\n addMenu.css('width', '100%');\\n\\n var addLabelMenu = $('<div></div>');\\n addMenu.append(addLabelMenu);\\n\\n\\n addLabelMenu.text('Add Label');\\n addLabelMenu.css(labelMenuStyle);\\n addLabelMenu.css('margin-bottom', '3px');\\n addLabelMenu.hide();\\n\\n // Edit Menu\\n var editMenu = $('<div></div>');\\n contentBox.append(editMenu);\\n\\n contentBox.css({\\n 'position': 'relative',\\n });\\n\\n editMenu.css({\\n 'background': '#dfdfdf',\\n 'border-radius': '3px',\\n 'font-family': 'Arial',\\n 'font-weight': 'bold',\\n 'font-size': '12px',\\n // 'position': 'absolute',\\n // 'left' : '105%',\\n // 'top' : '0',,\\n 'box-sizing': 'border-box',\\n 'width': '100%',\\n\\n });\\n editMenu.hide();\\n\\n var alertBox = new AlertBox({ autohide: false });\\n contentBox.append(alertBox.ui);\\n\\n // Add Label Inputs \\n\\n /*\\n * Generate input elements that are used as form values in the context menu under addLabelForm\\n * @returns {Object} that holds different input elements\\n */\\n function generateAddLabelForm() {\\n var addLabelForm = $('<div></div>');\\n\\n var addLabelValue = {\\n text: {\\n key: 'Label Text',\\n value: null,\\n active: true,\\n },\\n\\n style: {\\n key: 'Style',\\n value: null,\\n active: true,\\n },\\n\\n sel: {\\n key: 'Selection',\\n value: null,\\n active: true,\\n }\\n }\\n var formModifierControl = $('<div></div>');\\n var removeButton = new button(icons.minus, 16);\\n var tick = new button(icons.tick, 16, { backgroundColor: 'lightgreen', tooltip: 'Submit' });\\n var cross = new button(icons.cross, 16, { backgroundColor: 'lightcoral', tooltip: 'Cancel' });\\n formModifierControl.append(removeButton.ui, tick.ui, cross.ui);\\n removeButton.ui.hide();\\n addLabelForm.append(formModifierControl);\\n\\n var addLabelTextBox = $('<div></div>');\\n var lt = $('<div></div>').text('Label Text');\\n var addLabelTextInput = new $3Dmol.UI.Form.Input(addLabelValue.text);\\n addLabelTextBox.append(lt, addLabelTextInput.ui);\\n var width = 126//editMenu.innerWidth()*0.8;\\n addLabelTextInput.setWidth(width);\\n addLabelForm.append(addLabelTextBox);\\n\\n var addLabelStyleBox = $('<div></div>');\\n var ls = $('<div></div>').text('Label Style');\\n var addLabelStyleInput = new $3Dmol.UI.Form.ListInput(addLabelValue.style, Object.keys($3Dmol.labelStyles));\\n addLabelStyleInput.setValue('milk');\\n addLabelStyleBox.append(ls, addLabelStyleInput.ui);\\n addLabelForm.append(addLabelStyleBox);\\n\\n var selectionList = stateManager.getSelectionList();\\n\\n var addLabelSelectionBox = $('<div></div>');\\n var lsl = $('<div></div>').text('Label Selection');\\n var addLabelSelectionInput = new $3Dmol.UI.Form.ListInput(addLabelValue.sel, selectionList);\\n addLabelSelectionBox.append(lsl, addLabelSelectionInput.ui);\\n addLabelForm.append(addLabelSelectionBox);\\n\\n // CSS \\n addLabelForm.css({\\n 'padding': '2px',\\n\\n });\\n\\n tick.ui.on('click', () => {\\n var validate = true;\\n\\n if (!addLabelStyleInput.validate())\\n validate = false;\\n\\n if (!addLabelTextInput.validate())\\n validate = false;\\n\\n if (!addLabelSelectionInput.validate())\\n validate = false;\\n\\n if (validate) {\\n stateManager.addLabel(addLabelValue);\\n }\\n });\\n\\n cross.ui.on('click', () => {\\n stateManager.exitContextMenu();\\n });\\n\\n removeButton.ui.on('click', () => {\\n stateManager.removeLabel()\\n });\\n\\n addLabelForm.on('keyup', (e) => {\\n if (e.key == 'Enter') {\\n tick.ui.trigger('click');\\n }\\n });\\n\\n return {\\n boundingBox: addLabelForm,\\n text: addLabelTextInput,\\n style: addLabelStyleInput,\\n selection: addLabelSelectionInput,\\n editMode: function () {\\n removeButton.ui.show();\\n }\\n }\\n }\\n\\n\\n function processPropertyList() {\\n var propsForLabel = {};\\n\\n propertyObjectList.forEach((propObj) => {\\n if (propObj.control.value === true) {\\n propsForLabel[propObj.key] = propObj.value;\\n }\\n });\\n\\n if (Object.keys(propsForLabel).length != 0) {\\n return propsForLabel\\n }\\n else {\\n return null;\\n }\\n }\\n\\n // Context Menu UI Funciton \\n boundingBox.hide();\\n this.hidden = true;\\n this.atom = null;\\n\\n removeLabelMenu.on('click', { atom: this.atom }, function () {\\n stateManager.removeAtomLabel(removeLabelMenu.atom);\\n });\\n\\n\\n /**\\n * Shows the context menu \\n * \\n * @function ContextMenu#show \\n * \\n * @param {Number} x x coordinate of the mouse\\n * @param {Number} y y coordinate of the mouse in the viewport in pixels\\n * @param {AtomSpec} atom Value of the atoms that is selected \\n * @param {Boolean} atomExist if atom label is previously added it is set true else false\\n */\\n this.show = function (x, y, atom, atomExist) {\\n\\n if (atomExist) {\\n removeLabelMenu.show();\\n removeLabelMenu.atom = atom;\\n }\\n else {\\n removeLabelMenu.hide();\\n removeLabelMenu.atom = null;\\n }\\n\\n alertBox.ui.hide();\\n addLabelMenu.hide();\\n\\n if (stateManager.getSelectionList().length == 0) {\\n alertBox.message('Please create selections before adding label');\\n } else {\\n addLabelMenu.show();\\n }\\n\\n unsetForm();\\n setPosition(boundingBox, x, y);\\n boundingBox.show();\\n this.hidden = false;\\n\\n if (atom) {\\n setProperties(atom);\\n this.atom = atom;\\n }\\n else {\\n propertyMenu.empty();\\n }\\n }\\n\\n /**\\n * Hides the context menu and if needed process the propertyMenu\\n * \\n * @function ContextMenu#hide\\n * @param {Boolean} processContextMenu If true then submission of the property to add label is executed\\n */\\n\\n this.hide = function (processContextMenu) {\\n if (processContextMenu) {\\n var propsForLabel = processPropertyList();\\n if (propsForLabel != null) {\\n stateManager.addAtomLabel(propsForLabel, this.atom);\\n }\\n }\\n\\n boundingBox.hide();\\n this.hidden = true;\\n unsetForm();\\n }\\n\\n addLabelMenu.on('click', function () {\\n var addLabelMenuForm = generateAddLabelForm();\\n setForm(addLabelMenuForm);\\n });\\n\\n function setForm(form) {\\n editMenu.children().detach();\\n editMenu.append(form.boundingBox);\\n editMenu.show();\\n }\\n\\n function unsetForm() {\\n editMenu.children().detach();\\n editMenu.hide();\\n }\\n }\",\n \"contextMenu(x, y, _isLeftButton) {}\",\n \"addMenuItem(menuItem){\\r\\n\\r\\n }\",\n \"function makeMenu(menuItem){\\r\\n\\t\\tvar menuLi = document.createElement(\\\"li\\\");\\r\\n\\t\\tmenuLi.className = \\\"menuItem\\\";\\r\\n\\t\\tmenuLi.id = menuItem.id;\\r\\n\\t\\tvar divMenuItem = document.createElement(\\\"div\\\");\\r\\n\\t\\t//TODO:mc_\\r\\n\\t\\tdivMenuItem.id = \\\"mc_\\\" + menuItem.id;\\r\\n\\t\\r\\n\\t\\tvar divMenuIcon = document.createElement(\\\"div\\\");\\r\\n\\t\\t//TODO:mi_\\r\\n\\t\\tdivMenuIcon.id = \\\"mi_\\\" + menuItem.id;\\r\\n\\t\\tdivMenuIcon.className = \\\"menuItemIcon_blank\\\";\\r\\n\\t\\t\\r\\n\\t\\tdivMenuItem.appendChild(divMenuIcon);\\r\\n\\t\\t\\r\\n\\t\\tvar title = menuItem.directoryTitle || menuItem.title;\\r\\n\\t\\tvar divMenuTitle = document.createElement(\\\"div\\\");\\r\\n\\t\\tdivMenuTitle.id = \\\"m_\\\" + menuItem.id;\\r\\n\\t\\tif (menuItem.href && !menuItem.linkDisabled) {\\r\\n\\t\\t\\tvar aTag = document.createElement('a');\\r\\n\\t\\t\\taTag.appendChild(document.createTextNode(title));\\r\\n\\t\\t\\tif(/^javascript:/i.test( menuItem.href )){\\r\\n\\t\\t\\t\\taTag.removeAttribute('href');\\r\\n\\t\\t\\t\\taTag.className = 'scriptlink';\\r\\n\\t\\t\\t\\tvar aTagOnClick = function(e) {\\r\\n\\t\\t\\t\\t\\teval( menuItem.href );\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tIS_Event.observe(aTag, \\\"click\\\", aTagOnClick, false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\tIS_Event.observe(aTag, \\\"mouseover\\\", function(){this.className = 'scriptlinkhover';}.bind(aTag), false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\tIS_Event.observe(aTag, \\\"mouseout\\\", function(){this.className = 'scriptlink';}.bind(aTag), false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}else{\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\taTag.href = menuItem.href;\\r\\n\\t\\t\\t\\tif(menuItem.display == \\\"self\\\") {\\r\\n\\t\\t\\t\\t\\taTag.target = \\\"_self\\\";\\r\\n\\t\\t\\t\\t} else if(menuItem.display == \\\"newwindow\\\"){\\r\\n\\t\\t\\t\\t\\taTag.target = \\\"_blank\\\";\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tif(menuItem.display == \\\"inline\\\")\\r\\n\\t\\t\\t\\t\\taTag.target=\\\"ifrm\\\";\\r\\n\\t\\t\\t\\t\\tvar aTagOnClick = function(e) {\\r\\n\\t\\t\\t\\t\\t\\tIS_Portal.buildIFrame(aTag);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tIS_Event.observe(aTag, \\\"click\\\", aTagOnClick, false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tIS_Event.observe(aTag, \\\"mousedown\\\", function(e){Event.stop(e);}, false, \\\"_menu\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tdivMenuTitle.appendChild(aTag);\\r\\n\\t\\t}else{\\r\\n\\t\\t\\tdivMenuTitle.appendChild(document.createTextNode(title));\\r\\n\\t\\t}\\r\\n\\t\\tdivMenuTitle.className = \\\"menuTitle\\\";\\r\\n\\t\\t\\r\\n\\t\\tdivMenuItem.appendChild(divMenuTitle);\\r\\n\\t\\t\\r\\n\\t\\tif ( menuItem.type ){\\r\\n//\\t\\t\\tvar handler = IS_SiteAggregationMenu.menuDragInit(menuItem, divMenuIcon, divMenuItem);\\r\\n\\t\\t\\tvar handler = IS_SiteAggregationMenu.getDraggable(menuItem, divMenuIcon, divMenuItem);\\r\\n\\r\\n\\t\\t\\tIS_Event.observe(menuLi, \\\"mousedown\\\", function(e){\\r\\n\\t\\t\\t\\tEvent.stop(e);\\r\\n\\t\\t\\t}, false, \\\"_menu\\\");\\t\\r\\n\\r\\n\\t\\t\\tvar returnToMenuFunc = IS_SiteAggregationMenu.getReturnToMenuFuncHandler( divMenuIcon, menuItem.id, handler );\\r\\n\\t\\t\\tvar displayTabName = IS_SiteAggregationMenu.getDisplayTabNameHandler( divMenuIcon, menuItem.id, handler, returnToMenuFunc, \\\"_menu\\\" );\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tdivMenuIcon.className = \\\"menuItemIcon\\\";\\r\\n\\t\\t\\tmenuLi.style.cursor = \\\"move\\\";\\r\\n\\t\\t\\tIS_Widget.setIcon(divMenuIcon, menuItem.type, {multi:menuItem.multi});\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(IS_Portal.isChecked(menuItem) && !/true/.test(menuItem.multi)){\\r\\n\\t\\t\\t\\thandler.destroy();\\r\\n\\t\\t\\t\\tElement.addClassName(divMenuIcon, 'menuItemIcon_dropped');\\r\\n\\t\\t\\t\\tIS_Event.observe(divMenuIcon, 'mouseover', displayTabName, false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\tmenuLi.style.cursor = \\\"default\\\";\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t//The time of 200 to 300millsec is lost because addListener execute new Array\\r\\n\\t\\t\\tfunction getPostDragHandler(menuItemId, handler){\\r\\n\\t\\t\\t\\treturn function(){ postDragHandler(menuItemId, handler);};\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfunction postDragHandler(menuItemId, handler){\\r\\n\\t\\t\\t\\t//fix 209 The widget can not be dropped to a tab sometimes if it is allowed to be dropped plurally.\\r\\n\\t\\t\\t\\tif( /true/i.test( menuItem.multi ) )\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\ttry{\\r\\n//\\t\\t\\t\\t\\tEvent.stopObserving(menuLi, \\\"mousedown\\\", handler, false);\\r\\n\\t\\t\\t\\t\\thandler.destroy();\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tElement.addClassName(divMenuIcon, 'menuItemIcon_dropped');\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t$(\\\"mc_\\\" + menuItemId).parentNode.style.background = \\\"#F6F6F6\\\";\\r\\n\\t\\t\\t\\t\\t//$(\\\"m_\\\" + menuItemId).style.color = \\\"#5286bb\\\";\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tIS_Event.observe(divMenuIcon, 'mouseover', displayTabName, false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\t}catch(e){\\r\\n\\t\\t\\t\\t\\tmsg.debug(IS_R.getResource(IS_R.ms_menuIconException,[menuItemId,e]));\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\tmenuLi.style.cursor = \\\"default\\\";\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tIS_EventDispatcher.addListener('dropWidget', menuItem.id, getPostDragHandler(menuItem.id,handler), true);\\r\\n\\t\\t\\tif( menuItem.properties && menuItem.properties.url ) {\\r\\n\\t\\t\\t\\tvar url = menuItem.properties.url;\\r\\n\\t\\t\\t\\tIS_EventDispatcher.addListener( IS_Widget.DROP_URL,url,( function( menuItem,handler ) {\\r\\n\\t\\t\\t\\t\\t\\treturn function( widget ) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif( !IS_Portal.isMenuType( widget,menuItem )) return;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tpostDragHandler(menuItem.id, handler);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t})( menuItem,handler ) );\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfunction getCloseWidgetHandler(menuItemId, handler){\\r\\n\\t\\t\\t\\treturn function(){ closeWidgetHandler(menuItemId, handler);};\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfunction closeWidgetHandler(menuItemId, handler){\\r\\n\\t\\t\\t\\ttry{\\r\\n//\\t\\t\\t\\t\\tIS_Event.observe(menuLi, \\\"mousedown\\\", handler, false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\t\\tEvent.observe(handler.handle, \\\"mousedown\\\", handler.eventMouseDown);\\r\\n\\t\\t\\t\\t\\tIS_Draggables.register(handler);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tElement.removeClassName(divMenuIcon, 'menuItemIcon_dropped');\\r\\n\\t\\t\\t\\t\\t\\r\\n//\\t\\t\\t\\t\\tdivMenuIcon.className = (/MultiRssReader/.test(menuItem.type))? \\\"menuItemIcon_multi_rss\\\" : \\\"menuItemIcon_rss\\\";\\r\\n\\t\\t\\t\\t\\tmenuLi.style.cursor = \\\"move\\\"\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdivMenuIcon.title = \\\"\\\";\\r\\n\\t\\t\\t\\t\\tIS_Event.stopObserving(divMenuIcon, 'mouseover', displayTabName, false, \\\"_menu\\\");\\r\\n\\t\\t\\t\\t}catch(e){\\r\\n\\t\\t\\t\\t\\tmsg.debug(IS_R.getResource(IS_R.ms_menuIconException,[menuItemId,e]));\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tIS_EventDispatcher.addListener('closeWidget', menuItem.id, getCloseWidgetHandler(menuItem.id, handler), true);\\r\\n\\t\\t\\tif( menuItem.properties && menuItem.properties.url ) {\\r\\n\\t\\t\\t\\tvar url = menuItem.properties.url;\\r\\n\\t\\t\\t\\tIS_EventDispatcher.addListener( IS_Widget.CLOSE_URL,url,( function( menuItem,handler ) {\\r\\n\\t\\t\\t\\t\\t\\treturn function( widget ) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif( !IS_Portal.isMenuType( widget,menuItem )) return;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tcloseWidgetHandler(menuItem.id, handler);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t})( menuItem,handler ) );\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\tif ( IS_SiteAggregationMenu.menuItemTreeMap[menuItem.id] && IS_SiteAggregationMenu.menuItemTreeMap[menuItem.id].length > 0) {\\r\\n\\t\\t\\tvar divSubMenuIcon = document.createElement(\\\"div\\\");\\r\\n\\t\\t\\tdivSubMenuIcon.className = \\\"subMenuIcon\\\";\\r\\n\\t\\t\\tdivMenuItem.appendChild(divSubMenuIcon);\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\tmenuLi.appendChild(divMenuItem);\\r\\n\\t\\tIS_Event.observe(menuLi,\\\"mouseout\\\", getMenuItemMOutHandler(menuLi), false, \\\"_menu\\\");\\r\\n\\t\\tIS_Event.observe(menuLi,\\\"mouseover\\\", getMenuItemMoverFor(menuLi, menuItem), false, \\\"_menu\\\");\\r\\n\\t\\treturn menuLi;\\r\\n\\t}\",\n \"function createAndAppendCxtMenuComponent() {\\n var classes = getClassStr(options.contextMenuClasses);\\n// classes += ' cy-context-menus-cxt-menu';\\n $cxtMenu = $('<div class=' + classes + '></div>');\\n $cxtMenu.addClass('cy-context-menus-cxt-menu');\\n setScratchProp('cxtMenu', $cxtMenu);\\n\\n $('body').append($cxtMenu);\\n return $cxtMenu;\\n }\",\n \"function createMenuItemComponent(item) {\\n var classStr = getMenuItemClassStr(options.menuItemClasses, item.hasTrailingDivider);\\n var itemStr = '<button id=\\\"' + item.id + '\\\" class=\\\"' + classStr + '\\\"';\\n\\n if(item.tooltipText) {\\n itemStr += ' title=\\\"' + item.tooltipText + '\\\"';\\n }\\n\\n if(item.disabled) {\\n itemStr += ' disabled';\\n }\\n if (!item.image){\\n itemStr += '>' + item.content + '</button>';\\n }\\n else{\\n itemStr += '>' + '<img src=\\\"' + item.image.src + '\\\" width=\\\"' + item.image.width + 'px\\\"; height=\\\"'\\n + item.image.height + 'px\\\"; style=\\\"position:absolute; top: ' + item.image.y + 'px; left: '\\n + item.image.x + 'px;\\\">' + item.content + '</button>';\\n };\\n\\n var $menuItemComponent = $(itemStr);\\n\\n $menuItemComponent.data('selector', item.selector); \\n $menuItemComponent.data('on-click-function', item.onClickFunction);\\n $menuItemComponent.data('show', (typeof(item.show) === 'undefined' || item.show)); \\n return $menuItemComponent;\\n }\",\n \"function onContextMenu_Item(event, mEdit, mCopy, callbackEvent, callbackWindow, jaloPk, webroot) {\\r\\n\\tvar element = getMenuHTMLElement();\\r\\n\\tshowCMSMenu( element, event);\\r\\n\\taddItemLinks(element, mEdit, mCopy, callbackEvent, callbackWindow, jaloPk, webroot);\\r\\n\\tevent.cancelBubble=true;\\r\\n\\treturn false;\\r\\n}\",\n \"function digglerCreateTempMenuItemName(aParent, label, url)\\n{\\n // Create\\n let id = \\\"diggler-menuitem-\\\" + currentMenuItems.length;\\n let newmenu = {\\n id: id,\\n title: label,\\n contexts: [\\\"browser_action\\\", \\\"page_action\\\"]\\n };\\n if (aParent)\\n newmenu.parentId = aParent;\\n browser.menus.create( newmenu );\\n\\n // Store info\\n currentMenuItems.push({\\n \\\"id\\\": id,\\n \\\"label\\\": label,\\n \\\"url\\\": url\\n });\\n\\n return id;\\n}\",\n \"function browserMenusCreate( parentId, options )\\n{\\n // Only add parent if it's set\\n if (parentId !== \\\"\\\")\\n options.parentId = parentId;\\n\\n // Do it\\n browser.menus.create( options );\\n}\",\n \"function createMenuItem(template) {\\n return menuitem_1.MenuItem.fromTemplate(template);\\n}\",\n \"function createMenuItem(template) {\\n return menuitem_1.MenuItem.fromTemplate(template);\\n}\",\n \"onRightClick() {\\n const menuConfig = Menu.buildFromTemplate([\\n {\\n label: 'Quit',\\n click: () => app.quit()\\n }\\n ]);\\n this.popUpContextMenu(menuConfig);\\n }\",\n \"function AddMenuItem(htmlElementParent, name, cssClass, functionOnClick, elementType ) {\\r\\n\\tif (elementType==null) elementType = \\\"div\\\";\\r\\n\\tvar item = document.createElement(elementType);\\r\\n\\tif (cssClass!=null) item.className=cssClass;\\r\\n\\tif (name!=null) item.innerHTML=name;\\r\\n\\thtmlElementParent.appendChild(item);\\r\\n\\t//MenuSetPosition(item);\\r\\n\\tif (functionOnClick!=null) { //ignore inactive menu\\r\\n\\t\\tif (MENU_TUTORIAL == null) item.onclick=functionOnClick; //in game\\r\\n\\t\\telse {\\r\\n\\t\\t\\tMENU_TUTORIAL[name] = item; //in tuto only\\r\\n\\t\\t\\titem.fakeClick = functionOnClick;\\r\\n\\t\\t}\\r\\n\\t\\tMENU_ITEMS.push(item);\\r\\n\\t\\t//console.log(\\\"DEBUG Util.AddMenuItem : item = \\\" + item + \\\" \\\" + name);\\r\\n\\t}\\r\\n\\treturn item;\\r\\n}\",\n \"function MASH_ContextualMenu(tmpLeft, tmpTop, tmpObj) {\\n\\n var tmpStyle = \\\"align:left; vertical-align:top; background-color:#e4e4e4; border-color:#000000; border-width:1; border-style:solid; color:#000000; font-family:arial; font-size:9pt; font-weight:normal;\\\";\\n\\n this.base = MASH_Object;\\n this.base(\\\"\\\", tmpLeft, tmpTop, 200, MASH_ContextualMenu.getInitialHeight(), topZ+1, tmpStyle );\\n\\n this.targetObj = tmpObj;\\n\\n this.innerStyle = tmpStyle;\\n\\n this.MASHobjectType = MASH_Object.CONTEXTUAL_MENU;\\n\\n //context menu\\n this.contextMenuString = \\\"\\\";\\n}\",\n \"initContextMenu() {\\n this.menu = new D3NE.ContextMenu(this._contextMenuData);\\n }\",\n \"setupMenu () {\\n let dy = 17;\\n // create buttons for the action categories\\n this.menu.createButton(24, 0, () => this.selectionMode = 'info', this, null, 'info');\\n this.menu.createButton(41, 0, () => this.selectionMode = 'job', this, null, 'job');\\n // create buttons for each command\\n for (let key of Object.keys(this.jobCommands)) {\\n let button = this.menu.createButton(0, dy, () => this.jobCommand = key, this, this.jobCommands[key].name);\\n dy += button.height + 1;\\n }\\n // set the hit area for the menu\\n this.menu.calculateHitArea();\\n // menu is closed by default\\n this.menu.hideMenu();\\n }\",\n \"function checkboxOnClick(info, tab) {\\n\\tconsole.log(JSON.stringify(info));\\n\\tvar parent = chrome.contextMenus.create({\\\"title\\\": \\\"aux\\\"});\\n\\nfor (var i = 6; i < 8; i++) {\\n\\tvar context = \\\"selection\\\";\\n var thatit = titles[i];\\n var deei = chrome.contextMenus.create({\\\"title\\\": thatit,\\\"parentId\\\": parent, \\\"onclick\\\": process});\\n idz[i] = deei;\\n\\tconsole.log(\\\"'\\\" + context + \\\"' item:\\\" + idz[i]);\\n }\\n }\",\n \"function clickContextMenuItem(dataValue) {\\n\\t\\t//GET VALUES\\n\\t\\tlet setting = $(dataValue).parent().parent().data(\\\"setting\\\");\\n\\t\\tlet value = $(dataValue).data(\\\"value\\\")\\n\\t\\tlet label = $(dataValue).data(\\\"label\\\")\\n\\t\\tlet iconGroup = $(dataValue).data(\\\"icongroup\\\")\\n\\t\\tlet iconName = $(dataValue).data(\\\"iconname\\\")\\n\\t\\t\\n\\t\\t//HANDLE PICKERS\\n\\t\\tif ($(dataValue).parent().parent().data(\\\"type\\\") == \\\"picker\\\") {\\n\\t\\t\\t//SET STATE\\n\\t\\t\\t$(dataValue).siblings().removeClass(\\\"picked\\\"); //Removes the picked class from all siblings of the clicked item\\n\\t\\t\\t$(dataValue).addClass(\\\"picked\\\"); //Adds the picked class to the clicked item\\n\\t\\t\\t$(`[data-setting=\\\"${setting}\\\"] .contextLabel`).empty().append(label); //Clears the label of the parent button and appends the clicked item value\\n\\t\\t}\\n\\t\\t\\n\\t\\tif ($(dataValue).parent().parent().data(\\\"type\\\") == \\\"pickericons\\\") {\\n\\t\\t\\t//SET STATE\\n\\t\\t\\t$(dataValue).siblings().removeClass(\\\"picked\\\"); //Removes the picked class from all siblings of the clicked item\\n\\t\\t\\t$(dataValue).addClass(\\\"picked\\\"); //Adds the picked class to the clicked item\\n\\t\\t\\t$(`[data-setting=\\\"${setting}\\\"] .contextLabel`).empty().append(window[iconGroup][iconName]).append(label); //Clears the label of the parent button and appends the clicked item value\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn {value, label};\\n\\t}\",\n \"function createTopMenu(menuItem){\\r\\n\\t\\tvar topLi = document.createElement(\\\"li\\\");\\r\\n\\t\\ttopLi.id = menuItem.id;\\r\\n\\t\\ttopLi.className = \\\"topMenuLi\\\";\\r\\n\\t\\ttopLi.style.height = \\\"1.75em\\\";//IE\\r\\n\\t\\tvar titleA =document.createElement(\\\"a\\\");\\r\\n\\t\\ttitleA.className = \\\"topMenuItem\\\";\\r\\n\\t\\ttitleA.title = menuItem.title;\\r\\n\\t\\tif(menuItem.href){\\r\\n\\t\\t\\ttitleA.href = menuItem.href;\\r\\n\\t\\t\\tif(menuItem.display == \\\"self\\\") {\\r\\n\\t\\t\\t\\ttitleA.target = \\\"_self\\\";\\r\\n\\t\\t\\t} else if(menuItem.display == \\\"newwindow\\\"){\\r\\n\\t\\t\\t\\ttitleA.target = \\\"_blank\\\";\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tif(menuItem.display == \\\"inline\\\")\\r\\n\\t\\t\\t\\t\\ttitleA.target=\\\"ifrm\\\";\\r\\n\\t\\t\\t\\tvar titleAOnclick = function(e){\\r\\n\\t\\t\\t\\t\\tIS_Portal.buildIFrame(titleA);\\r\\n\\t\\t\\t\\t}\\r\\n//\\t\\t\\t\\tIS_Event.observe(titleA, \\\"click\\\", titleAOnclick, false, menuItem.id);\\r\\n\\t\\t\\t\\tIS_Event.observe(titleA, \\\"click\\\", titleAOnclick, false, \\\"_menu\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t}else{\\r\\n\\t\\t\\ttitleA.href = \\\"#\\\";\\r\\n\\t\\t\\ttitleA.style.cursor =\\\"default\\\";\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\ttitleA.appendChild(document.createTextNode(menuItem.title));\\r\\n\\t\\ttopLi.appendChild(titleA);\\r\\n\\t\\tIS_Event.observe(topLi,\\\"blur\\\", getTopMenuItemMOutHandler(topLi), false, \\\"_menu\\\");\\r\\n\\t\\tIS_Event.observe(topLi,\\\"mouseout\\\", getTopMenuItemMOutHandler(topLi), false, \\\"_menu\\\");\\r\\n\\t\\tIS_Event.observe(topLi, \\\"focus\\\", getTopMenuMOverHandler(topLi, menuItem), false, \\\"_menu\\\");\\r\\n\\t\\tIS_Event.observe(topLi, \\\"mouseover\\\", getTopMenuMOverHandler(topLi, menuItem), false, \\\"_menu\\\");\\r\\n\\t\\treturn topLi;\\r\\n\\t}\",\n \"function digglerCreateTempMenuItem(aParent, url)\\n{\\n digglerCreateTempMenuItemName(aParent,url,url);\\n}\",\n \"function trayPopUpContextMenu(json) {\\n let menu = menuCreate(json.menu);\\n let position = json.menuPopupOptions;\\n if (!menu && !position) elements[json.targetID].popUpContextMenu();\\n else if (menu && !position) elements[json.targetID].popUpContextMenu(menu);\\n else if (!menu && position) elements[json.targetID].popUpContextMenu(position);\\n else elements[json.targetID].popUpContextMenu(menu, position);\\n}\",\n \"function createFontFaceMenuitem(aFontLabel, aFontName, aMenuPopup) {\\n let itemNode = document.createXULElement(\\\"menuitem\\\");\\n itemNode.setAttribute(\\\"label\\\", aFontLabel);\\n itemNode.setAttribute(\\\"value\\\", aFontName);\\n itemNode.setAttribute(\\n \\\"value_parsed\\\",\\n aFontName.toLowerCase().replace(/, /g, \\\",\\\")\\n );\\n itemNode.setAttribute(\\\"tooltiptext\\\", aFontLabel);\\n if (aMenuPopup.getAttribute(\\\"useRadios\\\") == \\\"true\\\") {\\n itemNode.setAttribute(\\\"type\\\", \\\"radio\\\");\\n itemNode.setAttribute(\\\"observes\\\", \\\"cmd_renderedHTMLEnabler\\\");\\n }\\n return itemNode;\\n}\",\n \"function addChildrenToContextMenu() {\\n chrome.storage.local.get(null, function(items) {\\n\\n if (items.duckDuckGoLink === true) {\\n addChildToContextMenu('DuckDuckGo', '');\\n }\\n if (items.googleLink === true) {\\n addChildToContextMenu('Google', '!g');\\n }\\n if (items.googleImagesLink === true) {\\n addChildToContextMenu('Google Images', '!gi');\\n }\\n if (items.yandexLink === true) {\\n addChildToContextMenu('Yandex', '!ya');\\n }\\n if (items.yandexImagesLink === true) {\\n addChildToContextMenu('Yandex Images', '!ymg');\\n }\\n });\\n}\",\n \"function MenuItem(n, text, label)\\n{\\n this.domRef = document.createElement(\\\"div\\\");\\n this.domRef.setAttribute(\\\"id\\\", \\\"menuItem\\\" + n);\\n this.domRef.setAttribute(\\\"class\\\", \\\"menuItem\\\");\\n this.domRef.setAttribute(\\\"className\\\", \\\"menuItem\\\");\\n this.text = text;\\n this.label = label;\\n}\",\n \"function handleContextMenu(info, tab) {\\n //store selected text\\n selectedText = info.selectionText;\\n //open new tab to create issue \\n openMainPage(\\\"/new_issue\\\");\\n}\",\n \"function createMenuItem(ItemTargetId, ItemText) {\\n let menuItem = document.createElement('li');\\n let menuItemLink = document.createElement('a');\\n\\n menuItemLink.className = 'menu__link';\\n // menuItemLink.href = '#' + ItemTargetId;\\n\\n menuItemLink.addEventListener(\\\"click\\\", (e) => {\\n const section = document.querySelector('#' + e.target.dataset.sectionId);\\n section.scrollIntoView({ block: 'start', behavior: \\\"smooth\\\" });\\n });\\n\\n // add section id to the li elemant data\\n menuItemLink.dataset.sectionId = ItemTargetId;\\n menuItemLink.innerText = ItemText;\\n\\n menuItem.appendChild(menuItemLink);\\n\\n return menuItem;\\n}\",\n \"function onContextMenuCreated( menuId, useAsParent )\\n{\\n // Parent ID to use - to cater for the text submenu being promoted to the main menu\\n let parentId = ( useAsParent ? menuId : \\\"\\\" );\\n\\n // Create always-there menus\\n let text = removeAccess( browser.i18n.getMessage(\\\"unaltered\\\") );\\n browserMenusCreate( parentId, {\\n id: menuId + \\\"-unaltered\\\",\\n title: text,\\n contexts: [\\\"selection\\\",\\\"link\\\"]\\n });\\n\\n // Now create prefs menus\\n if (prefs.hasOwnProperty(\\\"submenus\\\"))\\n {\\n // Separator\\n browserMenusCreate( parentId, {\\n id: menuId + \\\"-separator\\\",\\n type: \\\"separator\\\",\\n contexts: [\\\"selection\\\",\\\"link\\\"]\\n });\\n\\n // Prefs.\\n for (let n in prefs.submenus)\\n {\\n let formatstr = prefs.submenus[n];\\n\\n // Watch for custom separators\\n if (formatstr.search(/^-+$/) === 0)\\n {\\n // Sep.\\n browserMenusCreate( parentId, {\\n id: menuId + \\\"-pref-\\\" + n,\\n type: \\\"separator\\\",\\n contexts: [\\\"selection\\\",\\\"link\\\"]\\n });\\n }\\n else\\n {\\n // Menu item\\n browserMenusCreate( parentId, {\\n id: menuId + \\\"-pref-\\\" + n,\\n title: getMenuText( formatstr ),\\n contexts: [\\\"selection\\\",\\\"link\\\"]\\n });\\n }\\n }\\n submenuCount = prefs.submenus.length;\\n }\\n}\",\n \"function xcustom_onContextMenu(event) {\\r\\n console.log('there we are...');\\r\\n}\",\n \"static addMenuOption(menuX, menuY, textContent, goto, context) {\\n let textObj = context.add.text(menuX, menuY + 60 * context.menuSize,\\n textContent, {fontSize: '32px', fill: '#fff'});\\n context.menuSize++;\\n textObj.setOrigin(0.5);\\n textObj.setInteractive();\\n textObj.on('pointerdown', function(pointer) {\\n if (!context.lockControl) {\\n context.lockControl = true;\\n textObj.setColor('#737373');\\n context.time.delayedCall(150, function (game) {\\n game.scene.start(goto);\\n }, [context], context);\\n }\\n }, context);\\n textObj.on('pointerover', function(pointer) {\\n if (!context.lockControl) {\\n textObj.setColor('#C0C0C0');\\n }\\n }, context);\\n textObj.on('pointerout', function(pointer) {\\n if (!context.lockControl) {\\n textObj.setColor('#fff');\\n }\\n }, context);\\n }\",\n \"beforeContextMenuShow() {}\",\n \"beforeContextMenuShow() {}\",\n \"function contextMenu(e){\\r\\n\\tprintln(\\\"context\\\");\\r\\n\\treturn false;\\r\\n}\",\n \"function PivotContextMenu(parent){/* eslint-enable */this.parent=parent;this.parent.contextMenuModule=this;}\",\n \"function createMenuItem(text){\\n var li = $(\\\"<li>\\\").text(text).addClass(\\\"list-group-item\\\");\\n $(\\\".list-group\\\").append(li);\\n }\",\n \"function ContextMenuAction(info, tab){\\n\\n //We loop through all existing tags. For each one, check if this link has it or not, and show/hide the tick accordingly\\n for (i=0; i<existingTags.length; i++){\\n \\n ctxtmenuID = (\\\"id-\\\" + existingTags[i]); //e.g. \\\"id-seen\\\" is the id of the context menu that toggles tag \\\"seen\\\"\\n \\n if (info.menuItemId === ctxtmenuID) { //Was this the clicked context menu item?\\n\\n //Get url of right-clicked item\\n if (info.linkUrl) url = info.linkUrl; //Context menu opened on a link\\n else if (info.pageUrl) url = info.pageUrl; //Context menu opened on current page (anywhere on its background)\\n else return; //Clicked something else -> We have no url to check, stop here. Just in case, shouldn't happen.\\n\\n url = normalizeUrl(url);\\n ToggleTagInLocalStorage(url, existingTags[i], tab);\\n }\\n }\\n\\n}\",\n \"function loadMenuItems () {\\n chrome.contextMenus.removeAll(function () {\\n console.log(\\\"clear all context items\\\")\\n });\\n\\n chrome.storage.sync.get(null, function(items) {\\n var allKeys = Object.keys(items);\\n console.log(\\\"adding context items\\\")\\n\\n allKeys.forEach(function (key) {\\n var menuId = chrome.contextMenus.create({\\n \\\"title\\\" : key,\\n \\\"type\\\" : \\\"normal\\\",\\n \\\"contexts\\\" : [\\\"image\\\"],\\n \\\"onclick\\\" : getClickHandler()\\n });\\n mapInfo[menuId] = key;\\n })\\n });\\n\\n // default one\\n chrome.contextMenus.create({\\n \\\"title\\\" : \\\"New ChainId\\\",\\n \\\"type\\\" : \\\"normal\\\",\\n \\\"contexts\\\" : [\\\"image\\\"],\\n \\\"onclick\\\" : getNewChainClickHandler()\\n });\\n}\",\n \"constructContextmenu(allSuggestion, splittedSuggestion) {\\n let contextMenuItems = this.customItems.length > 0 ? this.customItems.slice() : [];\\n // classList(this.noSuggestion,['e-disabled'],[]);\\n if (isNullOrUndefined(allSuggestion) || allSuggestion.length === 0) {\\n contextMenuItems.push({ text: 'no suggestions', id: CONTEXTMENU_NO_SUGGESTION, classList: ['e-focused'], iconCss: '' });\\n }\\n else {\\n for (let i = 0; i < allSuggestion.length; i++) {\\n // tslint:disable-next-line:max-line-length\\n contextMenuItems.push({ text: allSuggestion[i], id: CONTEXTMENU_SPELLCHECK_OTHERSUGGESTIONS + allSuggestion[i], iconCss: '' });\\n }\\n }\\n contextMenuItems.push({ separator: true, id: '_contextmenu_suggestion_seperator' });\\n if (!isNullOrUndefined(splittedSuggestion) && splittedSuggestion.length > 1) {\\n contextMenuItems.push({ text: 'More Suggestion', items: splittedSuggestion });\\n contextMenuItems.push({ separator: true, id: '_contextmenu_moreSuggestion_seperator' });\\n }\\n else {\\n // tslint:disable-next-line:max-line-length\\n contextMenuItems.push({ text: 'Add To Dictionary ', id: '_contextmenu_otherSuggestions_spellcheck_Add To Dictionary', iconCss: '' });\\n }\\n contextMenuItems.push({ text: 'Ignore Once', id: '_contextmenu_otherSuggestions_spellcheck_Ignore Once', iconCss: '' });\\n contextMenuItems.push({ text: 'Ignore All', id: '_contextmenu_otherSuggestions_spellcheck_Ignore All', iconCss: '' });\\n contextMenuItems.push({ separator: true, id: '_contextmenu_change_seperator' });\\n // tslint:disable-next-line:max-line-length\\n contextMenuItems.push({ text: this.locale.getConstant('Spelling'), id: CONTEXTMENU_SPELLING_DIALOG, iconCss: 'e-icons e-de-spellcheck', items: [] });\\n contextMenuItems.push({ separator: true, id: '_contextmenu_spelling_seperator' });\\n return contextMenuItems;\\n }\",\n \"function fnPluginTaskTreeViewContextMenu(node) {\\n\\n\\tvar $items = {};\\n\\n\\t// Only when the user is connected; don't add these items in the contextual menu otherwise\\n\\tif (marknotes.settings.authenticated === 1) {\\n\\n\\t\\tvar tree = $('#TOC').jstree(true);\\n\\n\\t\\t// Give the ability to create a new folder but only when the user right-click on a\\n\\t\\t// folder : don't allow to create a folder if he click on a note\\n\\n\\t\\tvar $type = (node.icon.substr(0, 6).toLowerCase() === \\\"folder\\\" ? \\\"folder\\\" : \\\"file\\\");\\n\\n\\t\\tif ($type === 'folder') {\\n\\t\\t\\t$items.Add_Folder = {\\n\\t\\t\\t\\tseparator_before: false,\\n\\t\\t\\t\\tseparator_after: false,\\n\\t\\t\\t\\tlabel: marknotes.message.tree_new_folder,\\n\\t\\t\\t\\ticon: 'fa fa-folder-open-o',\\n\\t\\t\\t\\taction: function () {\\n\\t\\t\\t\\t\\tvar $node = tree.create_node(node, {\\n\\t\\t\\t\\t\\t\\ttext: marknotes.message.tree_new_folder_name,\\n\\t\\t\\t\\t\\t\\ticon: \\\"folder\\\"\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\ttree.edit($node);\\n\\t\\t\\t\\t}\\n\\t\\t\\t};\\n\\t\\t}\\n\\n\\t\\t// And a new note too\\n\\t\\t$items.Add_Item = {\\n\\t\\t\\tseparator_before: false,\\n\\t\\t\\tseparator_after: false,\\n\\t\\t\\tlabel: marknotes.message.tree_new_note,\\n\\t\\t\\ticon: 'fa fa-file-text-o',\\n\\t\\t\\taction: function () {\\n\\n\\t\\t\\t\\t// When the user has right-clicked on a folder, add the note within that folder\\n\\t\\t\\t\\t// When it was a note, add the new note in the same folder i.e. the parent of the note\\n\\t\\t\\t\\tvar $node = tree.create_node(\\n\\t\\t\\t\\t\\t//($type === 'folder' ? node : node.parent),\\n\\t\\t\\t\\t\\tnode, {\\n\\t\\t\\t\\t\\t\\ttext: marknotes.message.tree_new_note_name,\\n\\t\\t\\t\\t\\t\\ticon: \\\"file file-md\\\",\\n\\t\\t\\t\\t\\t\\tdata: {\\n\\t\\t\\t\\t\\t\\t\\ttask: \\\"display\\\"\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t);\\n\\t\\t\\t\\ttree.edit($node);\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\t\\t// Rename an existing note or folder\\n\\t\\t$items.Rename = {\\n\\t\\t\\tseparator_before: false,\\n\\t\\t\\tseparator_after: false,\\n\\t\\t\\tlabel: marknotes.message.tree_rename,\\n\\t\\t\\ticon: 'fa fa-pencil',\\n\\t\\t\\taction: function () {\\n\\t\\t\\t\\ttree.edit(node);\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\t\\t// Kill a note or folder\\n\\t\\t$items.Remove = {\\n\\t\\t\\tseparator_before: true,\\n\\t\\t\\tseparator_after: false,\\n\\t\\t\\tlabel: ($type === 'folder' ? marknotes.message.tree_delete_folder.replace('%s', node.text) : marknotes.message.tree_delete_file.replace('%s', node.text)),\\n\\t\\t\\ticon: 'fa fa-trash',\\n\\t\\t\\taction: function () {\\n\\t\\t\\t\\tnoty({\\n\\t\\t\\t\\t\\ttheme: 'relax',\\n\\t\\t\\t\\t\\ttimeout: 0,\\n\\t\\t\\t\\t\\tlayout: 'center',\\n\\t\\t\\t\\t\\ttype: 'warning',\\n\\t\\t\\t\\t\\ttext: '<strong>' + ($type === 'folder' ? marknotes.message.tree_delete_folder_confirm.replace('%s', node.text) : marknotes.message.tree_delete_file_confirm.replace('%s', node.text)) + '</strong>',\\n\\t\\t\\t\\t\\tbuttons: [{\\n\\t\\t\\t\\t\\t\\t\\taddClass: 'btn btn-primary',\\n\\t\\t\\t\\t\\t\\t\\ttext: marknotes.message.ok,\\n\\t\\t\\t\\t\\t\\t\\tonClick: function ($noty) {\\n\\t\\t\\t\\t\\t\\t\\t\\t$noty.close();\\n\\t\\t\\t\\t\\t\\t\\t\\ttree.delete_node(node);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t},\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\taddClass: 'btn btn-danger',\\n\\t\\t\\t\\t\\t\\t\\ttext: marknotes.message.cancel,\\n\\t\\t\\t\\t\\t\\t\\tonClick: function ($noty) {\\n\\t\\t\\t\\t\\t\\t\\t\\t$noty.close();\\n\\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}); // noty()\\n\\t\\t\\t} // action()\\n\\t\\t};\\n\\n\\t} else {\\n\\n\\t\\t/*<!-- build:debug -->*/\\n\\t\\tif (marknotes.settings.debug) {\\n\\t\\t\\tconsole.log('The user isn\\\\'t connected so no actions like create a note added in the treeview');\\n\\t\\t}\\n\\t\\t/*<!-- endbuild -->*/\\n\\n\\t} // if (marknotes.settings.authenticated === 1)\\n\\n\\treturn $items;\\n\\n}\",\n \"function contextListener() {\\n document.addEventListener( \\\"contextmenu\\\", function(e) {\\n taskItemInContext = clickInsideElement( e, taskItemClassName );\\n\\n if ( taskItemInContext ) {\\n e.preventDefault();\\n\\n var dataFolderId = 0;\\n if(e.target.attributes['data-folder-id'] != undefined) {\\n dataFolderId = e.target.attributes['data-folder-id'].value;\\n }\\n\\n var dataFolderName = '';\\n if(e.target.attributes['data-folder-name'] != undefined) {\\n dataFolderName = e.target.attributes['data-folder-name'].value;\\n }\\n\\n var dataFolderColorId = '';\\n if(e.target.attributes['data-folder-color-id'] != undefined) {\\n dataFolderColorId = e.target.attributes['data-folder-color-id'].value;\\n }\\n\\n $(\\\"body .context-menu__link\\\").each(\\n function (index, elem) {\\n //Kostyl\\n if(dataFolderId == 0) {\\n $(elem).css(\\\"display\\\",\\\"none\\\");\\n if($(elem).attr(\\\"data-action\\\") == \\\"Create\\\") {\\n $(elem).css(\\\"display\\\",\\\"block\\\");\\n }\\n }\\n else\\n {\\n $(elem).css(\\\"display\\\",\\\"block\\\");\\n }\\n\\n\\n $(elem).attr(\\\"data-folder-id\\\", dataFolderId);\\n $(elem).attr(\\\"data-folder-name\\\", dataFolderName);\\n $(elem).attr(\\\"data-folder-color-id\\\", dataFolderColorId);\\n }\\n );\\n\\n toggleMenuOn();\\n positionMenu(e);\\n } else {\\n taskItemInContext = null;\\n toggleMenuOff();\\n }\\n });\\n }\",\n \"function createMenuItem(label, link, subMenu) {\\n\\t\\treturn $('<li>').append(\\n\\t\\t\\t$('<a>', {\\n\\t\\t\\t\\ttext: label,\\n\\t\\t\\t\\thref: link\\n\\t\\t\\t}),\\n\\t\\t\\t(typeof subMenu === 'undefined') ? null : subMenu\\n\\t\\t);\\n\\t}\",\n \"function setMenuContext(options) {\\n this.hType = options.hType;\\n this.hNum = options.hNum;\\n setMenuPosition.call(this, options.target);\\n }\",\n \"function createMenu(app) {\\n const { commands } = app;\\n let menu = new widgets_1.Menu({ commands });\\n menu.title.label = 'BookMark';\\n exports.BookMarks.forEach(item => menu.addItem({ command: `BookMark-${item.name}:show` }));\\n return menu;\\n }\",\n \"create(menuItemClickE) {\\n // 事件绑定\\n // 1. 菜单组收起和展开\\n $(this).find('.mnavmenu-label').each((item, i) => {\\n item.onclick = () => {\\n let itemBoxCls = '.mnavmenu-itembox';\\n let menuItemIsClose = $(item).prev(itemBoxCls).hasClass('close');\\n $(this).find(itemBoxCls).addClass('close');\\n if (menuItemIsClose == true) {\\n $(item).prev(itemBoxCls).removeClass('close');\\n }\\n }\\n })\\n // 2. 子菜单项点击\\n $(this).find('.mnavmenu-item,.mnavmenu-menu').each((item, index) => {\\n item.onclick = () => {\\n $(item).parent('.mnavmenu').find('.mnavmenu-itembox').addClass('close');\\n if (typeof menuItemClickE == 'function')\\n menuItemClickE(item, index);\\n }\\n });\\n\\n }\",\n \"function setContextualMenu(c){\\n\\n\\t\\tvar projection;\\n var contextmenuDir;\\n \\n projection = map.getProjection() ;\\n $('.contextualMenu').remove();\\n\\n //Il me semble intéressant de créer le menu contextuel par code afin de permettre l'animation par exemple dynamiquement.\\n contextmenuDir = document.createElement(\\\"div\\\");\\n contextmenuDir.className = 'contextualMenu';\\n var itemHtml = \\\"\\\";\\n for(var i = 0 ; i<contextualItem.length; i++){\\n \\titemHtml += \\\"<a id='\\\"+contextualItem[i].id+\\\"' href='#' onClick='\\\"+contextualItem[i].action+\\\"'><div class=context>\\\"+contextualItem[i].title+\\\"<\\\\/div><\\\\/a>\\\";\\n }\\n\\n contextmenuDir.innerHTML = itemHtml;\\n \\n // contextmenuDir.innerHTML = \\\"<a id='menu1'><div class=context>Emplacement par défaut<\\\\/div><\\\\/a><a id='menu2' href='#' onClick='\\\"+contextualItem[0].action+\\\"'><div class=context>Zoomer ici<\\\\/div><\\\\/a>\\\";\\n $(map.getDiv()).append(contextmenuDir);\\n \\n computeMenuPosition(c);\\n\\n contextmenuDir.style.visibility = \\\"visible\\\";\\n\\n \\n\\n}\",\n \"function createObjectContextMenu(position, objectId){\\n\\tremoveContextMenu();\\n\\tvar mapObjectEntity = mapObjectsEntityArray[objectId];\\n\\tvar newContextMenu = document.createElement(\\\"div\\\");\\n\\tnewContextMenu.id = \\\"contextMenu\\\";\\n\\tnewContextMenu.style.top = position.y;\\n\\tnewContextMenu.style.left = position.x;\\n\\tvar menuArray = [];\\n\\t\\n\\t//load the contextmenu with event options\\n\\tvar eventTypes = objectProperties[mapObjectEntity.type].eventTypes;\\n\\tfor(var i=0;i<eventTypes.length;i++){\\n\\t\\tvar eventType = eventTypes[i];\\n\\t\\tvar eventTypeNice = eventType[0].toUpperCase() + eventType.slice(1).toLowerCase();\\n\\t\\tvar mapObjName = objectProperties[mapObjectEntity.type].name;\\n\\t\\tvar mapObjNameNice = mapObjName[0].toUpperCase() + mapObjName.slice(1);\\n\\t\\tmenuArray.push(\\\"<div id='mapObjectOption\\\" + eventType +\\\"' data-event='\\\" + eventType + \\\"' data-event-index='\\\" + i + \\\"' data-objectid='\\\" + objectId + \\\"' class='clickableOption mapObjectOption'>\\\" + eventTypeNice + \\\" \\\" + mapObjNameNice + \\\"</div>\\\");\\n\\t}\\n\\t//if the player is in editmode, add a remove option to the MapObject\\n\\tvar me = otherCharacterList[connectionNum];\\n\\tif(me.admin && me.editmode){\\n\\t\\tvar eventTypeNice = \\\"Remove\\\";\\n\\t\\tmenuArray.push(\\\"<div id='mapObjectOptionREMOVE' data-event='REMOVE' data-event-index='\\\" + -1 + \\\"' data-objectid='\\\" + objectId + \\\"' class='clickableOption mapObjectOption'>\\\" + eventTypeNice + \\\"</div>\\\");\\n\\t}\\n\\tfor(var i=0;i<menuArray.length;i++){\\n\\t\\tnewContextMenu.innerHTML += (menuArray[i]);\\n\\t}\\n\\tdocument.body.appendChild(newContextMenu);\\n\\t\\n\\t$(\\\".mapObjectOption\\\").mousedown(function(event){\\n\\t\\tvar eventType = $(this).attr(\\\"data-event\\\");\\n\\t\\tvar eventIndex = $(this).attr(\\\"data-event-index\\\");\\n\\t\\tvar objId = $(this).attr(\\\"data-objectid\\\");\\n\\t\\tvar mapObjEntity = mapObjectsEntityArray[objId];\\n\\t\\tinteractWithClickedObject(mapObjEntity, eventIndex);\\n\\t});\\n}\",\n \"function menuItem () {\\n\\tthis.id = 0;\\n\\tthis.startStop = 0;\\n\\tthis.endStop = 0;\\n\\tthis.center = {x:0,y:0};\\n\\tthis.icon = \\\"\\\";\\n\\tthis.text = \\\"\\\";\\n\\tthis.parent = null;\\n\\tthis.children = [];\\n}\",\n \"function createMenu() {\\n inquirer.prompt({\\n type: \\\"list\\\",\\n name: \\\"action\\\",\\n message: \\\"What would you like to add?\\\",\\n choices: [\\n { name: \\\"Add a department\\\", value: createDepartment },\\n { name: \\\"Add a role\\\", value: createRole },\\n { name: \\\"Add an employee\\\", value: createEmployee },\\n { name: \\\"Go back\\\", value: mainMenu }\\n ]\\n }).then(({ action }) => action());\\n}\",\n \"function modifyEventContextMenu() {\\n displayEventEditWindow();\\n}\",\n \"function createSubMenu(menu, commands) {\\n var keys = Object.keys(commands).sort();\\n for (var i = 0; i < keys.length; i++) {\\n var key = keys[i];\\n var command = commands[key];\\n var li = document.createElement('li');\\n li.innerHTML = key;\\n li.classList.add(\\\"menu-item\\\");\\n if (command.encoding) {\\n // command\\n li.id = command.encoding + \\\".\\\" + command.key;\\n li.onclick = function() { eval('scriptList.insert(\\\"' + this.id + '\\\")'); };\\n } else {\\n // category\\n var ul = document.createElement('ul');\\n ul.classList.add(\\\"menu-submenu\\\");\\n ul.classList.add(\\\"menu\\\");\\n createSubMenu(ul, command);\\n li.appendChild(ul);\\n }\\n menu.appendChild(li);\\n }\\n }\",\n \"onRightClick() {\\n // build menu template then tell TimerTray to display...\\n // pass in array w/ visible options\\n const menuConfig = Menu.buildFromTemplate([\\n { \\n label: 'Quit',\\n click: () => app.quit()\\n }\\n ]);\\n\\n // associate menu w/ tray icon...\\n // method available on base Tray class\\n this.popUpContextMenu(menuConfig)\\n }\",\n \"function menuItem(id, def) {\\n var client, dirty = true, icon, openMark, textElement, m = control(\\\"menu\\\", id, core.mkDefinition({\\n style: {\\n position: \\\"\\\",\\n padding: \\\"2px 9px 2px 9px\\\",\\n color: sys.color.windowtitle,\\n },\\n setText: function (text) {\\n if (!textElement)\\n this.appendChild(textElement = document.createTextNode(text));\\n else textElement.textContent = text;\\n },\\n setIcon: function (src) {\\n if (src) {\\n if (!icon) {\\n this.appendChild(icon = core.mkTag(\\\"img\\\"));\\n icon.style.merge({\\n width: \\\"16px\\\",\\n height: \\\"16px\\\",\\n float: \\\"left\\\",\\n padding: \\\"0 5px 0 0\\\",\\n filter: \\\"drop-shadow(rgb(255, 255, 255) 0px 0px 1px)\\\",\\n });\\n } else\\n icon.style.display = \\\"\\\";\\n icon.src = src;\\n } else if (icon) icon.style.display = \\\"none\\\";\\n },\\n showMoreMark: function () {\\n if (!openMark) {\\n this.appendChild(openMark = core.mkTag(\\\"div\\\"));\\n openMark.style.merge({\\n float: \\\"right\\\",\\n padding: \\\"0 0 0 5px\\\",\\n });\\n openMark.appendChild(document.createTextNode(\\\"\\\\u25B6\\\"));\\n } else openMark.style.display = \\\"\\\";\\n },\\n hideMoreMark: function () {\\n if (openMark)\\n openMark.style.display = \\\"none\\\";\\n },\\n popup: function () {\\n if (this.parentControl._type == \\\"menu\\\")\\n this.parentControl.popup();\\n if (client && client._visible)\\n return;\\n if (!client) {\\n client = control(\\\"menuClient\\\", id + \\\"_client\\\", {\\n style: {\\n background: sys.color.client,\\n border: \\\"1px solid \\\" + sys.color.frame,\\n fontFamily: \\\"Arial\\\",\\n fontSize: \\\"14px\\\",\\n zIndex: 9999,\\n },\\n _zLayer: 9,\\n });\\n core.getDesktop().appendChild(client);\\n }\\n var bounds = this.getBoundingClientRect();\\n if (this.parentControl._type == \\\"menu\\\")\\n client.merge({\\n top: bounds.top,\\n left: bounds.left + bounds.width,\\n });\\n else\\n client.merge({\\n top: bounds.top + bounds.height,\\n left: bounds.left,\\n });\\n while (client.lastChild)\\n client.removeChild(client.lastChild);\\n for (i in this.items) {\\n var m = this.items[i];\\n m.application = this.application;\\n m.parentControl = this;\\n if (m.items)\\n m.showMoreMark();\\n client.appendChild(m);\\n }\\n core.menu.setCurrent(this);\\n client.show();\\n },\\n close: function (all) {\\n if (client)\\n client.hide();\\n if (core.menu.isCurrent(this))\\n core.menu.setCurrent(null);\\n if (all && this.parentControl._type == \\\"menu\\\")\\n this.parentControl.close(all);\\n },\\n onmouseenter: function () {\\n this.style.backgroundColor = sys.color.frame;\\n this.style.color = sys.color.framecontrast;\\n },\\n onmouseleave: function () {\\n this.style.backgroundColor = \\\"\\\";\\n this.style.color = sys.color.windowtitle;\\n },\\n onclick: function () {\\n if (this.items)\\n core.menu.showMenu(this);\\n else if (this.onClick)\\n this.onClick.apply(this, arguments);\\n }\\n }, def));\\n return m;\\n }\",\n \"function createMenuItems() {\\n var menuArray = [];\\n // Create the menu entry for searching with all engines\\n if (preferences['showAll']) {\\n menuArray.push(contextMenu.Item({\\n label: 'All Engines',\\n data: '-all'\\n }));\\n menuArray.push(contextMenu.Separator());\\n }\\n engines.forEach(function (engine) {\\n if (preferences[engine.prefName]) {\\n menuArray.push(contextMenu.Item({\\n label: engine.name,\\n data: engine.url,\\n image: engine.icon\\n }));\\n }\\n });\\n return menuArray;\\n}\",\n \"function setupContextMenu() {\\n\\t//Add the context menu to chrome\\n\\tvar content = lh.getContent(\\\"background_script\\\");\\n\\tvar contextMenuTitle = lh.getContent(\\\"background_script\\\").context_menu_generate_random_password;\\n\\tchrome.contextMenus.create({\\n\\t\\ttitle: contextMenuTitle,\\n\\t\\ttype: \\\"normal\\\",\\n\\t\\tid: \\\"fpa_generate_random_password\\\",\\n\\t\\tcontexts: [\\\"editable\\\"]\\n\\t});\\n\\n\\t//Listen for context menu clicks\\n\\tchrome.contextMenus.onClicked.addListener(function (info, tab) {\\n\\t\\twriteLine(\\\"Context menu clicked\\\");\\n\\t\\twriteLine(info);\\n\\t\\tif (info.menuItemId !== \\\"fpa_generate_random_password\\\") return; //Check if our context menu is clicked\\n\\t\\tvar nh = new NetworkHandler();\\n\\t\\tnh.getRandomPassword().then(function (pass) { //Get random password\\n\\t\\t\\tchrome.tabs.sendMessage(tab.id, {\\\"cmd\\\": \\\"fpa_set_randomPassword\\\", \\\"success\\\": true, \\\"value\\\": pass}); //Send random password to content script\\n\\t\\t}, function (errorMessage) { //Server offline\\n\\t\\t\\twriteLine(\\\"Error occurred: \\\" + errorMessage);\\n\\t\\t\\tchrome.tabs.sendMessage(tab.id, {\\\"cmd\\\": \\\"fpa_set_randomPassword\\\", \\\"success\\\": false}) //Send error to content script\\n\\t\\t});\\n\\t\\t\\n\\t});\\n}\",\n \"_createMenuItem(sectionName, sectionTitle, active = false) {\\n const a = document.createElement('a');\\n a.setAttribute('href', '#');\\n a.setAttribute('data-section', sectionName);\\n\\n a.textContent = sectionTitle;\\n\\n const li = document.createElement('li');\\n if (active) {\\n li.classList.add('active');\\n }\\n li.appendChild(a);\\n\\n return li;\\n }\",\n \"function helpMenu() {\\n $scope.menuTitle = createText(\\\"Help\\\", [20, 10]);\\n createText(\\\"Sorry you can't count on anyone's help for now\\\", [50, 80], {font: 'bold 20px Arial'});\\n }\",\n \"function createItemNode(item) {\\n var node = document.createElement('div');\\n var icon = document.createElement('span');\\n var text = document.createElement('span');\\n var shortcut = document.createElement('span');\\n var submenu = document.createElement('span');\\n node.className = createItemClassName(item);\\n icon.className = exports.ICON_CLASS;\\n text.className = exports.TEXT_CLASS;\\n shortcut.className = exports.SHORTCUT_CLASS;\\n submenu.className = exports.SUBMENU_ICON_CLASS;\\n if (!item.isSeparatorType) {\\n text.textContent = item.text.replace(/&/g, '');\\n shortcut.textContent = item.shortcut;\\n }\\n node.appendChild(icon);\\n node.appendChild(text);\\n node.appendChild(shortcut);\\n node.appendChild(submenu);\\n return node;\\n}\",\n \"function createMenuItem(name, price, category) {\\n\\treturn {name, price, category};\\n}\",\n \"function context_menu(params,event) {\\n\\tel=document.getElementById(\\\"cm\\\");\\n\\to=event.srcElement;\\n\\tx=event.clientX+document.documentElement.scrollLeft+document.body.scrollLeft;\\n\\ty=event.clientY+document.documentElement.scrollTop+document.body.scrollTop;\\n\\tel.innerHTML='';\\n\\tfor (k in params) {\\n\\t//if params[k]=='space' then draw line (separator)\\n\\t\\tif (params[k]=='space') { el.innerHTML+='<hr size=1>';\\n\\t//if menu item is disabled\\n\\t\\t} else if (params[k][\\\"disabled\\\"]) { el.innerHTML+='<a class=\\\"cm_gray\\\" href=\\\"\\\" onclick=\\\"return false;\\\" title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";\\n\\t//if current window is not opened in frame\\n\\t\\t} else if (params[k][\\\"frame\\\"]==\\\"off\\\") { if (window.frameElement==\\\"[object HTMLFrameElement]\\\") { el.innerHTML+='<a class=\\\"cm_black\\\" href=\\\"\\\"'+\\\"onclick=\\\"+'window.open('+\\\"'\\\"+params[k][\\\"href\\\"]+\\\"','','statusbar,menubar,location'); return false;\\\"+'\\\" title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";} else { el.innerHTML+='<a class=\\\"cm_black\\\" href=\\\"\\\"'+\\\"onclick=\\\"+'window.open('+\\\"'\\\"+params[k][\\\"href\\\"]+\\\"','','statusbar,menubar,location');return false;\\\"+'\\\" title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";}\\n\\t//if current window must be opened in frame\\n\\t\\t} else if (params[k][\\\"frame\\\"]==\\\"on\\\") { el.innerHTML+='<a class=\\\"cm_black\\\" href=\\\"\\\"'+'onclick='+\\\"parent\\\"+params[k][\\\"taget\\\"]+\\\".location.href='\\\"+params[k][\\\"href\\\"]+\\\"' return false;\\\"+' title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";}\\n\\t}\\n\\tel.style.visibility=\\\"visible\\\";\\n\\tel.style.display=\\\"block\\\";\\n\\theight=el.scrollHeight-20;\\n\\tif (window.opera) height+=30;//stupid opera...\\n\\tif (event.clientY+height>document.body.clientHeight) { y-=height+14 } else { y-=2 }\\n\\tel.style.left=x+\\\"px\\\";\\n\\tel.style.top=y+\\\"px\\\";\\n\\tel.style.visibility=\\\"hidden\\\";\\n\\tel.style.display=\\\"none\\\";\\n\\tel.style.visibility=\\\"visible\\\";\\n\\tel.style.display=\\\"block\\\";\\n\\tevent.returnValue=false;\\n}\",\n \"function stupidWorkaroundToCreateContextMenus() {\\n var CONTEXT_ID = 'image-properties';\\n\\n chrome.contextMenus.removeAll();\\n chrome.contextMenus.create({\\n id: CONTEXT_ID,\\n title: chrome.i18n.getMessage('ctx_image_properties'),\\n contexts: ['image']\\n });\\n}\",\n \"function postFillIdContextMenu(data, textStatus, jqXHR, param) {\\n\\tvar ul = param.ul;\\n\\tvar subject = data[0];\\n\\tvar results = subject2identifiers(subject);\\n\\tvar dtype = results['dtype'];\\n\\tif (dtype == 'template' && view_URL) {\\n\\t\\tvar li = $('<li>');\\n\\t\\tul.append(li);\\n\\t\\tvar a = $('<a>');\\n\\t\\tli.append(a);\\n\\t\\ta.attr({\\ttarget: '_newtab2' + ++WINDOW_TAB,\\n\\t\\t\\t\\t\\thref: HOME + '/file/' + results['datapred'] });\\n\\t\\ta.html('View ' + results['dataname']);\\n\\t} else if (dtype == 'url' && view_URL) {\\n\\t\\tvar li = $('<li>');\\n\\t\\tul.append(li);\\n\\t\\tvar a = $('<a>');\\n\\t\\tli.append(a);\\n\\t\\ta.attr({\\ttarget: '_newtab2' + ++WINDOW_TAB,\\n\\t\\t\\t\\t\\thref: subject['url'] });\\n\\t\\ta.html('View ' + results['dataname']);\\n\\t} else if (dtype == 'file' && file_download) {\\n\\t\\tvar li = $('<li>');\\n\\t\\tul.append(li);\\n\\t\\tvar a = $('<a>');\\n\\t\\tli.append(a);\\n\\t\\ta.attr({\\ttarget: '_newtab2' + ++WINDOW_TAB,\\n\\t\\t\\t\\t\\thref: HOME + '/file/' + results['datapred'] });\\n\\t\\ta.html('Download ' + results['dataname']);\\n\\t}\\n\\tif (view_tags) {\\n\\t\\tvar li = $('<li>');\\n\\t\\tul.append(li);\\n\\t\\tvar a = $('<a>');\\n\\t\\tli.append(a);\\n\\t\\ta.attr({href: 'javascript:getTagDefinition(\\\"'+ encodeSafeURIComponent(results['datapred']) + '\\\",\\\"default\\\")' });\\n\\t\\ta.html('View tags page');\\n\\t}\\n\\tif (ul.children().length == 0) {\\n\\t\\tvar li = $('<li>');\\n\\t\\tul.append(li);\\n\\t\\tli.html('No available actions');\\n\\t}\\n}\",\n \"function showContextMenu(evt) {\\n\\t\\t// If context menu element not exist - create it\\n\\t\\tif (!context_menu_element) {\\n\\t\\t\\tinitContextMenu();\\n\\t\\t}\\n\\n\\t\\thideTooltips();\\n\\t\\t// Clear context menu\\n\\t\\tcontext_menu_element.innerHTML = '';\\n\\n\\t\\t// Determine the type of element on context\\n\\t\\tcontext_element = getElProp(evt);\\n\\t\\tif (context_element.type == 2) {\\n\\t\\t\\thighlightFileItem(context_element.index);\\n\\t\\t}\\n\\t\\tbildContextMenu();\\n\\t\\t// Show context menu with time out\\n\\t\\t//setTimeout(function() {\\n\\t\\tcontext_menu_element.style.display = 'block';\\n\\t\\tfixMouseEventElementPosition(evt, context_menu_element, 0);\\n\\t\\t//\\t}, 20);\\n\\t\\tcontext_menu_element.style.display = 'block';\\n\\t\\tcancelEvent(evt);\\n\\t}\",\n \"function menuCreate(menu) {\\n if (typeof menu !== \\\"undefined\\\") {\\n elements[menu.id] = new Menu()\\n for(let i = 0; i < menu.items.length; i++) {\\n elements[menu.id].append(menuItemCreate(menu.items[i]))\\n }\\n return elements[menu.id]\\n }\\n return null\\n}\",\n \"function createMainMenuButton() {\\n var menuButton = createElement(\\\"button\\\", \\\"Main Menu\\\", \\\"\\\", \\\"btnCustom\\\");\\n menuButton.classList.add('btnGreen');\\n menuButton.onclick = mainMenuClick;\\n return menuButton;\\n}\",\n \"_setContextMenu() {\\n this.dom.contextMenu.config = new PopContextMenuConfig();\\n this.dom.setSubscriber('context-menu', this.dom.contextMenu.config.emitter.subscribe((event) => {\\n this.log.event(`context-menu`, event);\\n this.events.emit(event);\\n }));\\n }\",\n \"function createItem(checkBox, tag, index, identifier, term) {\\n return $(\\\"<li>\\\").text(tag).addClass(\\\"dd-options\\\").append(checkBox)\\n .data(\\\"event\\\", iterateCourse(index, identifier, term));\\n }\",\n \"function creatMenuItem(element) {\\n let section = element.getAttribute('data-nav');\\n let menuItem = document.createElement('li');\\n menuItem.classList.add('menu__link');\\n menuItem.innerHTML = `<a>${section}</a>`;\\n navigationMenu.appendChild(menuItem);\\n}\",\n \"function makeButton(){\\r\\n\\t// Sperate the menu\\r\\n\\tuserbar.innerHTML += ' | ';\\r\\n\\t//Btn part\\r\\n\\tbtn = document.createElement('a');\\r\\n\\tbtn.setAttribute('href','#');\\r\\n\\tbtn.setAttribute('id','liveTopics');\\r\\n\\tbtn.innerHTML = BTN_STRINGS[mode];\\r\\n\\tuserbar.appendChild(btn);\\r\\n\\tbtn.addEventListener('click',toggleLT,false);\\r\\n}\",\n \"function onOpen() { CUSTOM_MENU.add(); }\",\n \"static newItem(id, txt) {\\n return `<li id='${id}'><button class=\\\"w3-btn w3-bar w3-red\\\" type=button\\\">${txt} <b>×</b></button></li>`;\\n }\",\n \"function MenuItem(title, image) {\\n // Build the DOM.\\n this._container = document.createElement('div');\\n this._container.className = 'fab-menu-item';\\n this._launch = document.createElement('div');\\n this._launch.className = 'fab-launch';\\n this._container.appendChild(this._launch);\\n this._label = document.createElement('div');\\n this._label.className = 'fab-label';\\n this._label.innerText = title;\\n this._container.appendChild(this._label);\\n this._icon = document.createElement('div');\\n this._icon.className = 'fab-icon';\\n if (image) {\\n this._icon.style.backgroundImage = 'url(' + image + ')';\\n this._icon.style.backgroundColor = 'transparent';\\n }\\n this._container.appendChild(this._icon);\\n // We need a spring to tell us how far away we should be from the cursor.\\n this._spring = new Gravitas.Spring(1, 400, overdamp ? 45 : 30); // 400 / 30 is slightly underdamped, so there will be a slight overbounce.\\n}\",\n \"actAsMenu_() {\\n return this;\\n }\",\n \"function buildMenuFromTemplate() {\\n const menuTemplate = [\\n {\\n label: \\\"View\\\",\\n submenu: [\\n { role: \\\"reload\\\" },\\n { role: \\\"forcereload\\\" },\\n { role: \\\"toggledevtools\\\" },\\n { type: \\\"separator\\\" },\\n { role: \\\"togglefullscreen\\\" },\\n ],\\n },\\n {\\n label: \\\"Kryss\\\",\\n submenu: [\\n {\\n id: \\\"cancel\\\",\\n label: \\\"Cancel kryss\\\",\\n accelerator: \\\"Escape\\\",\\n enabled: false,\\n click: () => {\\n win.webContents.send(\\\"cancel\\\");\\n },\\n },\\n { type: \\\"separator\\\" },\\n {\\n id: \\\"kryss\\\",\\n label: \\\"Confirm kryss\\\",\\n accelerator: \\\"x\\\",\\n enabled: false,\\n click: () => {\\n win.webContents.send(\\\"kryss\\\");\\n },\\n },\\n ],\\n },\\n {\\n role: \\\"window\\\",\\n submenu: [{ role: \\\"minimize\\\" }, { role: \\\"close\\\" }],\\n },\\n {\\n role: \\\"help\\\",\\n submenu: [\\n {\\n label: \\\"Don't click me\\\",\\n click: () => {\\n retrofitTurboAccelerators();\\n },\\n },\\n ],\\n },\\n ];\\n\\n if (process.platform === \\\"darwin\\\") {\\n menuTemplate.unshift({\\n label: app.getName(),\\n submenu: [\\n { role: \\\"about\\\" },\\n { type: \\\"separator\\\" },\\n { role: \\\"hide\\\" },\\n { role: \\\"hideothers\\\" },\\n { role: \\\"unhide\\\" },\\n { type: \\\"separator\\\" },\\n { role: \\\"quit\\\" },\\n ],\\n });\\n\\n // Window menu\\n menuTemplate[3].submenu = [\\n { role: \\\"close\\\" },\\n { role: \\\"minimize\\\" },\\n { role: \\\"zoom\\\" },\\n { type: \\\"separator\\\" },\\n { role: \\\"front\\\" },\\n ];\\n }\\n\\n return Menu.buildFromTemplate(menuTemplate);\\n}\",\n \"function setMenu() {\\n //添加快捷键\\n\\tlet applicationOptions = [\\n\\t\\t{ label: \\\"About Kungfu\\\", click: showKungfuInfo},\\n\\t\\t{ label: \\\"Settings\\\", accelerator: \\\"CmdOrCtrl+,\\\", click: openSettingDialog },\\n\\t\\t{ label: \\\"Close\\\", accelerator: \\\"CmdOrCtrl+W\\\", click: function() { console.log(BrowserWindow.getFocusedWindow().close()); }}\\n\\t]\\n\\n\\tif(platform === 'mac') {\\n\\t\\tapplicationOptions.push(\\n\\t\\t\\t{ label: \\\"Quit\\\", accelerator: \\\"Command+Q\\\", click: function() { app.quit(); }},\\n\\t\\t)\\n\\t}\\n\\n\\tconst template = [\\n\\t{\\n\\t\\tlabel: \\\"Kungfu\\\",\\n\\t\\tsubmenu: applicationOptions\\n\\t}, \\n\\t{\\n\\t\\tlabel: \\\"Edit\\\",\\n\\t\\tsubmenu: [\\n\\t\\t\\t{ label: \\\"Copy\\\", accelerator: \\\"CmdOrCtrl+C\\\", selector: \\\"copy:\\\" },\\n\\t\\t\\t{ label: \\\"Paste\\\", accelerator: \\\"CmdOrCtrl+V\\\", selector: \\\"paste:\\\" },\\n\\t\\t]\\n\\t}];\\n\\t\\n\\tMenu.setApplicationMenu(Menu.buildFromTemplate(template))\\n}\",\n \"function create_menu()\\n{\\n location.href='./Create-Item';\\n}\",\n \"function appendComponentToCxtMenu(component) {\\n $cxtMenu.append(component);\\n bindMenuItemClickFunction(component);\\n }\",\n \"function MenuItem_MenuItem(theMenuData, theParent)\\n{\\n\\tthis.MenuData = theMenuData; \\t\\t//our menudata\\n\\tthis.Parent = theParent; \\t\\t\\t//the parent menu item\\n\\tthis.SubMenus = new Array(); \\t\\t//array of submenus\\n\\tthis.Text = \\\"\\\"; \\t\\t\\t\\t\\t//the text of the menu\\n\\tthis.ShortCut = \\\"\\\"; \\t\\t\\t\\t//its shortcut\\n\\tthis.Exception = new Array(); \\t//the exception for the action\\n\\tthis.State = __MENU_NODE_SEPARATOR; //default state: separator\\n\\tthis.LeftImageIndex = -1; \\t\\t\\t//the index of the left image (-1 for none)\\n\\tthis.RightImageIndex = -1; \\t\\t\\t//the index of the right image (-1 for none)\\n\\tthis.BackgroundColor = null; \\t\\t//The background color (null to use default)\\n\\tthis.ForegroundColor = null; \\t\\t//The foreground color (null to use default)\\n\\tthis.PopupMenu = null; \\t\\t\\t\\t//our popup menu\\n\\tthis.MenuBarHTML = null; \\t\\t\\t//Our menubar item\\n\\tthis.MenuPopupHTML = null; \\t\\t\\t//Our popup menu item\\n\\tthis.ChildImageHTML = null; \\t\\t//Our child Image\\n\\tthis.ShortCutMaps = {};\\t\\t\\t\\t//our children's shortcuts\\n\\t//has parent?\\n\\tif (this.Parent)\\n\\t{\\n\\t\\t//add ourselves to the parent's submenu array\\n\\t\\tthis.Parent.SubMenus.push(this);\\n\\t}\\n\\n}\",\n \"function AddMenuOption(win, menu, value, html) {\\n var op = AppendNewElement(win, menu, 'OPTION');\\n op.value = value;\\n op.innerHTML = html;\\n\\n return op;\\n}\",\n \"function loadPagesAddNewContextMenu() {\\n try {\\n $.contextMenu({\\n selector: '.pages-main-panel .pages-main-table-panel .pages-main-table-properties .btn-add-new-page',\\n trigger: 'left',\\n callback: function(key, options) { \\n switch(key) {\\n case \\\"page\\\" : \\n trackPageDetailOverwrite(() => {\\n setParamPageId();\\n setActiveSidebar('PAGE');\\n },'#dialog-page-editor-confirm');\\n break;\\n case \\\"process\\\" : \\n // \\n break;\\n case \\\"space\\\" : \\n // \\n break;\\n default : \\n // \\n break;\\n }\\n },\\n items: {\\n \\\"page\\\": {\\n name: \\\"Page\\\",\\n icon: 'menu-page',\\n disabled: function(key, opt) { \\n if(!hasWriteAccess()){\\n return true;\\n }\\n return false;\\n }\\n },\\n \\\"process\\\": {\\n name: \\\"Process\\\",\\n icon: 'menu-process',\\n disabled: function(key, opt) {\\n if(!hasWriteAccess()){\\n return true;\\n }\\n return false;\\n }\\n },\\n \\\"space\\\": {\\n name: \\\"Space\\\",\\n icon: 'menu-space',\\n disabled: function(key, opt) {\\n if(!hasWriteAccess()){\\n return true;\\n }\\n return false;\\n }\\n }\\n }\\n });\\n } catch (error) {\\n displayLibraryCatchError('context-menu');\\n return false;\\n }\\n}\",\n \"function creatNavMenu() {\\n\\n const menuItemToCreate = 'li';\\n const menuItemClassName = 'menu__link';\\n\\n for (let currentItem of navMenuItems) {\\n let currentNavMenuItem = document.createElement(menuItemToCreate);\\n //using html data set property to manipulate DomStringMap\\n currentNavMenuItem.className = menuItemClassName;\\n currentNavMenuItem.dataset.nav = currentItem.id;\\n currentNavMenuItem.innerText = currentItem.dataset.nav;\\n navMenu.appendChild(currentNavMenuItem);\\n\\n };\\n}\",\n \"function createMenu(content, link, status) {\\n const menuElement = document.createElement(\\\"li\\\");\\n const menuLink = document.createElement(\\\"a\\\");\\n menuLink.href = \\\"#\\\";\\n menuLink.setAttribute(\\\"data-link\\\",link)\\n menuLink.setAttribute(\\\"data-status\\\", status)\\n menuLink.className += \\\"menu-link\\\";\\n menuLink.textContent = content;\\n menuElement.appendChild(menuLink);\\n return menuElement;\\n }\",\n \"function contextMenuOn() {\\n if (statusMenu) build_menu.style.display = \\\"block\\\";\\n else {\\n document.getElementById(settings.element).appendChild(build_menu);\\n statusMenu = true;\\n }\\n }\",\n \"function drawContextMenu(svg, x, y, containerWidth, containerHeight, menuItems, clickCallback) {\\n\\tvar menuItemHeight = 25;\\n\\tvar menuItemWidth = 210;\\n\\t//Remove the current menu if we open it in other place\\t\\n\\td3.select('.context-menu').remove();\\n\\t// Draw the menu\\n\\tsvg.append('g').attr('class', 'context-menu')\\n\\t\\t.selectAll('tmp')\\n\\t\\t.data(menuItems).enter()\\n\\t\\t.append('g')\\n\\t\\t.attr('class', 'menu-entry')\\n\\t\\t.on(\\\"click\\\", clickCallback);\\n\\n\\t//See if the menu isn't cropped in the container\\n\\tif (x + menuItemWidth > containerWidth) {\\n\\t\\tx = x - menuItemWidth;\\n\\t}\\n\\tif (y + (menuItems.length * menuItemHeight) > containerHeight) {\\n\\t\\ty = y - (menuItems.length * menuItemHeight);\\n\\t}\\n\\n\\t//Draw the context menu\\n\\td3.selectAll('.menu-entry')\\n\\t\\t.append('rect')\\n\\t\\t.attr('x', x)\\n\\t\\t.attr('y', function(d, i) {\\n\\t\\t\\treturn y + (i * menuItemHeight);\\n\\t\\t})\\n\\t\\t.attr('width', menuItemWidth)\\n\\t\\t.attr('height', menuItemHeight);\\n\\n\\td3.selectAll(\\\".menu-entry\\\")\\n\\t\\t.append(\\\"text\\\")\\n\\t\\t.text(function(d) {\\n\\t\\t\\treturn d;\\n\\t\\t})\\n\\t\\t.attr(\\\"class\\\", \\\"menu-entry text\\\")\\n\\t\\t.attr(\\\"x\\\", x)\\n\\t\\t.attr(\\\"y\\\", function(d, i) {\\n\\t\\t\\treturn y + (i * menuItemHeight);\\n\\t\\t})\\n\\t\\t.attr(\\\"dy\\\", menuItemHeight - 5 / 2)\\n\\t\\t.attr(\\\"dx\\\", 5);\\n\\n\\t// Other interactions remove the menu ex:Clicking elsewhere!!\\n\\td3.select(\\\"body\\\")\\n\\t\\t.on(\\\"click\\\", function() {\\n\\t\\t\\td3.select(\\\".context-menu\\\").remove();\\n\\t\\t});\\n}\",\n \"function getContextMenuId()\\n{\\n\\treturn \\\"DWConnectionsContext\\\";\\n}\",\n \"function lightMenuItem(parent_id, name, font_size, position_x, position_y, action = null) {\\n this.parent_id = parent_id;\\n this.name = name;\\n this.action = action;\\n\\n // position_x and position_y correlate to coordinates over the canvas\\n this.position_x = position_x;\\n this.position_y = position_y;\\n\\n // availability determines whether the item is interactive\\n if (!action) {\\n this.interactive = false;\\n } else {\\n this.interactive = true;\\n }\\n\\n this.div = document.createElement('div');\\n this.div.id = name;\\n this.div.className = 'light_menu_item';\\n this.div.style.fontSize = font_size;\\n this.div.innerHTML = name;\\n this.div.style.opacity = 0;\\n\\n var adjusted_position_x = this.position_x - 40;\\n var adjusted_position_y = this.position_y - 40;\\n this.div.style.left = adjusted_position_x + \\\"px\\\";\\n this.div.style.top = adjusted_position_y + \\\"px\\\";\\n\\n if (this.interactive) {\\n this.div.style.color = \\\"#FFFFFF\\\";\\n console.log(\\\"test-01\\\");\\n $(this.div).hover(function() {\\n $(this).toggleClass(\\\"menu_item_selected\\\");\\n },\\n function() {\\n $(this).toggleClass(\\\"menu_item_selected\\\");\\n });\\n var action = this.action;\\n console.log(\\\"parent_id\\\");\\n $(this.div).click(() => {\\n action(this.parent_id);\\n });\\n } else {\\n this.div.style.color = \\\"#777777\\\";\\n }\\n}\",\n \"function createMenu() {\\n var ui = SpreadsheetApp.getUi();\\n\\n ui.createMenu('Tools')\\n .addItem('Fix Range Error', 'fixMe')\\n .addSeparator()\\n .addItem('About', 'about')\\n .addToUi();\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.71566486","0.7150466","0.7148318","0.71336246","0.7126788","0.7009224","0.6952768","0.6941859","0.6928714","0.69089675","0.6906397","0.68632203","0.6828996","0.6810401","0.6771755","0.6626699","0.6550772","0.65260047","0.65224373","0.64886695","0.6441974","0.64086545","0.6400739","0.6399102","0.63752866","0.63752866","0.6349674","0.633229","0.6305307","0.62775564","0.6267765","0.62477285","0.62367165","0.62350184","0.6233827","0.6227241","0.6216105","0.62138283","0.62087363","0.6196312","0.6188102","0.61722946","0.6172294","0.61709195","0.6169491","0.6169491","0.6134071","0.6098523","0.60983825","0.6094422","0.60780865","0.6074604","0.6063054","0.605827","0.60567784","0.60547113","0.60447603","0.60445267","0.6041943","0.6039158","0.6009393","0.5996489","0.597225","0.5971165","0.5959739","0.59592265","0.59151286","0.5907645","0.5894989","0.58931136","0.58890647","0.58846414","0.5874166","0.5858519","0.5837158","0.58269984","0.5823646","0.5821989","0.5821411","0.58193","0.58117163","0.580561","0.5801581","0.5800586","0.5798386","0.57877475","0.57858926","0.5767506","0.57607996","0.5749663","0.57485026","0.5740961","0.57325786","0.5727846","0.5722724","0.5716963","0.5712393","0.57083356","0.5704773","0.5703816"],"string":"[\n \"0.71566486\",\n \"0.7150466\",\n \"0.7148318\",\n \"0.71336246\",\n \"0.7126788\",\n \"0.7009224\",\n \"0.6952768\",\n \"0.6941859\",\n \"0.6928714\",\n \"0.69089675\",\n \"0.6906397\",\n \"0.68632203\",\n \"0.6828996\",\n \"0.6810401\",\n \"0.6771755\",\n \"0.6626699\",\n \"0.6550772\",\n \"0.65260047\",\n \"0.65224373\",\n \"0.64886695\",\n \"0.6441974\",\n \"0.64086545\",\n \"0.6400739\",\n \"0.6399102\",\n \"0.63752866\",\n \"0.63752866\",\n \"0.6349674\",\n \"0.633229\",\n \"0.6305307\",\n \"0.62775564\",\n \"0.6267765\",\n \"0.62477285\",\n \"0.62367165\",\n \"0.62350184\",\n \"0.6233827\",\n \"0.6227241\",\n \"0.6216105\",\n \"0.62138283\",\n \"0.62087363\",\n \"0.6196312\",\n \"0.6188102\",\n \"0.61722946\",\n \"0.6172294\",\n \"0.61709195\",\n \"0.6169491\",\n \"0.6169491\",\n \"0.6134071\",\n \"0.6098523\",\n \"0.60983825\",\n \"0.6094422\",\n \"0.60780865\",\n \"0.6074604\",\n \"0.6063054\",\n \"0.605827\",\n \"0.60567784\",\n \"0.60547113\",\n \"0.60447603\",\n \"0.60445267\",\n \"0.6041943\",\n \"0.6039158\",\n \"0.6009393\",\n \"0.5996489\",\n \"0.597225\",\n \"0.5971165\",\n \"0.5959739\",\n \"0.59592265\",\n \"0.59151286\",\n \"0.5907645\",\n \"0.5894989\",\n \"0.58931136\",\n \"0.58890647\",\n \"0.58846414\",\n \"0.5874166\",\n \"0.5858519\",\n \"0.5837158\",\n \"0.58269984\",\n \"0.5823646\",\n \"0.5821989\",\n \"0.5821411\",\n \"0.58193\",\n \"0.58117163\",\n \"0.580561\",\n \"0.5801581\",\n \"0.5800586\",\n \"0.5798386\",\n \"0.57877475\",\n \"0.57858926\",\n \"0.5767506\",\n \"0.57607996\",\n \"0.5749663\",\n \"0.57485026\",\n \"0.5740961\",\n \"0.57325786\",\n \"0.5727846\",\n \"0.5722724\",\n \"0.5716963\",\n \"0.5712393\",\n \"0.57083356\",\n \"0.5704773\",\n \"0.5703816\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7236928"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":4670,"cells":{"query":{"kind":"string","value":"Update context menu for tab"},"document":{"kind":"string","value":"function updateTabContextMenu(tab) {\n // Isn't supported by Android WebExt\n if (!adguard.contextMenus) {\n return;\n }\n adguard.contextMenus.removeAll();\n if (adguard.settings.showContextMenu()) {\n if (adguard.prefs.mobile) {\n customizeMobileContextMenu(tab);\n } else {\n customizeContextMenu(tab);\n }\n if (typeof adguard.contextMenus.render === 'function') {\n // In some case we need to manually render context menu\n adguard.contextMenus.render();\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 useContextMenu(tab) {\n if (addOnPrefs.useContextMenu) {\n var url = tab.url;\n var tabId = tab.id;\n destroyPreviousContextMenu(tabId);\n var datawakeInfo = storage.getDatawakeInfo(tabId);\n contextMenus[tabId] = contextMenu.Menu({\n label: \"Datawake Menu: \" + datawakeInfo.domain.name,\n contentScriptFile: data.url(\"js/datawake/selections.js\"),\n context: contextMenu.URLContext(url),\n items: [\n contextMenu.Item({ label: \"Capture Selection\", data: \"selection\", context: contextMenu.SelectionContext()}),\n contextMenu.Item({ label: \"Tag a feature\", data: \"feedback\", context: contextMenu.SelectionContext()}),\n contextMenu.Separator(),\n contextMenu.Item({ label: \"Hide Selections\", data: \"hide\"}),\n contextMenu.Item({ label: \"Show Selections\", data: \"highlight\"}),\n\n\n ],\n onMessage: function (message) {\n var tabId = tabs.activeTab.id;\n var datawakeInfo = storage.getDatawakeInfo(tabId);\n switch (message.intent) {\n case \"highlight\":\n highlightAllTextOnPage(tabId, datawakeInfo);\n break;\n case \"selection\":\n saveWindowSelection(datawakeInfo, tabs.activeTab.url, message.text);\n break;\n case \"feedback\":\n saveFeedback(message.text, tabs.activeTab.url, datawakeInfo);\n break;\n case \"hide\":\n hideSelections(\"selections\");\n break;\n case \"geolocate\":\n geolocateWindowSelection(message.text);\n break;\n }\n }\n });\n }\n}","function modifyEventContextMenu() {\n displayEventEditWindow();\n}","function handleContextMenu(info, tab) {\n //store selected text\n selectedText = info.selectionText;\n //open new tab to create issue \n openMainPage(\"/new_issue\");\n}","function tabContextMenuonClick(info, tab) {\n var query = {\n currentWindow: true\n };\n chrome.tabs.query(query, function (tabs) {\n var tabsData = Array();\n for (tab in tabs) {\n tab = parseInt(tab);\n if (typeof tab === \"number\") {\n var url = tabs[tab]['url'];\n var title = tabs[tab]['title'];\n if (url.startsWith('http')) {\n var tabData = {'url': url, 'title': title};\n tabsData.push(tabData);\n }\n else {\n\n }\n }\n }\n chrome.storage.sync.get([\"useremail\", \"userkey\"], function (items) {\n if (typeof items.useremail !== 'undefined') {\n require(['/libs/superagent.min.js'], function (request) {\n request\n .post(baseUrl + \"tabs/add\")\n .send({\n email: encodeURIComponent(items.useremail),\n apikey: encodeURIComponent(items.userkey),\n tabs: encodeURIComponent(JSON.stringify(tabsData))\n })\n .end(function (err, res) {\n if (err === null) {\n chrome.tabs.create({url: 'http://localhost:5000/manager/tabs/new?id=' + res.body.id});\n }\n });\n });\n }\n });\n });\n}","function onClickedContextMenuHandler (info, tab) {\n let bnId = info.bookmarkId;\n//console.log(\"menu item clicked on <\"+bnId+\"> with contexts=\"+info.contexts+\" menuIds=\"+info.menuIds+\" menuItemId=\"+info.menuItemId+\" pageUrl=\"+info.pageUrl+\" targetElementId=\"+info.targetElementId+\" viewType=\"+info.viewType+\" tab=\"+tab);\n if (myMenu_open // This sidebar instance is the one which opened the context menu\n\t && ((info.viewType == \"sidebar\") || (info.viewType == \"tab\")) // Context menu inside of sidebar or insde BSP2 in a tab\n\t && (bnId != undefined) && (bnId.length > 0)\n\t ) {\n\t// Retrieve the clicked menu action\n\tlet menuItemId = info.menuItemId;\n\tlet pos = menuItemId.indexOf(\"-\");\n\tlet menuAction = menuItemId.substring(0, pos);\n\tswitch (menuAction) {\n\t case \"bsp2show\":\n\t\t// Show bookmark item in main pane\n\t\tmenuShow(bnId);\n\t\tbreak;\n\t case \"bsp2open\":\n\t\t// Open in tab\n\t\tmenuOpen(curRowList[bnId], INTAB);\n\t\tbreak;\n\t case \"bsp2opentab\":\n\t\t// Open in new tab\n\t\tmenuOpen(curRowList[bnId], NEWTAB);\n\t\tbreak;\n\t case \"bsp2openwin\":\n\t\t// Open in new window\n\t\tmenuOpen(curRowList[bnId], NEWWIN);\n\t\tbreak;\n\t case \"bsp2openpriv\":\n\t\t// Open in private window\n\t\tmenuOpen(curRowList[bnId], NEWPRIVWIN);\n\t\tbreak;\n\t case \"bsp2openall\":\n\t\t// Open all bookmarks in folder\n\t let is_shiftKey = (info.modifiers.indexOf(\"Shift\") != -1);\n\t\tmenuOpenAllInTabs(bnId, is_shiftKey);\n\t\tbreak;\n\t case \"bsp2opentree\":\n\t\t// Open parent folder of the .reshidden row\n\t\topenResParents(curRowList[bnId]);\n\t\tbreak;\n\t case \"bsp2goparent\":\n\t\t// Show parent of the row\n\t\tgoParent(curRowList[bnId]);\n\t\tbreak;\n\t case \"bsp2newbtab\":\n\t\t// Bookmark current tab here\n\t\tmenuNewBkmkItem(bnId, NEWBCURTAB, (info.modifiers.indexOf(\"Ctrl\") >= 0));\n\t\tbreak;\n\t case \"bsp2newb\":\n\t\t// New bookmark\n\t\tmenuNewBkmkItem(bnId, NEWB);\n\t\tbreak;\n\t case \"bsp2newf\":\n\t\t// New folder\n\t\tmenuNewBkmkItem(bnId, NEWF);\n\t\tbreak;\n\t case \"bsp2news\":\n\t\t// New separator\n\t\tmenuNewBkmkItem(bnId, NEWS);\n\t\tbreak;\n\t case \"bsp2cut\":\n\t\t// Cut selection to clipboard\n\t\tif (isResultMenu) { // A results table menu\n\t\t menuCutBkmkItem(rselection);\n\t\t}\n\t\telse {\n\t\t menuCutBkmkItem(selection);\n\t\t}\n\t\tbreak;\n\t case \"bsp2copy\":\n\t\t// Copy selection to clipboard\n\t\tif (isResultMenu) { // A results table menu\n\t\t menuCopyBkmkItem(rselection);\n\t\t}\n\t\telse {\n\t\t menuCopyBkmkItem(selection);\n\t\t}\n\t\tbreak;\n\t case \"bsp2paste\":\n\t\t// Paste clipboard before current bookmark\n\t\tmenuPasteBkmkItem(bnId, false);\n\t\tbreak;\n\t case \"bsp2pasteinto\":\n\t\t// Paste clipboard into current folder\n\t\tmenuPasteBkmkItem(bnId, true);\n\t\tbreak;\n\t case \"bsp2del\":\n\t\t// Delete selected bookmark item(s)\n\t\tmenuDelBkmkItem(selection);\n\t\tbreak;\n\t case \"bsp2sort\":\n\t\t// Sort folder content\n\t\tsendAddonMessage(\"sort:\"+bnId);\n\t\tbreak;\n\t case \"bsp2refreshfav\":\n\t\t// Refresh favicon\n\t\tmenuRefreshFav(bnId);\n\t\tbreak;\n\t case \"bsp2collapseall\":\n\t\t// Close folder and all subfolders\n\t\tcollapseAll(bnId, curRowList[bnId]);\n\t\tbreak;\n\t case \"bsp2expandall\":\n\t\t// Open folder and all subfolders\n\t\texpandAll(bnId, curRowList[bnId]);\n\t\tbreak;\n\t case \"bsp2prop\":\n\t\t// Show properties\n\t\tmenuProp(bnId);\n\t\tbreak;\n\t}\n }\n}","function ContextMenuAction(info, tab){\n\n //We loop through all existing tags. For each one, check if this link has it or not, and show/hide the tick accordingly\n for (i=0; i<existingTags.length; i++){\n \n ctxtmenuID = (\"id-\" + existingTags[i]); //e.g. \"id-seen\" is the id of the context menu that toggles tag \"seen\"\n \n if (info.menuItemId === ctxtmenuID) { //Was this the clicked context menu item?\n\n //Get url of right-clicked item\n if (info.linkUrl) url = info.linkUrl; //Context menu opened on a link\n else if (info.pageUrl) url = info.pageUrl; //Context menu opened on current page (anywhere on its background)\n else return; //Clicked something else -> We have no url to check, stop here. Just in case, shouldn't happen.\n\n url = normalizeUrl(url);\n ToggleTagInLocalStorage(url, existingTags[i], tab);\n }\n }\n\n}","function refreshContextMenu() {\n chrome.contextMenus.removeAll();\n createMainMenu();\n addChildrenToContextMenu();\n}","function handleInstall(){\n var context = \"selection\";\n var title = \"Clip this...\";\n var id = chrome.contextMenus.create({\"title\": title, \"contexts\":[context],\n \"id\": \"context\" + context}); \n}","beforeContextMenuShow() {}","beforeContextMenuShow() {}","update () {\n this.tray.setContextMenu(this.contextMenu)\n }","function updateContextMenus() {\n chrome.tabs.query({ lastFocusedWindow: true, active: true },\n function(tabs) {\n var pagetype;\n var contexts = new Array();\n\n if (chrome.runtime.lastError == null && typeof tabs[0] != \"undefined\" && tabs[0].url != \"about:blank\") /* tab not closed or about:blank */ {\n pagetype = (typeof tabPageTypes[tabs[0].id] == \"undefined\") ? 0 : tabPageTypes[tabs[0].id];\n\n contexts = showSubmenu ? [\"all\"] : [\"browser_action\"];\n\n if (!specialPage(tabs[0].url) && tabs[0].status == \"complete\") {\n chrome.contextMenus.update(\"basicitems\", { contexts: contexts, enabled: (pagetype <= 1) });\n chrome.contextMenus.update(\"standarditems\", { contexts: contexts, enabled: (pagetype <= 1) });\n chrome.contextMenus.update(\"customitems\", { contexts: contexts, enabled: (pagetype <= 1) });\n chrome.contextMenus.update(\"viewpageinfo\", { contexts: contexts, enabled: (pagetype >= 1) });\n\n if (pagetype == 2) chrome.contextMenus.update(\"removeresourceloader\", { contexts: contexts, enabled: true });\n else chrome.contextMenus.update(\"removeresourceloader\", { contexts: [\"page_action\"], enabled: false });\n\n if (pagetype >= 1) chrome.contextMenus.update(\"extractmedia\", { contexts: [\"image\", \"audio\", \"video\"], enabled: true });\n else chrome.contextMenus.update(\"extractmedia\", { contexts: [\"page_action\"], enabled: false });\n } else {\n chrome.contextMenus.update(\"basicitems\", { contexts: contexts, enabled: false });\n chrome.contextMenus.update(\"standarditems\", { contexts: contexts, enabled: false });\n chrome.contextMenus.update(\"customitems\", { contexts: contexts, enabled: false });\n chrome.contextMenus.update(\"viewpageinfo\", { contexts: contexts, enabled: false });\n chrome.contextMenus.update(\"removeresourceloader\", { contexts: [\"page_action\"], enabled: false });\n chrome.contextMenus.update(\"extractmedia\", { contexts: [\"page_action\"], enabled: false });\n }\n }\n });\n}","function updateTabs() {\n getCurrentWindowTabs().then((tabs) => {\n tabCountInWindowTitle(tabs);\n for (let tab of tabs) {\n var tabIdtoString = tab.id.toString();\n\n if (tab.favIconUrl !=undefined){\n var favIconUrltoString = tab.favIconUrl.toString(); \n //console.log(favIconUrltoString + \" favIconUrltoString\") \n }else{\n var favIconUrltoString = \"logos/clearfavicon.png\";\n //console.log(favIconUrltoString + \" favIconUrltoString\") \n }\n tab.title = \"&\" + tab.title;\n if(tab.active){tab.title =tab.title + \" ~#~\"; console.log(\"tab active \" + tab.id);}\n\n browser.menus.update(tabIdtoString,{\n \"icons\": {\n \"16\": favIconUrltoString\n },\n title: tab.title\n });\n }\n });\n}","function updateContextMenus()\n{\n if (prefs.debug)\n console.log(\"URL Link updating context menus\");\n\n // Menus required\n wantUrlMenu = false; /// isUrl;\n wantTxtMenu = true; /// (!isUrl || prefs.forcesubmenu);\n\n // Any change at all?\n if (wantUrlMenu === currentUrlMenu && wantTxtMenu === currentTxtMenu && !menuChanged)\n return;\n\n // In order to keep menu ordering the same, we have to always delete and re-create our menus (if they've changed).\n menusDeleting = 0;\n if (currentUrlMenu)\n {\n // Delete old URL menus\n currentUrlMenu = false;\n browserMenusRemove( \"open-selected-url-in-new-tab\" );\n browserMenusRemove( \"open-selected-url\" );\n browserMenusRemove( \"main-menu-separator\" );\n browserMenusRemove( \"main-menu-help\" );\n browserMenusRemove( \"main-menu-changelog\" );\n browserMenusRemove( \"main-menu-prefs\" );\n }\n if (currentTxtMenu)\n {\n // Delete old text menus\n currentTxtMenu = false;\n removeContextMenuItems( \"open-selection-in-new-tab\" );\n removeContextMenuItems( \"open-selection\" );\n browserMenusRemove( \"main-menu-separator\" );\n browserMenusRemove( \"main-menu-help\" );\n browserMenusRemove( \"main-menu-changelog\" );\n browserMenusRemove( \"main-menu-prefs\" );\n }\n\n // Await all deletions before recreating\n if (menusDeleting === 0)\n createContextMenus();\n}","updateContextMenu(saveCleanFiles) {\n const title = (saveCleanFiles) ? 'contextMenuScanAndDownloadTitle' : 'contextMenuScanTitle';\n if (contextMenus[MCL_CONFIG.contextMenu.scanId]) {\n chrome.contextMenus.update(MCL_CONFIG.contextMenu.scanId, {\n title: chrome.i18n.getMessage(title)\n }); \n }\n }","async function updateContextMenu() {\n try {\n await browser.contextMenus.removeAll();\n\n let defaultValues = {};\n\n for (let contextMenuItem of [\n { id: 'RestoreTree', title: settings.customRestoreTreeContextMenuLabel, contexts: ['bookmark'] },\n { id: 'BookmarkTree', title: settings.customBookmarkTreeContextMenuLabel, contexts: ['tab'], enabled: settings.hasTabContextMenu },\n ]) {\n let { id, title, contexts, enabled = true, isDefaults = false } = typeof contextMenuItem === 'string' ? { id: contextMenuItem } : contextMenuItem;\n if (!enabled) {\n continue;\n }\n if (isDefaults) {\n Object.assign(defaultValues, contextMenuItem);\n return;\n }\n\n let details = {\n contexts: contexts || defaultValues.contexts,\n };\n if (id.startsWith('-')) {\n Object.assign(details, {\n type: 'separator',\n });\n } else {\n Object.assign(details, {\n id: id,\n title: title || browser.i18n.getMessage(`contextMenu_${id}`),\n });\n }\n await browser.contextMenus.create(details);\n }\n } catch (error) {\n return false;\n }\n return true;\n}","function onClickedContextMenuHandler (info, tab) {\r\n let menuItemId = info.menuItemId;\r\n//console.log(\"menuItemId = \"+menuItemId);\r\n if (menuItemId == SubMenuPathId) {\r\n//console.log(\"SubMenuPathId clicked\");\r\n\tlet bnId = info.bookmarkId;\r\n\tlet BN = curBNList[bnId];\r\n\topenPropPopup(\"prop\", bnId, BN_path(BN.parentId), BN.type, BN.title, BN.url);\r\n }\r\n else\r\n if (menuItemId == BAOpenTabId) {\r\n//console.log(\"BAOpenTabId clicked, tab id = \"+tab.id);\r\n\t// Open BSP2 in new tab, referred by this tab to come back to it when closing\r\n\topenBsp2NewTab(tab);\r\n }\r\n else if (menuItemId == BAShowInSidebar) {\r\n//console.log(\"Show \"+lastMenuBnId+\" in BSP2 sidebar\");\r\n\tif (lastMenuBnId != undefined) {\r\n\t let windowId = tab.windowId;\r\n\t // Can't use browser.sidebarAction.isOpen() here, as this is waiting for a Promise,\r\n\t // and so when it arrives we are not anymore in the code flow of a user action, so\r\n\t // the browser.sidebarAction.close() and browser.sidebarAction.open() are not working :-(\r\n\t // => Have to track state through other mechanisms to not rely on Promises ...\r\n\t if (isSidebarOpen[windowId] == true) { // Already open\r\n\t\tpanelShowBookmark(windowId, tab.id, lastMenuBnId);\r\n\t }\r\n\t else {\r\n\t\tbrowser.sidebarAction.open()\r\n\t\t.then(panelShowBookmark(windowId, tab.id, lastMenuBnId));\r\n\t }\r\n\t}\r\n }\r\n else if (menuItemId == BAHistory) {\r\n\t// Open Bookmark history window\r\n\topenBsp2History();\r\n }\r\n else if (menuItemId == BAOptionsId) {\r\n\t// Open BSP2 options\r\n\tbrowser.runtime.openOptionsPage();\r\n }\r\n}","function refreshContextMenu() {\n clearTimeout(refreshContextMenuTimer);\n refreshContextMenuTimer = setTimeout(doRefreshContextMenu, 150);\n }","function xcustom_onContextMenu(event) {\r\n console.log('there we are...');\r\n}","function createContextMenus(){\n chrome.contextMenus.removeAll();\n // Add parent context menus\n chrome.contextMenus.create({\n title: \"Mazii - Notification Action\",\n id: \"parent\",\n contexts:[\"link\", \"selection\"]\n });\n // Add child context menu\n chrome.contextMenus.create({\n title: \"Follow this post\",\n parentId: \"parent\",\n contexts:[\"link\", \"selection\"],\n onclick: function(info, tab) {\n let linkUrl = info.linkUrl;\n saveNewLinkUrl(linkUrl);\n }\n });\n}","toggleMenu(context) {\n context.commit('toggleMenu');\n }","_updateHAXCEMenu() {\n this._ceMenu.ceButtons = [\n {\n icon: this.locked ? \"icons:lock\" : \"icons:lock-open\",\n callback: \"haxClickInlineLock\",\n label: \"Toggle Lock\",\n },\n {\n icon: this.published ? \"lrn:view\" : \"lrn:view-off\",\n callback: \"haxClickInlinePublished\",\n label: \"Toggle published\",\n },\n {\n icon: \"editor:format-indent-increase\",\n callback: \"haxIndentParent\",\n label: \"Move under parent page break\",\n disabled: !pageBreakManager.getParent(this, \"indent\"),\n },\n {\n icon: \"editor:format-indent-decrease\",\n callback: \"haxOutdentParent\",\n label: \"Move out of parent page break\",\n disabled: !pageBreakManager.getParent(this, \"outdent\"),\n },\n ];\n }","function TabContextMenu(props) {\n const [appState,] = useContext(AppContext);\n const [layoutState,] = useContext(LayoutContext);\n\n const isTicketShared = ({event, props}) => {\n let tickets = appState.tickets.filter(t => t.id === props.tabid && !t.parent);\n return tickets.length === 0;\n };\n\n const duplicateTicket = (originalTicketid, tabName) => {\n appState.actions.duplicateticket(originalTicketid, (ticketid) => {\n appState.actions.activateTicket(ticketid, tabName);\n // update tickets, so ticket list is renewed\n appState.actions.updateTickets();\n })\n };\n\n // Executes when user selects action in tab's name context menu\n const onTabContextMenuAction = (event, props, action) => {\n // When menu is clicked, it is over other element and we need to stop\n // propagation, otherwise it conflicts with other events\n event.stopPropagation();\n\n switch (action) {\n case \"reconnect\":\n layoutState.actions.refreshTab(props.tabid);\n break;\n case \"share\":\n appState.actions.openModal({type: ShareTicketModal, data: {id: props.tabid, name: props.name}});\n break;\n case \"disconnect\":\n layoutState.actions.deleteTab(props.tabid);\n break;\n case \"duplicate\":\n duplicateTicket(props.tabid, props.name);\n break;\n case \"screenSize\":\n layoutState.actions.updateTabScreenSize(props.tabid, props.screenSize);\n break;\n default:\n window.alert(\"Wrong action: \" + action)\n }\n };\n\n return (\n <Menu animation=\"fade\" id=\"tab_context_menu\" theme=\"dark\">\n <Item\n onClick={({event, props}) => onTabContextMenuAction(event, props, \"reconnect\")}>Reconnect</Item>\n <Separator/>\n <Item disabled={isTicketShared}\n onClick={({event, props}) => onTabContextMenuAction(event, props, \"share\")}>Share</Item>\n <Separator/>\n <Item disabled={isTicketShared}\n onClick={({event, props}) => onTabContextMenuAction(event, props, \"duplicate\")}>Duplicate</Item>\n <Separator/>\n <Item\n onClick={({event, props}) => onTabContextMenuAction(event, props, \"disconnect\")}>Close</Item>\n <Submenu label=\"Screen size\">\n <Item onClick={({event, props}) => onTabContextMenuAction(event, {\n ...props,\n screenSize: null\n }, \"screenSize\")}>Auto</Item>\n {SCREEN_SIZES.map(size =>\n <Item onClick={({event, props}) => onTabContextMenuAction(event, {\n ...props,\n screenSize: {width: size[0], height: size[1]}\n }, \"screenSize\")}>{size[0]} x {size[1]}</Item>\n )\n }\n </Submenu>\n </Menu>\n );\n}","function refreshIconAndContextMenu(tab)\n{\n // The tab could have been closed by the time this function is called\n if(!tab)\n return;\n\n var excluded = isWhitelisted(tab.url);\n var iconFilename = excluded ? \"icons/abp-19-whitelisted.png\" : \"icons/abp-19.png\";\n\n if (activeNotification)\n startIconAnimation(tab, iconFilename);\n else\n chrome.pageAction.setIcon({tabId: tab.id, path: iconFilename});\n\n // Only show icon for pages we can influence (http: and https:)\n if(/^https?:/.test(tab.url))\n {\n chrome.pageAction.setTitle({tabId: tab.id, title: \"Adblock Plus\"});\n if (\"shouldShowIcon\" in localStorage && localStorage[\"shouldShowIcon\"] == \"false\")\n chrome.pageAction.hide(tab.id);\n else\n chrome.pageAction.show(tab.id);\n\n // Set context menu status according to whether current tab has whitelisted domain\n if (excluded)\n chrome.contextMenus.removeAll();\n else\n showContextMenu();\n }\n}","function delegate_to(tab_id)\n {\n menu_tab_id = tab_id;\n browser.browserAction.setPopup({ popup: \"\" });\n browser.browserAction.onClicked.addListener(focus_menu_tab);\n }","function checkboxOnClick(info, tab) {\n\tconsole.log(JSON.stringify(info));\n\tvar parent = chrome.contextMenus.create({\"title\": \"aux\"});\n\nfor (var i = 6; i < 8; i++) {\n\tvar context = \"selection\";\n var thatit = titles[i];\n var deei = chrome.contextMenus.create({\"title\": thatit,\"parentId\": parent, \"onclick\": process});\n idz[i] = deei;\n\tconsole.log(\"'\" + context + \"' item:\" + idz[i]);\n }\n }","function setup_menu() {\n $('div[data-role=\"arrayitem\"]').contextMenu('context-menu1', {\n 'remove item': {\n click: remove_item,\n klass: \"menu-item-1\" // a custom css class for this menu item (usable for styling)\n },\n }, menu_options);\n $('div[data-role=\"prop\"]').contextMenu('context-menu2', {\n 'remove item': {\n click: remove_item,\n klass: \"menu-item-1\" // a custom css class for this menu item (usable for styling)\n },\n }, menu_options);\n }","function contextMenu(e){\r\n\tprintln(\"context\");\r\n\treturn false;\r\n}","function showUIActionContext(event) {\n if (!g_user.hasRole(\"ui_action_admin\"))\n return;\n var element = Event.element(event);\n if (element.tagName.toLowerCase() == \"span\")\n element = element.parentNode;\n var id = element.getAttribute(\"gsft_id\");\n var mcm = new GwtContextMenu('context_menu_action_' + id);\n mcm.clear();\n mcm.addURL(getMessage('Edit UI Action'), \"sys_ui_action.do?sys_id=\" + id, \"gsft_main\");\n contextShow(event, mcm.getID(), 500, 0, 0);\n Event.stop(event);\n}","function createContextMenu() {\n if (localStorage['sunjer_option_contextMenu'] === 'true') {\n contextMenuId = chrome.contextMenus.create({\n title: \"sunjer\",\n contexts: ['all']\n });\n\t\t\n chrome.contextMenus.create({\n title: \"Style Element\",\n contexts: ['all'],\n onclick: function() {\n sendRequestToCurrentTab(\"openWidget\");\n },\n parentId: contextMenuId\n });\n\t\t\n contextMenuStatusId = chrome.contextMenus.create({\n title: \"Toggle styling\",\n contexts: ['all'],\n onclick: function() {\n sendRequestToCurrentTab(\"toggleStyle\");\n },\n parentId: contextMenuId\n });\n\t\t\n chrome.contextMenus.create({\n title: \"Search for styles...\",\n contexts: ['all'],\n onclick: function() {\n sendRequestToCurrentTab(\"searchSocial\");\n },\n parentId: contextMenuId\n });\n }\n}","updateSelectedTab ({ commit }, tab) {\n commit('SET_NEW_TAB', tab)\n }","contextMenu(x, y, _isLeftButton) {}","function destroyPreviousContextMenu(tabId) {\n if (contextMenus.hasOwnProperty(tabId))\n contextMenus[tabId].destroy();\n}","function cleanUpTab(tabId) {\n destroyPreviousContextMenu(tabId);\n}","_setContextMenu() {\n this.dom.contextMenu.config = new PopContextMenuConfig();\n this.dom.setSubscriber('context-menu', this.dom.contextMenu.config.emitter.subscribe((event) => {\n this.log.event(`context-menu`, event);\n this.events.emit(event);\n }));\n }","function postContextMenuWork(data, textStatus, jqXHR, param) {\n\teditBulkInProgress = true;\n\tshowPreview();\n\teditBulkInProgress = false;\n}","translateContextMenu() {\n if (this.contextMenuExtension && this.contextMenuExtension.translateContextMenu) {\n this.contextMenuExtension.translateContextMenu();\n }\n }","updateItems(e) {\n this.__tabs = this.querySelectorAll(\"a11y-tab\");\n this.__hasIcons = true;\n if (!this.id) this.id = this._generateUUID();\n if (this.__tabs && this.__tabs.length > 0)\n this.__tabs.forEach((tab, index) => {\n if (!tab.icon) this.__hasIcons = false;\n tab.order = index + 1;\n tab.total = this.__tabs.length;\n });\n this.selectTab(this.activeTab);\n }","function onClickHandler(info, tab) {\n\tvar itemId = info.menuItemId;\n\tvar context = itemId.split('_', 1)[0];\n\t\n\tswitch (context) {\n\t\tcase 'selection':\n\t\t\tif (info.selectionText.length > 0) {\n\t\t\t\tconsole.log(JSON.stringify(info.selectionText));\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tconsole.log('Other context than selection');\n\t}\n\t\n\n}","function rightClickMenu(ctx) {\n window.rightClickCtx = ctx\n $(fitStrechBtn).text(\n window\n .references[ctx.target.id]\n .data.metadata.ratio === 'fit' ? \n 'Strech ratio' : 'Fit ratio'\n )\n\n $(contextMenu).css({\n 'top': `${ctx.pageY - 15}px`, \n 'left': `${ctx.pageX + 15}px`\n }).show();\n ctx.preventDefault();\n}","function contextualMenuItems( item, view ) {\n}","onAfterContextMenuShow() {\n const contextMenu = this.hot.getPlugin('contextMenu');\n const data = contextMenu.menu.hotMenu.getData();\n\n // find position of 'copy' option.\n arrayEach(data, (item, index) => {\n if (item.key === 'copy') {\n let zeroClipboardInstance = new ZeroClipboard(contextMenu.menu.hotMenu.getCell(index, 0));\n\n zeroClipboardInstance.off();\n zeroClipboardInstance.on('copy', (event) => {\n let clipboard = event.clipboardData;\n\n clipboard.setData('text/plain', this.getCopyValue());\n this.hot.getSettings().outsideClickDeselects = this.outsideClickDeselectsCache;\n });\n\n // hide copy/paste btn when error, edit by xp 2015.12.15\n zeroClipboardInstance.on('error', (function(){\n let $menuItems = $('.htContextMenu tbody tr');\n $($menuItems[0]).hide();\n $($menuItems[1]).hide();\n $('.htSeparator').first().hide();\n }));\n\n return false;\n }\n });\n }","function onContextMenu_Item(event, mEdit, mCopy, callbackEvent, callbackWindow, jaloPk, webroot) {\r\n\tvar element = getMenuHTMLElement();\r\n\tshowCMSMenu( element, event);\r\n\taddItemLinks(element, mEdit, mCopy, callbackEvent, callbackWindow, jaloPk, webroot);\r\n\tevent.cancelBubble=true;\r\n\treturn false;\r\n}","function setMenuContext(options) {\n this.hType = options.hType;\n this.hNum = options.hNum;\n setMenuPosition.call(this, options.target);\n }","initContextMenu() {\n this.menu = new D3NE.ContextMenu(this._contextMenuData);\n }","function detachContextMenus() {\n $(\".graph .node\").unbind(\"contextmenu\"); \n }","function contextMenu(browserWindow){\n cm({\n browserWindow,\n \n prepend: (params) => [\n {\n role: 'reload',\n enabled: params.isEditable === false,\n visible: params.isEditable === false\n },\n {\n role: 'undo',\n enabled: params.isEditable && params.editFlags.canUndu,\n visible: params.isEditable\n },\n {\n role: 'redo',\n enabled: params.isEditable && params.editFlags.canRedo,\n visible: params.isEditable\n }\n ],\n append: (params) => [\n {\n role: 'delete',\n enabled: params.isEditable && params.editFlags.canDelete,\n visible: params.isEditable\n },\n {\n role: 'selectall',\n enabled: params.isEditable && params.editFlags.canSelectAll,\n visible: params.isEditable\n }\n ],\n\n showInspectElement: false\n });\n}","function PivotContextMenu(parent){/* eslint-enable */this.parent=parent;this.parent.contextMenuModule=this;}","function detachContextMenus() {\n $('.graph .node').unbind('contextmenu');\n }","function setToolTab() {\n\tvar toolTabTitle = $('[data-tool-tab-title]');\n\tvar toolTabContent = $('[data-tool-tab-content]');\n\t\ttoolTabContent.attr('hidden', true); // hide all\n\t\t$('[data-tool-tab]').removeClass('active'); // reset active\n\n\t\t// loop all tab content\n\t\ttoolTabContent.each(function(){\n\t\t\tvar $this = $(this);\n\t\t\tvar stringId = $this.attr('data-tool-tab-content'); // Eg. 'design', 'development' etc\n\n\t\t\t// Choose Tab based on URL Hashbang\n\t\t\t// if level1: settings OR if level2: site\n\t\t\tif (stringId == getHashBang().level1 || stringId == getHashBang().level2) {\n\t\t\t\t$this.removeAttr('hidden'); // show selected\n\t\t\t\t$('[data-tool-tab*=\"'+stringId+'\"]').addClass('active'); // mark active\n\n\t\t\t\t// Don't let [site, docs] change title = always parent title (Development)\n\t\t\t\tif (stringId == getHashBang().level1) {\n\t\t\t\t\ttoolTabTitle.text(stringId + \" \"); // space to remove glitch\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\t// Funky gradient on header\n\t\tapplyGradientHeader('.lv-context-menu-header .subheader');\n}","viewImageInNewTab()\r\n {\r\n document.getElementById(\"context-viewimage\")\r\n .setAttribute(\"oncommand\", `openTrustedLinkIn(gContextMenu.imageURL, \"tab\")`);\r\n }","function doOpen(e) {\n $.win.invalidateOptionsMenu();\n}","function options(evt, opName) {\n var i, tabcontent, tablinks;\n tabcontent = document.getElementsByClassName(\"tabcontent\");\n for (i = 0; i < tabcontent.length; i++) {\n tabcontent[i].style.display = \"none\";\n }\n tablinks = document.getElementsByClassName(\"tablinks\");\n for (i = 0; i < tablinks.length; i++) {\n tablinks[i].className = tablinks[i].className.replace(\" active\", \"\");\n }\n document.getElementById(opName).style.display = \"block\";\n evt.currentTarget.className += \" active\";\n}","function onContextClick(info, tab) {\n chrome.tabs.remove(tab.id);\n}","function loadMenuItems () {\n chrome.contextMenus.removeAll(function () {\n console.log(\"clear all context items\")\n });\n\n chrome.storage.sync.get(null, function(items) {\n var allKeys = Object.keys(items);\n console.log(\"adding context items\")\n\n allKeys.forEach(function (key) {\n var menuId = chrome.contextMenus.create({\n \"title\" : key,\n \"type\" : \"normal\",\n \"contexts\" : [\"image\"],\n \"onclick\" : getClickHandler()\n });\n mapInfo[menuId] = key;\n })\n });\n\n // default one\n chrome.contextMenus.create({\n \"title\" : \"New ChainId\",\n \"type\" : \"normal\",\n \"contexts\" : [\"image\"],\n \"onclick\" : getNewChainClickHandler()\n });\n}","function ShowExtensionItemInContextMenu(youtuberHref, titleContextMenu) {\r\n\tvar message = { context: \"CreateContextMenu\", showContextMenus: \"true\", \"youtuberHref\": youtuberHref, title: titleContextMenu };\r\n\t// console.log(\"hiden element by RMB\");\r\n\t// console.log(videoElement);\r\n\tSendMessageToBackgroundScript(message);\r\n}","function DeMakaMenuClick(info, tab) {\n chrome.tabs.query({\n \"active\": true,\n \"currentWindow\": true\n }, function (tabs) {\n chrome.tabs.sendMessage(tabs[0].id, {\n \"functiontoInvoke\": \"undoMAKA\"\n });\n });\n}","function ContextMenu ( ) {\n\tthis.Menu = window.createPopup();\n\t\t\n\tthis.currentHeight = 0;\n\tthis.increment = 15;\n\tthis.delay=2;\n}","function ContextMenuClickHandler() {\n $(settings.menuSelector)\n .off('click')\n .on('click', function(e) {\n $(this).hide();\n\n var $invokedOn = $(this).data(\"invokedOn\");\n var $selectedMenu = $(e.target);\n\n settings.menuSelected.call($(this), $invokedOn, $selectedMenu);\n });\n\n }","reloadActions(actions = this.actions) {\n if (this.menu.children.length > 0) {\n this.menu.innerHTML = \"\";\n }\n var styling = document.createElement(\"style\");\n styling.innerHTML = `\n div.ion_contextMenu{\n position: absolute;\n max-width: 256px;\n background: #1b1b1b;\n color: white;\n border-style: solid;\n border-width: 2px;\n border-color: white;\n z-index: 10000;\n }\n\n div.ion_menuEntry{\n padding: 4px;\n user-select: none;\n }\n\n div.ion_menuEntry[checked]{\n /* background-color: lightgreen; */\n }\n\n div.ion_menuEntry:hover{\n background: #5b5b5b;\n cursor: pointer;\n }\n\n div.ion_menuEntry.ion_label{\n text-align: center;\n }\n \n div.ion_menuEntry.ion_label:hover{\n background: #1b1b1b;\n cursor: not-allowed;\n }\n\n div.ion_menuEntry div.checkboxTick{\n width: 18px;\n height: 18px;\n border-radius: 20px;\n background-color: white;\n opacity: 0.75;\n float: right;\n }\n\n div.ion_menuEntry[checked] div.checkboxTick{\n background-color: lightgreen;\n opacity: 1;\n }\n `;\n\n this.menu.appendChild(styling);\n\n var inst = this;\n for (let i = 0; i < actions.length; i++) {\n const action = actions[i];\n const div = document.createElement(\"div\");\n div.className = \"ion_menuEntry\";\n div.innerHTML = action.name;\n \n if (action.type && action.type == \"checkbox\") {\n if (action.checked) {\n div.toggleAttribute(\"checked\", true);\n }\n const cBox = document.createElement(\"div\");\n cBox.className = \"checkboxTick\";\n \n div.appendChild(cBox);\n\n div.title = \"\\\"\"+action.name+\"\\\" is \"+div.hasAttribute(\"checked\")+\".\";\n }\n\n if (typeof action.click == \"function\") {\n div.onclick = function(e) {\n action.click(e, inst.reference, e.target);\n if (action.type == \"checkbox\") {\n div.toggleAttribute(\"checked\");\n div.title = \"\\\"\"+action.name+\"\\\" is \"+div.hasAttribute(\"checked\")+\".\";\n }\n inst.hide();\n };\n }\n else {\n div.classList.add([\"ion_label\"]);\n div.style.borderBottomStyle = \"solid\";\n div.style.borderBottomWidth = \"1px\";\n div.style.borderBottomColor = \"#3b3b3b\";\n\n div.style.borderTopStyle = \"solid\";\n div.style.borderTopWidth = \"1px\";\n }\n\n if (typeof action.runOnThis == \"function\") {\n action.runOnThis(div);\n }\n\n this.menu.appendChild(div);\n }\n }","function onPrefChange(prefName) {\n menu.items = createMenuItems();\n}","function context_menu(params,event) {\n\tel=document.getElementById(\"cm\");\n\to=event.srcElement;\n\tx=event.clientX+document.documentElement.scrollLeft+document.body.scrollLeft;\n\ty=event.clientY+document.documentElement.scrollTop+document.body.scrollTop;\n\tel.innerHTML='';\n\tfor (k in params) {\n\t//if params[k]=='space' then draw line (separator)\n\t\tif (params[k]=='space') { el.innerHTML+='<hr size=1>';\n\t//if menu item is disabled\n\t\t} else if (params[k][\"disabled\"]) { el.innerHTML+='<a class=\"cm_gray\" href=\"\" onclick=\"return false;\" title=\"'+params[k][\"title\"]+'\" onmouseover=\"window.status=this.title;return true;\" onmouseout=\"window.status="" ;return true;\"> '+params[k][\"value\"]+\"</a><br>\";\n\t//if current window is not opened in frame\n\t\t} else if (params[k][\"frame\"]==\"off\") { if (window.frameElement==\"[object HTMLFrameElement]\") { el.innerHTML+='<a class=\"cm_black\" href=\"\"'+\"onclick=\"+'window.open('+\"'\"+params[k][\"href\"]+\"','','statusbar,menubar,location'); return false;\"+'\" title=\"'+params[k][\"title\"]+'\" onmouseover=\"window.status=this.title;return true;\" onmouseout=\"window.status="" ;return true;\"> '+params[k][\"value\"]+\"</a><br>\";} else { el.innerHTML+='<a class=\"cm_black\" href=\"\"'+\"onclick=\"+'window.open('+\"'\"+params[k][\"href\"]+\"','','statusbar,menubar,location');return false;\"+'\" title=\"'+params[k][\"title\"]+'\" onmouseover=\"window.status=this.title;return true;\" onmouseout=\"window.status="" ;return true;\"> '+params[k][\"value\"]+\"</a><br>\";}\n\t//if current window must be opened in frame\n\t\t} else if (params[k][\"frame\"]==\"on\") { el.innerHTML+='<a class=\"cm_black\" href=\"\"'+'onclick='+\"parent\"+params[k][\"taget\"]+\".location.href='\"+params[k][\"href\"]+\"' return false;\"+' title=\"'+params[k][\"title\"]+'\" onmouseover=\"window.status=this.title;return true;\" onmouseout=\"window.status="" ;return true;\"> '+params[k][\"value\"]+\"</a><br>\";}\n\t}\n\tel.style.visibility=\"visible\";\n\tel.style.display=\"block\";\n\theight=el.scrollHeight-20;\n\tif (window.opera) height+=30;//stupid opera...\n\tif (event.clientY+height>document.body.clientHeight) { y-=height+14 } else { y-=2 }\n\tel.style.left=x+\"px\";\n\tel.style.top=y+\"px\";\n\tel.style.visibility=\"hidden\";\n\tel.style.display=\"none\";\n\tel.style.visibility=\"visible\";\n\tel.style.display=\"block\";\n\tevent.returnValue=false;\n}","function setMenu() {\n //添加快捷键\n\tlet applicationOptions = [\n\t\t{ label: \"About Kungfu\", click: showKungfuInfo},\n\t\t{ label: \"Settings\", accelerator: \"CmdOrCtrl+,\", click: openSettingDialog },\n\t\t{ label: \"Close\", accelerator: \"CmdOrCtrl+W\", click: function() { console.log(BrowserWindow.getFocusedWindow().close()); }}\n\t]\n\n\tif(platform === 'mac') {\n\t\tapplicationOptions.push(\n\t\t\t{ label: \"Quit\", accelerator: \"Command+Q\", click: function() { app.quit(); }},\n\t\t)\n\t}\n\n\tconst template = [\n\t{\n\t\tlabel: \"Kungfu\",\n\t\tsubmenu: applicationOptions\n\t}, \n\t{\n\t\tlabel: \"Edit\",\n\t\tsubmenu: [\n\t\t\t{ label: \"Copy\", accelerator: \"CmdOrCtrl+C\", selector: \"copy:\" },\n\t\t\t{ label: \"Paste\", accelerator: \"CmdOrCtrl+V\", selector: \"paste:\" },\n\t\t]\n\t}];\n\t\n\tMenu.setApplicationMenu(Menu.buildFromTemplate(template))\n}","function DeMamaMenuClick(info, tab) {\n chrome.tabs.query({\n \"active\": true,\n \"currentWindow\": true\n }, function (tabs) {\n chrome.tabs.sendMessage(tabs[0].id, {\n \"functiontoInvoke\": \"undoMAMA\"\n });\n });\n}","function deleteEventContextMenu() {\n confirmDeleteEvents();\n}","function change_tab_content()\n{\n $('.pages-icons').removeClass(\"current\");\n $(this).addClass('current');\n}","function changeTab(event){\n let tabs = document.getElementsByClassName('tab');\n for(i=0; i <tabs.length;i++){\n tabs[i].classList.remove(\"active\");\n }\n event.target.parentNode.classList+= \" active\";\n let selelectedtab = event.target.innerHTML;\n let contenttab = document.getElementById('myTabContent');\n let contents = menuobject[selelectedtab];\n contenttab.innerHTML = \"\";\n for(key in contents){\n let newbutton = document.createElement('button');\n newbutton.className = \"col-lg-2 col-md-2 col-xs-4 btn contentbtn\";\n newbutton.innerHTML = key;\n newbutton.addEventListener('click',foodbtnclick);\n contenttab.appendChild(newbutton);\n }\n}","onRightClick() {\n const menuConfig = Menu.buildFromTemplate([\n {\n label: 'Quit',\n click: () => app.quit()\n }\n ]);\n this.popUpContextMenu(menuConfig);\n }","function tabClicked(tab) {\n $('#'+currentList).removeClass('defaulttab'); // Remove the defaulttab class from the currentlist\n currentList = $(tab).attr('id'); // Set the currentlist to the new list\n $('#'+currentList).addClass('defaulttab'); // Add the defaulttab class to the new (current) list\n redrawTodosUI(); // Redraw the ToDos, as the list has changed\n }","function openMenu(event, menuName) {\n // hide all elements with class=\"tabContent\"\n const tabContent = document.getElementsByClassName(\"tabContent\")\n for (let i = 0; i < tabContent.length; i++) {\n tabContent[i].style.display = \"none\"\n }\n\n // Remove 'active' class from all elements with the class=\"tablink\"\n const tablink = document.getElementsByClassName(\"tablink\")\n for (let i = 0; i < tablink.length; i++) {\n tablink[i].className = tablink[i].className.replace(\" active\", \"\")\n }\n\n // Show current tab and add \"active\" class to the button that opened the tab\n document.getElementById(menuName).style.display = \"block\"\n event.currentTarget.className += \" active\"\n \n}","function updateCommand(element, context) {\n var typed = element.querySelector('.gcli-help-command').textContent;\n context.update(typed);\n}","function setContextMenuAttribs() {\n\t\t\tvar exportList = chart.exportDivElements;\n\t\t\tif (exportList) {\n\t\t\t\t// Set tabindex on the menu items to allow focusing by script\n\t\t\t\t// Set role to give screen readers a chance to pick up the contents\n\t\t\t\tfor (var i = 0; i < exportList.length; ++i) {\n\t\t\t\t\tif (exportList[i].tagName === 'DIV' &&\n\t\t\t\t\t\t!(exportList[i].children && exportList[i].children.length)) {\n\t\t\t\t\t\texportList[i].setAttribute('role', 'menuitem');\n\t\t\t\t\t\texportList[i].setAttribute('tabindex', -1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// Set accessibility properties on parent div\n\t\t\t\texportList[0].parentNode.setAttribute('role', 'menu');\n\t\t\t\texportList[0].parentNode.setAttribute('aria-label', 'Chart export');\n\t\t\t}\n\t\t}","function handleContextMenu(event) {\n\tconsole.log(\"Contextual Menu\");\n\tconsole.log( event.target.nodeName.toLowerCase() );\n\tif ( event.target.nodeName.toLowerCase() != \"a\" ) {\n\t\t//\tGet disabling to work and add on/off preference for this feature\n\t\t// safari.self.tab.dispatchMessage(\"disable\", true);\n\t\tsafari.self.tab.dispatchMessage(\"getLink\", document.URL);\n\t\tconsole.log(document.URL);\n\t} else {\n\t\tsafari.self.tab.dispatchMessage(\"getLink\", event.target.href);\n\t\tconsole.log(event.target.href);\t//\tFor debugging\n\t}\n}","function main_menu_tab_change_to_etc() {\n\t$('#main-menu-tab li a').removeClass('select');\n\t$('#main-menu-etc-tab').addClass('select');\n\n\t$(\"#main-menu-search\").css(\"display\",\"none\");\n\t$(\"#main-menu-etc\").css(\"display\",\"block\");\n}","setupContextMenu(saveCleanFiles) {\n const title = (saveCleanFiles) ? 'contextMenuScanAndDownloadTitle' : 'contextMenuScanTitle';\n return chrome.contextMenus.removeAll(() => {\n const menuId = chrome.contextMenus.create({\n id: MCL_CONFIG.contextMenu.scanId,\n title: chrome.i18n.getMessage(title),\n contexts: ['link', 'image', 'video', 'audio']\n });\n contextMenus[menuId] = menuId;\n });\n }","function loadPagesTableContextMenu() {\n try {\n $.contextMenu({\n selector: '.pages-main-panel .pages-main-table > tbody > tr > td span.column-field-page-option',\n trigger: 'left',\n callback: function(key, options) { \n switch(key) {\n case \"edit\":\n $(this).closest('td').find('a').trigger('click');\n break;\n case \"copy\": \n // \n break;\n case \"delete\": \n // \n break;\n default : \n // \n break;\n }\n },\n items: {\n \"edit\": {\n name: \"Edit\",\n icon: 'menu-rename',\n disabled: function(key, opt) { \n if(!hasWriteAccess()){\n return true;\n }\n return false;\n }\n },\n \"copy\": {\n name: \"Copy\",\n icon: 'menu-copy',\n disabled: function(key, opt) {\n if(!hasWriteAccess()){\n return true;\n }\n return false;\n }\n },\n \"delete\": {\n name: \"Delete\",\n icon: 'menu-delete',\n disabled: function(key, opt) {\n if(!hasWriteAccess()){\n return true;\n }\n return false;\n }\n }\n }\n });\n } catch (error) {\n displayLibraryCatchError('context-menu');\n return false;\n }\n}","function setupContextMenu() {\n\t//Add the context menu to chrome\n\tvar content = lh.getContent(\"background_script\");\n\tvar contextMenuTitle = lh.getContent(\"background_script\").context_menu_generate_random_password;\n\tchrome.contextMenus.create({\n\t\ttitle: contextMenuTitle,\n\t\ttype: \"normal\",\n\t\tid: \"fpa_generate_random_password\",\n\t\tcontexts: [\"editable\"]\n\t});\n\n\t//Listen for context menu clicks\n\tchrome.contextMenus.onClicked.addListener(function (info, tab) {\n\t\twriteLine(\"Context menu clicked\");\n\t\twriteLine(info);\n\t\tif (info.menuItemId !== \"fpa_generate_random_password\") return; //Check if our context menu is clicked\n\t\tvar nh = new NetworkHandler();\n\t\tnh.getRandomPassword().then(function (pass) { //Get random password\n\t\t\tchrome.tabs.sendMessage(tab.id, {\"cmd\": \"fpa_set_randomPassword\", \"success\": true, \"value\": pass}); //Send random password to content script\n\t\t}, function (errorMessage) { //Server offline\n\t\t\twriteLine(\"Error occurred: \" + errorMessage);\n\t\t\tchrome.tabs.sendMessage(tab.id, {\"cmd\": \"fpa_set_randomPassword\", \"success\": false}) //Send error to content script\n\t\t});\n\t\t\n\t});\n}","function contextListener() {\n document.addEventListener( \"contextmenu\", function(e) {\n taskItemInContext = clickInsideElement( e, taskItemClassName );\n\n if ( taskItemInContext ) {\n e.preventDefault();\n\n var dataFolderId = 0;\n if(e.target.attributes['data-folder-id'] != undefined) {\n dataFolderId = e.target.attributes['data-folder-id'].value;\n }\n\n var dataFolderName = '';\n if(e.target.attributes['data-folder-name'] != undefined) {\n dataFolderName = e.target.attributes['data-folder-name'].value;\n }\n\n var dataFolderColorId = '';\n if(e.target.attributes['data-folder-color-id'] != undefined) {\n dataFolderColorId = e.target.attributes['data-folder-color-id'].value;\n }\n\n $(\"body .context-menu__link\").each(\n function (index, elem) {\n //Kostyl\n if(dataFolderId == 0) {\n $(elem).css(\"display\",\"none\");\n if($(elem).attr(\"data-action\") == \"Create\") {\n $(elem).css(\"display\",\"block\");\n }\n }\n else\n {\n $(elem).css(\"display\",\"block\");\n }\n\n\n $(elem).attr(\"data-folder-id\", dataFolderId);\n $(elem).attr(\"data-folder-name\", dataFolderName);\n $(elem).attr(\"data-folder-color-id\", dataFolderColorId);\n }\n );\n\n toggleMenuOn();\n positionMenu(e);\n } else {\n taskItemInContext = null;\n toggleMenuOff();\n }\n });\n }","function contextMenuInit() {\n document.addEventListener(\"contextmenu\", function (e) {\n if (clickOnItem(e, settings.element)) {\n e.preventDefault();\n contextMenuOn();\n setContextMenuFitted();\n setContextMenuPosition();\n } else contextMenuOff();\n });\n }","async function focus_menu_tab()\n {\n const tab = await browser.tabs.get(menu_tab_id);\n\n await browser.tabs.update(tab.id, { active: true });\n await browser.windows.update(tab.windowId, { focused: true });\n }","internalShowContextMenu(event) {\n const me = this;\n\n if (me.disabled) {\n return;\n }\n\n const data = me.getDataFromEvent(event);\n\n if (me.shouldShowMenu(data)) {\n me.showContextMenu(data);\n }\n }","function qf(e,t){Pt(e.display,t)||jf(e,t)||Ne(e,t,\"contextmenu\")||e.display.input.onContextMenu(t)}","function setContextualMenu(c){\n\n\t\tvar projection;\n var contextmenuDir;\n \n projection = map.getProjection() ;\n $('.contextualMenu').remove();\n\n //Il me semble intéressant de créer le menu contextuel par code afin de permettre l'animation par exemple dynamiquement.\n contextmenuDir = document.createElement(\"div\");\n contextmenuDir.className = 'contextualMenu';\n var itemHtml = \"\";\n for(var i = 0 ; i<contextualItem.length; i++){\n \titemHtml += \"<a id='\"+contextualItem[i].id+\"' href='#' onClick='\"+contextualItem[i].action+\"'><div class=context>\"+contextualItem[i].title+\"<\\/div><\\/a>\";\n }\n\n contextmenuDir.innerHTML = itemHtml;\n \n // contextmenuDir.innerHTML = \"<a id='menu1'><div class=context>Emplacement par défaut<\\/div><\\/a><a id='menu2' href='#' onClick='\"+contextualItem[0].action+\"'><div class=context>Zoomer ici<\\/div><\\/a>\";\n $(map.getDiv()).append(contextmenuDir);\n \n computeMenuPosition(c);\n\n contextmenuDir.style.visibility = \"visible\";\n\n \n\n}","function ContextMenu() {\n var boundingBox = this.ui = $('<div></div>');\n\n boundingBox.css('position', 'absolute');\n // boundingBox.css('border', '1px solid black');\n boundingBox.css('border-radius', '3px');\n boundingBox.css('background', '#f1f1f1');\n boundingBox.css('z-index', 99);\n var contentBox = $('<div></div>');\n contentBox.css('position', 'relative');\n boundingBox.css('opacity', '0.85');\n\n boundingBox.append(contentBox);\n contentBox.css({\n 'background': '#f1f1f1',\n 'border-radius': '4px',\n 'padding': '4px',\n 'width': '140px'\n });\n // Context Box\n // Remove Label Button \n\n var labelMenuStyle = {\n 'background': '#d3e2ee',\n 'padding': '2px',\n 'font-family': 'Arial',\n 'font-weight': 'bold',\n 'font-size': '12px',\n 'border-radius': '2px',\n // 'margin-top':'3px'\n }\n\n var removeLabelMenu = $('<div></div>');\n removeLabelMenu.text('Remove Label');\n removeLabelMenu.css(labelMenuStyle);\n removeLabelMenu.css('margin-bottom', '3px');\n\n contentBox.append(removeLabelMenu);\n removeLabelMenu.hide();\n\n // Label Property List \n var propertyKeys = Object.keys(validAtomSpecs);\n var propertyList = [];\n var propertyObjectList = [];\n\n propertyKeys.forEach((prop) => {\n var propObj = validAtomSpecs;\n if (propObj[prop].prop === true) {\n propertyList.push(prop);\n }\n });\n\n // Property Menu \n var propertyMenu = $('<div></div>');\n contentBox.append(propertyMenu);\n\n /*\n * Property object used in property menu \n * \n * @function Property \n * @param {String} key Name of the atom property\n * @param {*} value Value of the property \n */\n function Property(key, value) {\n this.row = $('<tr></tr>');\n var propLabelValue = this.control = {\n key: '',\n value: null,\n active: true,\n name: key,\n }\n\n this.key = key;\n this.value = value;\n\n var checkbox = new $3Dmol.UI.Form.Checkbox(propLabelValue);\n var checkboxHolder = $('<td></td>');\n checkboxHolder.append(checkbox.ui);\n var keyHolder = $('<td></td>');\n var separatorHolder = $('<td></td>').text(':');\n var valueHolder = $('<td></td>');\n\n this.row.append(checkboxHolder, keyHolder, separatorHolder, valueHolder);\n\n keyHolder.text(key);\n\n if (typeof (value) == \"number\") {\n valueHolder.text(value.toFixed(2));\n } else {\n valueHolder.text(value.replace(/\\^/g, ''));\n }\n\n console.log('Type of value', typeof (value), value);\n }\n\n /*\n * @param {AtomSpec} atom Value of different property of the atom, if the atom has prop : true\n * then that option is made visible in the context menu\n */\n function setProperties(atom) {\n propertyMenu.empty();\n propertyObjectList = [];\n\n var propertyTable = $('<table></table>');\n\n propertyList.forEach((prop) => {\n var propObj = new Property(prop, atom[prop]);\n propertyTable.append(propObj.row);\n propertyObjectList.push(propObj);\n });\n\n propertyMenu.append(propertyTable);\n\n var labelStyleHolder = $('<div><div>');\n\n var labelStyle = $('<div><div>');\n labelStyle.text('Style');\n labelStyle.css({\n 'display': 'inline-block',\n 'font-family': 'Arial',\n 'font-size': '14px',\n 'margin-right': '6px',\n 'margin-left': '6px'\n });\n\n var stylesForLabel = new $3Dmol.UI.Form.ListInput(labelStyle, Object.keys($3Dmol.labelStyles));\n stylesForLabel.ui.css({\n 'display': 'inline-block'\n });\n\n stylesForLabel.setValue('milk');\n\n labelStyleHolder.append(labelStyle, stylesForLabel.ui);\n propertyMenu.append(labelStyleHolder);\n\n var submit = new button(icons.tick, 18, { backgroundColor: 'lightgreen', tooltip: 'Submit' });\n var cancel = new button(icons.cross, 18, { backgroundColor: 'lightcoral', tooltip: 'Cancel' });\n\n var controlButtons = $('<div></div>');\n controlButtons.append(submit.ui, cancel.ui);\n // controlButtons.css('text-align', 'center');\n\n var alertBox = new AlertBox();\n propertyMenu.append(alertBox.ui);\n\n propertyMenu.append(controlButtons);\n\n\n submit.ui.on('click', () => {\n var props = processPropertyList();\n var labelStyleValidation = stylesForLabel.validate();\n\n if (props != null) {\n if (labelStyleValidation) {\n stateManager.addAtomLabel(props, atom, stylesForLabel.getValue().value);\n stateManager.exitContextMenu(false);\n }\n else {\n alertBox.error('Select style for label');\n }\n }\n else {\n alertBox.error('No value selected for label');\n }\n });\n\n cancel.ui.on('click', () => {\n stateManager.exitContextMenu();\n });\n }\n\n // Previous Labels \n var labelHolder = $('<div></div>');\n contentBox.append(labelHolder);\n\n // Add Menu \n var addMenu = $('<div></div>');\n contentBox.append(addMenu);\n addMenu.css('width', '100%');\n\n var addLabelMenu = $('<div></div>');\n addMenu.append(addLabelMenu);\n\n\n addLabelMenu.text('Add Label');\n addLabelMenu.css(labelMenuStyle);\n addLabelMenu.css('margin-bottom', '3px');\n addLabelMenu.hide();\n\n // Edit Menu\n var editMenu = $('<div></div>');\n contentBox.append(editMenu);\n\n contentBox.css({\n 'position': 'relative',\n });\n\n editMenu.css({\n 'background': '#dfdfdf',\n 'border-radius': '3px',\n 'font-family': 'Arial',\n 'font-weight': 'bold',\n 'font-size': '12px',\n // 'position': 'absolute',\n // 'left' : '105%',\n // 'top' : '0',,\n 'box-sizing': 'border-box',\n 'width': '100%',\n\n });\n editMenu.hide();\n\n var alertBox = new AlertBox({ autohide: false });\n contentBox.append(alertBox.ui);\n\n // Add Label Inputs \n\n /*\n * Generate input elements that are used as form values in the context menu under addLabelForm\n * @returns {Object} that holds different input elements\n */\n function generateAddLabelForm() {\n var addLabelForm = $('<div></div>');\n\n var addLabelValue = {\n text: {\n key: 'Label Text',\n value: null,\n active: true,\n },\n\n style: {\n key: 'Style',\n value: null,\n active: true,\n },\n\n sel: {\n key: 'Selection',\n value: null,\n active: true,\n }\n }\n var formModifierControl = $('<div></div>');\n var removeButton = new button(icons.minus, 16);\n var tick = new button(icons.tick, 16, { backgroundColor: 'lightgreen', tooltip: 'Submit' });\n var cross = new button(icons.cross, 16, { backgroundColor: 'lightcoral', tooltip: 'Cancel' });\n formModifierControl.append(removeButton.ui, tick.ui, cross.ui);\n removeButton.ui.hide();\n addLabelForm.append(formModifierControl);\n\n var addLabelTextBox = $('<div></div>');\n var lt = $('<div></div>').text('Label Text');\n var addLabelTextInput = new $3Dmol.UI.Form.Input(addLabelValue.text);\n addLabelTextBox.append(lt, addLabelTextInput.ui);\n var width = 126//editMenu.innerWidth()*0.8;\n addLabelTextInput.setWidth(width);\n addLabelForm.append(addLabelTextBox);\n\n var addLabelStyleBox = $('<div></div>');\n var ls = $('<div></div>').text('Label Style');\n var addLabelStyleInput = new $3Dmol.UI.Form.ListInput(addLabelValue.style, Object.keys($3Dmol.labelStyles));\n addLabelStyleInput.setValue('milk');\n addLabelStyleBox.append(ls, addLabelStyleInput.ui);\n addLabelForm.append(addLabelStyleBox);\n\n var selectionList = stateManager.getSelectionList();\n\n var addLabelSelectionBox = $('<div></div>');\n var lsl = $('<div></div>').text('Label Selection');\n var addLabelSelectionInput = new $3Dmol.UI.Form.ListInput(addLabelValue.sel, selectionList);\n addLabelSelectionBox.append(lsl, addLabelSelectionInput.ui);\n addLabelForm.append(addLabelSelectionBox);\n\n // CSS \n addLabelForm.css({\n 'padding': '2px',\n\n });\n\n tick.ui.on('click', () => {\n var validate = true;\n\n if (!addLabelStyleInput.validate())\n validate = false;\n\n if (!addLabelTextInput.validate())\n validate = false;\n\n if (!addLabelSelectionInput.validate())\n validate = false;\n\n if (validate) {\n stateManager.addLabel(addLabelValue);\n }\n });\n\n cross.ui.on('click', () => {\n stateManager.exitContextMenu();\n });\n\n removeButton.ui.on('click', () => {\n stateManager.removeLabel()\n });\n\n addLabelForm.on('keyup', (e) => {\n if (e.key == 'Enter') {\n tick.ui.trigger('click');\n }\n });\n\n return {\n boundingBox: addLabelForm,\n text: addLabelTextInput,\n style: addLabelStyleInput,\n selection: addLabelSelectionInput,\n editMode: function () {\n removeButton.ui.show();\n }\n }\n }\n\n\n function processPropertyList() {\n var propsForLabel = {};\n\n propertyObjectList.forEach((propObj) => {\n if (propObj.control.value === true) {\n propsForLabel[propObj.key] = propObj.value;\n }\n });\n\n if (Object.keys(propsForLabel).length != 0) {\n return propsForLabel\n }\n else {\n return null;\n }\n }\n\n // Context Menu UI Funciton \n boundingBox.hide();\n this.hidden = true;\n this.atom = null;\n\n removeLabelMenu.on('click', { atom: this.atom }, function () {\n stateManager.removeAtomLabel(removeLabelMenu.atom);\n });\n\n\n /**\n * Shows the context menu \n * \n * @function ContextMenu#show \n * \n * @param {Number} x x coordinate of the mouse\n * @param {Number} y y coordinate of the mouse in the viewport in pixels\n * @param {AtomSpec} atom Value of the atoms that is selected \n * @param {Boolean} atomExist if atom label is previously added it is set true else false\n */\n this.show = function (x, y, atom, atomExist) {\n\n if (atomExist) {\n removeLabelMenu.show();\n removeLabelMenu.atom = atom;\n }\n else {\n removeLabelMenu.hide();\n removeLabelMenu.atom = null;\n }\n\n alertBox.ui.hide();\n addLabelMenu.hide();\n\n if (stateManager.getSelectionList().length == 0) {\n alertBox.message('Please create selections before adding label');\n } else {\n addLabelMenu.show();\n }\n\n unsetForm();\n setPosition(boundingBox, x, y);\n boundingBox.show();\n this.hidden = false;\n\n if (atom) {\n setProperties(atom);\n this.atom = atom;\n }\n else {\n propertyMenu.empty();\n }\n }\n\n /**\n * Hides the context menu and if needed process the propertyMenu\n * \n * @function ContextMenu#hide\n * @param {Boolean} processContextMenu If true then submission of the property to add label is executed\n */\n\n this.hide = function (processContextMenu) {\n if (processContextMenu) {\n var propsForLabel = processPropertyList();\n if (propsForLabel != null) {\n stateManager.addAtomLabel(propsForLabel, this.atom);\n }\n }\n\n boundingBox.hide();\n this.hidden = true;\n unsetForm();\n }\n\n addLabelMenu.on('click', function () {\n var addLabelMenuForm = generateAddLabelForm();\n setForm(addLabelMenuForm);\n });\n\n function setForm(form) {\n editMenu.children().detach();\n editMenu.append(form.boundingBox);\n editMenu.show();\n }\n\n function unsetForm() {\n editMenu.children().detach();\n editMenu.hide();\n }\n }","function controlsubmenu(tabcontent,tabid) {\n\t\tcloseallmenus();\n\t\tblocknone(tabcontent,tabid,'block','#000000','#ffc','text');\n\t\tactive_tabcontent = tabcontent;\n\t\tactive_tab1 = tabid\n\t}","function updateTabOrder(){var selectedItem=ctrl.tabs[ctrl.selectedIndex],focusItem=ctrl.tabs[ctrl.focusIndex];ctrl.tabs=ctrl.tabs.sort(function(a,b){return a.index-b.index;});ctrl.selectedIndex=ctrl.tabs.indexOf(selectedItem);ctrl.focusIndex=ctrl.tabs.indexOf(focusItem);}","function switchTabs(newTabNum, listItems) {\n if (newTabNum !== curTabNum) {\n switchToTab(newTabNum);\n switchHighlight(newTabNum, listItems);\n\n curTabNum = newTabNum;\n }\n\n // Show new tab, hide old tab\n function switchToTab(newTabNum) {\n var curTab = document.querySelector(\".features-tab\" + curTabNum);\n var newTab = document.querySelector(\".features-tab\" + newTabNum);\n\n // disable current tab and enable selected tab\n\n curTab.style.transition = \"opacity 0.5s\";\n curTab.style.opacity = 0;\n curTab.style.zIndex = 1;\n\n newTab.style.transition = \"opacity 0.2s\";\n newTab.style.opacity = 1;\n newTab.style.zIndex = 2;\n }\n\n // Display new highlight and hide old one in the menu list\n function switchHighlight(newTabNum, listItems) {\n if (newTabNum !== curTabNum) {\n // Get current and new HL objects\n var curListItem = listItems[curTabNum-1];\n var curHL = curListItem.children[0];\n var HLWidth = window.getComputedStyle(curHL).width;\n\n var newListItem = listItems[newTabNum-1];\n var newHL = newListItem.children[0];\n\n // Apply transition effect\n curHL.style.width = 0 + \"px\";\n newHL.style.width = HLWidth;\n }\n }\n}","function addContextMenuButton(id, node, menu, isCase) {\n var buttonWrapper = document.createElement('div');\n buttonWrapper.innerHTML = '<button class=\"btn-more\"><img src=\"/katalon/images/SVG/more-icon.svg\" alt=\"More\" title=\"More\"></button>';\n var button = buttonWrapper.firstChild;\n node.appendChild(button);\n button.addEventListener(\"click\", function(event) {\n if (isCase) {\n setSelectedCase(id);\n } else {\n setSelectedSuite(id);\n }\n var mid = \"#\" + \"menu\" + id;\n $(\".menu\").css(\"left\", event.pageX);\n $(\".menu\").css(\"top\", event.pageY);\n $(mid).show();\n }, false);\n}","function openPage(evt) {\n // Go through all of the content, and hide them.\n var tabcontent = $(\".ms-navigation-dialog__tabcontent\");\n $(tabcontent).hide().removeClass('ms-navigation-dialog__tabcontent--active');\n\n var tab = $(\".ms-navigation-dialog__tab-link--active\");\n $(tab).removeClass('ms-navigation-dialog__tab-link--active');\n $(evt.target).addClass('ms-navigation-dialog__tab-link--active');\n \n // Now display the content for the selectcommand bar item.\n $('#' + evt.target.getAttribute('data-tab')).show().addClass('ms-navigation-dialog__tabcontent--active');\n }","async function focus_menu_tab()\n {\n const tab = await browser.tabs.get(menu_tab_id);\n\n browser.tabs.update(tab.id, { active: true });\n browser.windows.update(tab.windowId, { focused: true });\n }","function applyPrefs()\n {\n // Show/hide page action on all tabs\n browser.tabs.query( {}, tabs => {\n for (let tab of tabs)\n {\n if (prefs.showPageAction)\n browser.pageAction.show( tab.id );\n else\n browser.pageAction.hide( tab.id );\n }\n });\n\n // Create menu for current tab\n browser.tabs.query( {active:true, currentWindow:true}, tabs => {\n digglerBuildMenu( tabs[0].url );\n });\n }","function addChildrenToContextMenu() {\n chrome.storage.local.get(null, function(items) {\n\n if (items.duckDuckGoLink === true) {\n addChildToContextMenu('DuckDuckGo', '');\n }\n if (items.googleLink === true) {\n addChildToContextMenu('Google', '!g');\n }\n if (items.googleImagesLink === true) {\n addChildToContextMenu('Google Images', '!gi');\n }\n if (items.yandexLink === true) {\n addChildToContextMenu('Yandex', '!ya');\n }\n if (items.yandexImagesLink === true) {\n addChildToContextMenu('Yandex Images', '!ymg');\n }\n });\n}","function contextMenuWorkForRecycleBin(action, el, pos) {\r\n\r\n switch (action) {\r\n case \"delete\":\r\n {\r\n var contractTitle = $(el).find(\"#ContractTitle\").text();\r\n var entityid = $(el).find(\"#ContractID\").text();\r\n DeleteContractFromRecycleBin(contractTitle, entityid);\r\n break;\r\n }\r\n case \"viewdetails\":\r\n {\r\n var entityid = $(el).find(\"#ContractID\").text();\r\n location = \"/Contracts/ContractDetails?ContractID=\" + entityid;\r\n break;\r\n }\r\n case \"history\":\r\n {\r\n var contractID = $(el).find(\"#ContractID\").text();\r\n $(\"#hdContractID\").val(contractID);\r\n // $('#ddlHistoryFilter').val('All');\r\n CreateContractActivityList(contractID);\r\n break;\r\n }\r\n }\r\n}","function initEditorContextMenuItems(aEvent)\n{\n var shouldShowEditPage = !gContextMenu.onImage && !gContextMenu.onLink && !gContextMenu.onTextInput && !gContextMenu.inDirList;\n gContextMenu.showItem( \"context-editpage\", shouldShowEditPage );\n\n var shouldShowEditLink = gContextMenu.onSaveableLink; \n gContextMenu.showItem( \"context-editlink\", shouldShowEditLink );\n\n // Hide the applications separator if there's no add-on apps present. \n gContextMenu.showItem(\"context-sep-apps\", gContextMenu.shouldShowSeparator(\"context-sep-apps\"));\n}","updateSoho() {\n this.applicationmenu.updated();\n }","function onContextMenu(e) {\n\tif (e.target && e.target.object && e.target.object instanceof Movable) {\n\t\te.preventDefault();\n\t}\n\tonMouseUp(e);\n}","function createMainMenu() {\n chrome.contextMenus.create({\n id: 'parentMenu',\n title: 'Search \"%s\" on:',\n contexts: ['selection']\n });\n}","function menuOptions() {}","async function open_menu_in_new_tab()\n {\n if (menu_tab_id !== null) { focus_menu_tab(); return; }\n\n const options = await storage.load(storage.Key.Configuration);\n if (options.do_limit_to_private_context)\n {\n const windows = await browser.windows.getAll({ windowTypes: [\"normal\"] });\n const private_window_index = windows.findIndex(window => window.incognito);\n if (private_window_index === -1)\n {\n const new_window = await browser.windows.create({\n incognito: true,\n url: MENU_PAGE_URL\n });\n menu_tab_id = new_window.tabs[0].id;\n }\n else\n {\n const tab = await browser.tabs.create({\n active: true,\n url: MENU_PAGE_URL,\n windowId: windows[private_window_index].id\n });\n menu_tab_id = tab.id;\n }\n }\n else\n {\n const tab = await browser.tabs.create({\n active: true,\n url: MENU_PAGE_URL\n });\n menu_tab_id = tab.id;\n }\n\n function hook()\n {\n browser.tabs.onRemoved.addListener(on_removed);\n browser.tabs.onUpdated.addListener(on_updated);\n events.local.emit(\"menu-tab-hooked\", { id: menu_tab_id });\n }\n function unhook()\n {\n menu_tab_id = null;\n browser.tabs.onRemoved.removeListener(on_removed);\n browser.tabs.onUpdated.removeListener(on_updated);\n events.local.emit(\"menu-tab-unhooked\");\n }\n function on_removed(id) { if (id === menu_tab_id) { unhook(); } }\n function on_updated(id, changes, new_state)\n {\n if (id === menu_tab_id &&\n changes.hasOwnProperty(\"url\") &&\n new_state.url !== MENU_PAGE_URL)\n {\n unhook();\n }\n }\n hook();\n focus_menu_tab();\n }","function showContextMenu()\n{\n chrome.contextMenus.removeAll(function()\n {\n if(typeof localStorage[\"shouldShowBlockElementMenu\"] == \"string\" && localStorage[\"shouldShowBlockElementMenu\"] == \"true\")\n {\n chrome.contextMenus.create({'title': chrome.i18n.getMessage('block_element'), 'contexts': ['image', 'video', 'audio'], 'onclick': function(info, tab)\n {\n if(info.srcUrl)\n chrome.tabs.sendRequest(tab.id, {reqtype: \"clickhide-new-filter\", filter: info.srcUrl});\n }});\n }\n });\n}"],"string":"[\n \"function useContextMenu(tab) {\\n if (addOnPrefs.useContextMenu) {\\n var url = tab.url;\\n var tabId = tab.id;\\n destroyPreviousContextMenu(tabId);\\n var datawakeInfo = storage.getDatawakeInfo(tabId);\\n contextMenus[tabId] = contextMenu.Menu({\\n label: \\\"Datawake Menu: \\\" + datawakeInfo.domain.name,\\n contentScriptFile: data.url(\\\"js/datawake/selections.js\\\"),\\n context: contextMenu.URLContext(url),\\n items: [\\n contextMenu.Item({ label: \\\"Capture Selection\\\", data: \\\"selection\\\", context: contextMenu.SelectionContext()}),\\n contextMenu.Item({ label: \\\"Tag a feature\\\", data: \\\"feedback\\\", context: contextMenu.SelectionContext()}),\\n contextMenu.Separator(),\\n contextMenu.Item({ label: \\\"Hide Selections\\\", data: \\\"hide\\\"}),\\n contextMenu.Item({ label: \\\"Show Selections\\\", data: \\\"highlight\\\"}),\\n\\n\\n ],\\n onMessage: function (message) {\\n var tabId = tabs.activeTab.id;\\n var datawakeInfo = storage.getDatawakeInfo(tabId);\\n switch (message.intent) {\\n case \\\"highlight\\\":\\n highlightAllTextOnPage(tabId, datawakeInfo);\\n break;\\n case \\\"selection\\\":\\n saveWindowSelection(datawakeInfo, tabs.activeTab.url, message.text);\\n break;\\n case \\\"feedback\\\":\\n saveFeedback(message.text, tabs.activeTab.url, datawakeInfo);\\n break;\\n case \\\"hide\\\":\\n hideSelections(\\\"selections\\\");\\n break;\\n case \\\"geolocate\\\":\\n geolocateWindowSelection(message.text);\\n break;\\n }\\n }\\n });\\n }\\n}\",\n \"function modifyEventContextMenu() {\\n displayEventEditWindow();\\n}\",\n \"function handleContextMenu(info, tab) {\\n //store selected text\\n selectedText = info.selectionText;\\n //open new tab to create issue \\n openMainPage(\\\"/new_issue\\\");\\n}\",\n \"function tabContextMenuonClick(info, tab) {\\n var query = {\\n currentWindow: true\\n };\\n chrome.tabs.query(query, function (tabs) {\\n var tabsData = Array();\\n for (tab in tabs) {\\n tab = parseInt(tab);\\n if (typeof tab === \\\"number\\\") {\\n var url = tabs[tab]['url'];\\n var title = tabs[tab]['title'];\\n if (url.startsWith('http')) {\\n var tabData = {'url': url, 'title': title};\\n tabsData.push(tabData);\\n }\\n else {\\n\\n }\\n }\\n }\\n chrome.storage.sync.get([\\\"useremail\\\", \\\"userkey\\\"], function (items) {\\n if (typeof items.useremail !== 'undefined') {\\n require(['/libs/superagent.min.js'], function (request) {\\n request\\n .post(baseUrl + \\\"tabs/add\\\")\\n .send({\\n email: encodeURIComponent(items.useremail),\\n apikey: encodeURIComponent(items.userkey),\\n tabs: encodeURIComponent(JSON.stringify(tabsData))\\n })\\n .end(function (err, res) {\\n if (err === null) {\\n chrome.tabs.create({url: 'http://localhost:5000/manager/tabs/new?id=' + res.body.id});\\n }\\n });\\n });\\n }\\n });\\n });\\n}\",\n \"function onClickedContextMenuHandler (info, tab) {\\n let bnId = info.bookmarkId;\\n//console.log(\\\"menu item clicked on <\\\"+bnId+\\\"> with contexts=\\\"+info.contexts+\\\" menuIds=\\\"+info.menuIds+\\\" menuItemId=\\\"+info.menuItemId+\\\" pageUrl=\\\"+info.pageUrl+\\\" targetElementId=\\\"+info.targetElementId+\\\" viewType=\\\"+info.viewType+\\\" tab=\\\"+tab);\\n if (myMenu_open // This sidebar instance is the one which opened the context menu\\n\\t && ((info.viewType == \\\"sidebar\\\") || (info.viewType == \\\"tab\\\")) // Context menu inside of sidebar or insde BSP2 in a tab\\n\\t && (bnId != undefined) && (bnId.length > 0)\\n\\t ) {\\n\\t// Retrieve the clicked menu action\\n\\tlet menuItemId = info.menuItemId;\\n\\tlet pos = menuItemId.indexOf(\\\"-\\\");\\n\\tlet menuAction = menuItemId.substring(0, pos);\\n\\tswitch (menuAction) {\\n\\t case \\\"bsp2show\\\":\\n\\t\\t// Show bookmark item in main pane\\n\\t\\tmenuShow(bnId);\\n\\t\\tbreak;\\n\\t case \\\"bsp2open\\\":\\n\\t\\t// Open in tab\\n\\t\\tmenuOpen(curRowList[bnId], INTAB);\\n\\t\\tbreak;\\n\\t case \\\"bsp2opentab\\\":\\n\\t\\t// Open in new tab\\n\\t\\tmenuOpen(curRowList[bnId], NEWTAB);\\n\\t\\tbreak;\\n\\t case \\\"bsp2openwin\\\":\\n\\t\\t// Open in new window\\n\\t\\tmenuOpen(curRowList[bnId], NEWWIN);\\n\\t\\tbreak;\\n\\t case \\\"bsp2openpriv\\\":\\n\\t\\t// Open in private window\\n\\t\\tmenuOpen(curRowList[bnId], NEWPRIVWIN);\\n\\t\\tbreak;\\n\\t case \\\"bsp2openall\\\":\\n\\t\\t// Open all bookmarks in folder\\n\\t let is_shiftKey = (info.modifiers.indexOf(\\\"Shift\\\") != -1);\\n\\t\\tmenuOpenAllInTabs(bnId, is_shiftKey);\\n\\t\\tbreak;\\n\\t case \\\"bsp2opentree\\\":\\n\\t\\t// Open parent folder of the .reshidden row\\n\\t\\topenResParents(curRowList[bnId]);\\n\\t\\tbreak;\\n\\t case \\\"bsp2goparent\\\":\\n\\t\\t// Show parent of the row\\n\\t\\tgoParent(curRowList[bnId]);\\n\\t\\tbreak;\\n\\t case \\\"bsp2newbtab\\\":\\n\\t\\t// Bookmark current tab here\\n\\t\\tmenuNewBkmkItem(bnId, NEWBCURTAB, (info.modifiers.indexOf(\\\"Ctrl\\\") >= 0));\\n\\t\\tbreak;\\n\\t case \\\"bsp2newb\\\":\\n\\t\\t// New bookmark\\n\\t\\tmenuNewBkmkItem(bnId, NEWB);\\n\\t\\tbreak;\\n\\t case \\\"bsp2newf\\\":\\n\\t\\t// New folder\\n\\t\\tmenuNewBkmkItem(bnId, NEWF);\\n\\t\\tbreak;\\n\\t case \\\"bsp2news\\\":\\n\\t\\t// New separator\\n\\t\\tmenuNewBkmkItem(bnId, NEWS);\\n\\t\\tbreak;\\n\\t case \\\"bsp2cut\\\":\\n\\t\\t// Cut selection to clipboard\\n\\t\\tif (isResultMenu) { // A results table menu\\n\\t\\t menuCutBkmkItem(rselection);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t menuCutBkmkItem(selection);\\n\\t\\t}\\n\\t\\tbreak;\\n\\t case \\\"bsp2copy\\\":\\n\\t\\t// Copy selection to clipboard\\n\\t\\tif (isResultMenu) { // A results table menu\\n\\t\\t menuCopyBkmkItem(rselection);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t menuCopyBkmkItem(selection);\\n\\t\\t}\\n\\t\\tbreak;\\n\\t case \\\"bsp2paste\\\":\\n\\t\\t// Paste clipboard before current bookmark\\n\\t\\tmenuPasteBkmkItem(bnId, false);\\n\\t\\tbreak;\\n\\t case \\\"bsp2pasteinto\\\":\\n\\t\\t// Paste clipboard into current folder\\n\\t\\tmenuPasteBkmkItem(bnId, true);\\n\\t\\tbreak;\\n\\t case \\\"bsp2del\\\":\\n\\t\\t// Delete selected bookmark item(s)\\n\\t\\tmenuDelBkmkItem(selection);\\n\\t\\tbreak;\\n\\t case \\\"bsp2sort\\\":\\n\\t\\t// Sort folder content\\n\\t\\tsendAddonMessage(\\\"sort:\\\"+bnId);\\n\\t\\tbreak;\\n\\t case \\\"bsp2refreshfav\\\":\\n\\t\\t// Refresh favicon\\n\\t\\tmenuRefreshFav(bnId);\\n\\t\\tbreak;\\n\\t case \\\"bsp2collapseall\\\":\\n\\t\\t// Close folder and all subfolders\\n\\t\\tcollapseAll(bnId, curRowList[bnId]);\\n\\t\\tbreak;\\n\\t case \\\"bsp2expandall\\\":\\n\\t\\t// Open folder and all subfolders\\n\\t\\texpandAll(bnId, curRowList[bnId]);\\n\\t\\tbreak;\\n\\t case \\\"bsp2prop\\\":\\n\\t\\t// Show properties\\n\\t\\tmenuProp(bnId);\\n\\t\\tbreak;\\n\\t}\\n }\\n}\",\n \"function ContextMenuAction(info, tab){\\n\\n //We loop through all existing tags. For each one, check if this link has it or not, and show/hide the tick accordingly\\n for (i=0; i<existingTags.length; i++){\\n \\n ctxtmenuID = (\\\"id-\\\" + existingTags[i]); //e.g. \\\"id-seen\\\" is the id of the context menu that toggles tag \\\"seen\\\"\\n \\n if (info.menuItemId === ctxtmenuID) { //Was this the clicked context menu item?\\n\\n //Get url of right-clicked item\\n if (info.linkUrl) url = info.linkUrl; //Context menu opened on a link\\n else if (info.pageUrl) url = info.pageUrl; //Context menu opened on current page (anywhere on its background)\\n else return; //Clicked something else -> We have no url to check, stop here. Just in case, shouldn't happen.\\n\\n url = normalizeUrl(url);\\n ToggleTagInLocalStorage(url, existingTags[i], tab);\\n }\\n }\\n\\n}\",\n \"function refreshContextMenu() {\\n chrome.contextMenus.removeAll();\\n createMainMenu();\\n addChildrenToContextMenu();\\n}\",\n \"function handleInstall(){\\n var context = \\\"selection\\\";\\n var title = \\\"Clip this...\\\";\\n var id = chrome.contextMenus.create({\\\"title\\\": title, \\\"contexts\\\":[context],\\n \\\"id\\\": \\\"context\\\" + context}); \\n}\",\n \"beforeContextMenuShow() {}\",\n \"beforeContextMenuShow() {}\",\n \"update () {\\n this.tray.setContextMenu(this.contextMenu)\\n }\",\n \"function updateContextMenus() {\\n chrome.tabs.query({ lastFocusedWindow: true, active: true },\\n function(tabs) {\\n var pagetype;\\n var contexts = new Array();\\n\\n if (chrome.runtime.lastError == null && typeof tabs[0] != \\\"undefined\\\" && tabs[0].url != \\\"about:blank\\\") /* tab not closed or about:blank */ {\\n pagetype = (typeof tabPageTypes[tabs[0].id] == \\\"undefined\\\") ? 0 : tabPageTypes[tabs[0].id];\\n\\n contexts = showSubmenu ? [\\\"all\\\"] : [\\\"browser_action\\\"];\\n\\n if (!specialPage(tabs[0].url) && tabs[0].status == \\\"complete\\\") {\\n chrome.contextMenus.update(\\\"basicitems\\\", { contexts: contexts, enabled: (pagetype <= 1) });\\n chrome.contextMenus.update(\\\"standarditems\\\", { contexts: contexts, enabled: (pagetype <= 1) });\\n chrome.contextMenus.update(\\\"customitems\\\", { contexts: contexts, enabled: (pagetype <= 1) });\\n chrome.contextMenus.update(\\\"viewpageinfo\\\", { contexts: contexts, enabled: (pagetype >= 1) });\\n\\n if (pagetype == 2) chrome.contextMenus.update(\\\"removeresourceloader\\\", { contexts: contexts, enabled: true });\\n else chrome.contextMenus.update(\\\"removeresourceloader\\\", { contexts: [\\\"page_action\\\"], enabled: false });\\n\\n if (pagetype >= 1) chrome.contextMenus.update(\\\"extractmedia\\\", { contexts: [\\\"image\\\", \\\"audio\\\", \\\"video\\\"], enabled: true });\\n else chrome.contextMenus.update(\\\"extractmedia\\\", { contexts: [\\\"page_action\\\"], enabled: false });\\n } else {\\n chrome.contextMenus.update(\\\"basicitems\\\", { contexts: contexts, enabled: false });\\n chrome.contextMenus.update(\\\"standarditems\\\", { contexts: contexts, enabled: false });\\n chrome.contextMenus.update(\\\"customitems\\\", { contexts: contexts, enabled: false });\\n chrome.contextMenus.update(\\\"viewpageinfo\\\", { contexts: contexts, enabled: false });\\n chrome.contextMenus.update(\\\"removeresourceloader\\\", { contexts: [\\\"page_action\\\"], enabled: false });\\n chrome.contextMenus.update(\\\"extractmedia\\\", { contexts: [\\\"page_action\\\"], enabled: false });\\n }\\n }\\n });\\n}\",\n \"function updateTabs() {\\n getCurrentWindowTabs().then((tabs) => {\\n tabCountInWindowTitle(tabs);\\n for (let tab of tabs) {\\n var tabIdtoString = tab.id.toString();\\n\\n if (tab.favIconUrl !=undefined){\\n var favIconUrltoString = tab.favIconUrl.toString(); \\n //console.log(favIconUrltoString + \\\" favIconUrltoString\\\") \\n }else{\\n var favIconUrltoString = \\\"logos/clearfavicon.png\\\";\\n //console.log(favIconUrltoString + \\\" favIconUrltoString\\\") \\n }\\n tab.title = \\\"&\\\" + tab.title;\\n if(tab.active){tab.title =tab.title + \\\" ~#~\\\"; console.log(\\\"tab active \\\" + tab.id);}\\n\\n browser.menus.update(tabIdtoString,{\\n \\\"icons\\\": {\\n \\\"16\\\": favIconUrltoString\\n },\\n title: tab.title\\n });\\n }\\n });\\n}\",\n \"function updateContextMenus()\\n{\\n if (prefs.debug)\\n console.log(\\\"URL Link updating context menus\\\");\\n\\n // Menus required\\n wantUrlMenu = false; /// isUrl;\\n wantTxtMenu = true; /// (!isUrl || prefs.forcesubmenu);\\n\\n // Any change at all?\\n if (wantUrlMenu === currentUrlMenu && wantTxtMenu === currentTxtMenu && !menuChanged)\\n return;\\n\\n // In order to keep menu ordering the same, we have to always delete and re-create our menus (if they've changed).\\n menusDeleting = 0;\\n if (currentUrlMenu)\\n {\\n // Delete old URL menus\\n currentUrlMenu = false;\\n browserMenusRemove( \\\"open-selected-url-in-new-tab\\\" );\\n browserMenusRemove( \\\"open-selected-url\\\" );\\n browserMenusRemove( \\\"main-menu-separator\\\" );\\n browserMenusRemove( \\\"main-menu-help\\\" );\\n browserMenusRemove( \\\"main-menu-changelog\\\" );\\n browserMenusRemove( \\\"main-menu-prefs\\\" );\\n }\\n if (currentTxtMenu)\\n {\\n // Delete old text menus\\n currentTxtMenu = false;\\n removeContextMenuItems( \\\"open-selection-in-new-tab\\\" );\\n removeContextMenuItems( \\\"open-selection\\\" );\\n browserMenusRemove( \\\"main-menu-separator\\\" );\\n browserMenusRemove( \\\"main-menu-help\\\" );\\n browserMenusRemove( \\\"main-menu-changelog\\\" );\\n browserMenusRemove( \\\"main-menu-prefs\\\" );\\n }\\n\\n // Await all deletions before recreating\\n if (menusDeleting === 0)\\n createContextMenus();\\n}\",\n \"updateContextMenu(saveCleanFiles) {\\n const title = (saveCleanFiles) ? 'contextMenuScanAndDownloadTitle' : 'contextMenuScanTitle';\\n if (contextMenus[MCL_CONFIG.contextMenu.scanId]) {\\n chrome.contextMenus.update(MCL_CONFIG.contextMenu.scanId, {\\n title: chrome.i18n.getMessage(title)\\n }); \\n }\\n }\",\n \"async function updateContextMenu() {\\n try {\\n await browser.contextMenus.removeAll();\\n\\n let defaultValues = {};\\n\\n for (let contextMenuItem of [\\n { id: 'RestoreTree', title: settings.customRestoreTreeContextMenuLabel, contexts: ['bookmark'] },\\n { id: 'BookmarkTree', title: settings.customBookmarkTreeContextMenuLabel, contexts: ['tab'], enabled: settings.hasTabContextMenu },\\n ]) {\\n let { id, title, contexts, enabled = true, isDefaults = false } = typeof contextMenuItem === 'string' ? { id: contextMenuItem } : contextMenuItem;\\n if (!enabled) {\\n continue;\\n }\\n if (isDefaults) {\\n Object.assign(defaultValues, contextMenuItem);\\n return;\\n }\\n\\n let details = {\\n contexts: contexts || defaultValues.contexts,\\n };\\n if (id.startsWith('-')) {\\n Object.assign(details, {\\n type: 'separator',\\n });\\n } else {\\n Object.assign(details, {\\n id: id,\\n title: title || browser.i18n.getMessage(`contextMenu_${id}`),\\n });\\n }\\n await browser.contextMenus.create(details);\\n }\\n } catch (error) {\\n return false;\\n }\\n return true;\\n}\",\n \"function onClickedContextMenuHandler (info, tab) {\\r\\n let menuItemId = info.menuItemId;\\r\\n//console.log(\\\"menuItemId = \\\"+menuItemId);\\r\\n if (menuItemId == SubMenuPathId) {\\r\\n//console.log(\\\"SubMenuPathId clicked\\\");\\r\\n\\tlet bnId = info.bookmarkId;\\r\\n\\tlet BN = curBNList[bnId];\\r\\n\\topenPropPopup(\\\"prop\\\", bnId, BN_path(BN.parentId), BN.type, BN.title, BN.url);\\r\\n }\\r\\n else\\r\\n if (menuItemId == BAOpenTabId) {\\r\\n//console.log(\\\"BAOpenTabId clicked, tab id = \\\"+tab.id);\\r\\n\\t// Open BSP2 in new tab, referred by this tab to come back to it when closing\\r\\n\\topenBsp2NewTab(tab);\\r\\n }\\r\\n else if (menuItemId == BAShowInSidebar) {\\r\\n//console.log(\\\"Show \\\"+lastMenuBnId+\\\" in BSP2 sidebar\\\");\\r\\n\\tif (lastMenuBnId != undefined) {\\r\\n\\t let windowId = tab.windowId;\\r\\n\\t // Can't use browser.sidebarAction.isOpen() here, as this is waiting for a Promise,\\r\\n\\t // and so when it arrives we are not anymore in the code flow of a user action, so\\r\\n\\t // the browser.sidebarAction.close() and browser.sidebarAction.open() are not working :-(\\r\\n\\t // => Have to track state through other mechanisms to not rely on Promises ...\\r\\n\\t if (isSidebarOpen[windowId] == true) { // Already open\\r\\n\\t\\tpanelShowBookmark(windowId, tab.id, lastMenuBnId);\\r\\n\\t }\\r\\n\\t else {\\r\\n\\t\\tbrowser.sidebarAction.open()\\r\\n\\t\\t.then(panelShowBookmark(windowId, tab.id, lastMenuBnId));\\r\\n\\t }\\r\\n\\t}\\r\\n }\\r\\n else if (menuItemId == BAHistory) {\\r\\n\\t// Open Bookmark history window\\r\\n\\topenBsp2History();\\r\\n }\\r\\n else if (menuItemId == BAOptionsId) {\\r\\n\\t// Open BSP2 options\\r\\n\\tbrowser.runtime.openOptionsPage();\\r\\n }\\r\\n}\",\n \"function refreshContextMenu() {\\n clearTimeout(refreshContextMenuTimer);\\n refreshContextMenuTimer = setTimeout(doRefreshContextMenu, 150);\\n }\",\n \"function xcustom_onContextMenu(event) {\\r\\n console.log('there we are...');\\r\\n}\",\n \"function createContextMenus(){\\n chrome.contextMenus.removeAll();\\n // Add parent context menus\\n chrome.contextMenus.create({\\n title: \\\"Mazii - Notification Action\\\",\\n id: \\\"parent\\\",\\n contexts:[\\\"link\\\", \\\"selection\\\"]\\n });\\n // Add child context menu\\n chrome.contextMenus.create({\\n title: \\\"Follow this post\\\",\\n parentId: \\\"parent\\\",\\n contexts:[\\\"link\\\", \\\"selection\\\"],\\n onclick: function(info, tab) {\\n let linkUrl = info.linkUrl;\\n saveNewLinkUrl(linkUrl);\\n }\\n });\\n}\",\n \"toggleMenu(context) {\\n context.commit('toggleMenu');\\n }\",\n \"_updateHAXCEMenu() {\\n this._ceMenu.ceButtons = [\\n {\\n icon: this.locked ? \\\"icons:lock\\\" : \\\"icons:lock-open\\\",\\n callback: \\\"haxClickInlineLock\\\",\\n label: \\\"Toggle Lock\\\",\\n },\\n {\\n icon: this.published ? \\\"lrn:view\\\" : \\\"lrn:view-off\\\",\\n callback: \\\"haxClickInlinePublished\\\",\\n label: \\\"Toggle published\\\",\\n },\\n {\\n icon: \\\"editor:format-indent-increase\\\",\\n callback: \\\"haxIndentParent\\\",\\n label: \\\"Move under parent page break\\\",\\n disabled: !pageBreakManager.getParent(this, \\\"indent\\\"),\\n },\\n {\\n icon: \\\"editor:format-indent-decrease\\\",\\n callback: \\\"haxOutdentParent\\\",\\n label: \\\"Move out of parent page break\\\",\\n disabled: !pageBreakManager.getParent(this, \\\"outdent\\\"),\\n },\\n ];\\n }\",\n \"function TabContextMenu(props) {\\n const [appState,] = useContext(AppContext);\\n const [layoutState,] = useContext(LayoutContext);\\n\\n const isTicketShared = ({event, props}) => {\\n let tickets = appState.tickets.filter(t => t.id === props.tabid && !t.parent);\\n return tickets.length === 0;\\n };\\n\\n const duplicateTicket = (originalTicketid, tabName) => {\\n appState.actions.duplicateticket(originalTicketid, (ticketid) => {\\n appState.actions.activateTicket(ticketid, tabName);\\n // update tickets, so ticket list is renewed\\n appState.actions.updateTickets();\\n })\\n };\\n\\n // Executes when user selects action in tab's name context menu\\n const onTabContextMenuAction = (event, props, action) => {\\n // When menu is clicked, it is over other element and we need to stop\\n // propagation, otherwise it conflicts with other events\\n event.stopPropagation();\\n\\n switch (action) {\\n case \\\"reconnect\\\":\\n layoutState.actions.refreshTab(props.tabid);\\n break;\\n case \\\"share\\\":\\n appState.actions.openModal({type: ShareTicketModal, data: {id: props.tabid, name: props.name}});\\n break;\\n case \\\"disconnect\\\":\\n layoutState.actions.deleteTab(props.tabid);\\n break;\\n case \\\"duplicate\\\":\\n duplicateTicket(props.tabid, props.name);\\n break;\\n case \\\"screenSize\\\":\\n layoutState.actions.updateTabScreenSize(props.tabid, props.screenSize);\\n break;\\n default:\\n window.alert(\\\"Wrong action: \\\" + action)\\n }\\n };\\n\\n return (\\n <Menu animation=\\\"fade\\\" id=\\\"tab_context_menu\\\" theme=\\\"dark\\\">\\n <Item\\n onClick={({event, props}) => onTabContextMenuAction(event, props, \\\"reconnect\\\")}>Reconnect</Item>\\n <Separator/>\\n <Item disabled={isTicketShared}\\n onClick={({event, props}) => onTabContextMenuAction(event, props, \\\"share\\\")}>Share</Item>\\n <Separator/>\\n <Item disabled={isTicketShared}\\n onClick={({event, props}) => onTabContextMenuAction(event, props, \\\"duplicate\\\")}>Duplicate</Item>\\n <Separator/>\\n <Item\\n onClick={({event, props}) => onTabContextMenuAction(event, props, \\\"disconnect\\\")}>Close</Item>\\n <Submenu label=\\\"Screen size\\\">\\n <Item onClick={({event, props}) => onTabContextMenuAction(event, {\\n ...props,\\n screenSize: null\\n }, \\\"screenSize\\\")}>Auto</Item>\\n {SCREEN_SIZES.map(size =>\\n <Item onClick={({event, props}) => onTabContextMenuAction(event, {\\n ...props,\\n screenSize: {width: size[0], height: size[1]}\\n }, \\\"screenSize\\\")}>{size[0]} x {size[1]}</Item>\\n )\\n }\\n </Submenu>\\n </Menu>\\n );\\n}\",\n \"function refreshIconAndContextMenu(tab)\\n{\\n // The tab could have been closed by the time this function is called\\n if(!tab)\\n return;\\n\\n var excluded = isWhitelisted(tab.url);\\n var iconFilename = excluded ? \\\"icons/abp-19-whitelisted.png\\\" : \\\"icons/abp-19.png\\\";\\n\\n if (activeNotification)\\n startIconAnimation(tab, iconFilename);\\n else\\n chrome.pageAction.setIcon({tabId: tab.id, path: iconFilename});\\n\\n // Only show icon for pages we can influence (http: and https:)\\n if(/^https?:/.test(tab.url))\\n {\\n chrome.pageAction.setTitle({tabId: tab.id, title: \\\"Adblock Plus\\\"});\\n if (\\\"shouldShowIcon\\\" in localStorage && localStorage[\\\"shouldShowIcon\\\"] == \\\"false\\\")\\n chrome.pageAction.hide(tab.id);\\n else\\n chrome.pageAction.show(tab.id);\\n\\n // Set context menu status according to whether current tab has whitelisted domain\\n if (excluded)\\n chrome.contextMenus.removeAll();\\n else\\n showContextMenu();\\n }\\n}\",\n \"function delegate_to(tab_id)\\n {\\n menu_tab_id = tab_id;\\n browser.browserAction.setPopup({ popup: \\\"\\\" });\\n browser.browserAction.onClicked.addListener(focus_menu_tab);\\n }\",\n \"function checkboxOnClick(info, tab) {\\n\\tconsole.log(JSON.stringify(info));\\n\\tvar parent = chrome.contextMenus.create({\\\"title\\\": \\\"aux\\\"});\\n\\nfor (var i = 6; i < 8; i++) {\\n\\tvar context = \\\"selection\\\";\\n var thatit = titles[i];\\n var deei = chrome.contextMenus.create({\\\"title\\\": thatit,\\\"parentId\\\": parent, \\\"onclick\\\": process});\\n idz[i] = deei;\\n\\tconsole.log(\\\"'\\\" + context + \\\"' item:\\\" + idz[i]);\\n }\\n }\",\n \"function setup_menu() {\\n $('div[data-role=\\\"arrayitem\\\"]').contextMenu('context-menu1', {\\n 'remove item': {\\n click: remove_item,\\n klass: \\\"menu-item-1\\\" // a custom css class for this menu item (usable for styling)\\n },\\n }, menu_options);\\n $('div[data-role=\\\"prop\\\"]').contextMenu('context-menu2', {\\n 'remove item': {\\n click: remove_item,\\n klass: \\\"menu-item-1\\\" // a custom css class for this menu item (usable for styling)\\n },\\n }, menu_options);\\n }\",\n \"function contextMenu(e){\\r\\n\\tprintln(\\\"context\\\");\\r\\n\\treturn false;\\r\\n}\",\n \"function showUIActionContext(event) {\\n if (!g_user.hasRole(\\\"ui_action_admin\\\"))\\n return;\\n var element = Event.element(event);\\n if (element.tagName.toLowerCase() == \\\"span\\\")\\n element = element.parentNode;\\n var id = element.getAttribute(\\\"gsft_id\\\");\\n var mcm = new GwtContextMenu('context_menu_action_' + id);\\n mcm.clear();\\n mcm.addURL(getMessage('Edit UI Action'), \\\"sys_ui_action.do?sys_id=\\\" + id, \\\"gsft_main\\\");\\n contextShow(event, mcm.getID(), 500, 0, 0);\\n Event.stop(event);\\n}\",\n \"function createContextMenu() {\\n if (localStorage['sunjer_option_contextMenu'] === 'true') {\\n contextMenuId = chrome.contextMenus.create({\\n title: \\\"sunjer\\\",\\n contexts: ['all']\\n });\\n\\t\\t\\n chrome.contextMenus.create({\\n title: \\\"Style Element\\\",\\n contexts: ['all'],\\n onclick: function() {\\n sendRequestToCurrentTab(\\\"openWidget\\\");\\n },\\n parentId: contextMenuId\\n });\\n\\t\\t\\n contextMenuStatusId = chrome.contextMenus.create({\\n title: \\\"Toggle styling\\\",\\n contexts: ['all'],\\n onclick: function() {\\n sendRequestToCurrentTab(\\\"toggleStyle\\\");\\n },\\n parentId: contextMenuId\\n });\\n\\t\\t\\n chrome.contextMenus.create({\\n title: \\\"Search for styles...\\\",\\n contexts: ['all'],\\n onclick: function() {\\n sendRequestToCurrentTab(\\\"searchSocial\\\");\\n },\\n parentId: contextMenuId\\n });\\n }\\n}\",\n \"updateSelectedTab ({ commit }, tab) {\\n commit('SET_NEW_TAB', tab)\\n }\",\n \"contextMenu(x, y, _isLeftButton) {}\",\n \"function destroyPreviousContextMenu(tabId) {\\n if (contextMenus.hasOwnProperty(tabId))\\n contextMenus[tabId].destroy();\\n}\",\n \"function cleanUpTab(tabId) {\\n destroyPreviousContextMenu(tabId);\\n}\",\n \"_setContextMenu() {\\n this.dom.contextMenu.config = new PopContextMenuConfig();\\n this.dom.setSubscriber('context-menu', this.dom.contextMenu.config.emitter.subscribe((event) => {\\n this.log.event(`context-menu`, event);\\n this.events.emit(event);\\n }));\\n }\",\n \"function postContextMenuWork(data, textStatus, jqXHR, param) {\\n\\teditBulkInProgress = true;\\n\\tshowPreview();\\n\\teditBulkInProgress = false;\\n}\",\n \"translateContextMenu() {\\n if (this.contextMenuExtension && this.contextMenuExtension.translateContextMenu) {\\n this.contextMenuExtension.translateContextMenu();\\n }\\n }\",\n \"updateItems(e) {\\n this.__tabs = this.querySelectorAll(\\\"a11y-tab\\\");\\n this.__hasIcons = true;\\n if (!this.id) this.id = this._generateUUID();\\n if (this.__tabs && this.__tabs.length > 0)\\n this.__tabs.forEach((tab, index) => {\\n if (!tab.icon) this.__hasIcons = false;\\n tab.order = index + 1;\\n tab.total = this.__tabs.length;\\n });\\n this.selectTab(this.activeTab);\\n }\",\n \"function onClickHandler(info, tab) {\\n\\tvar itemId = info.menuItemId;\\n\\tvar context = itemId.split('_', 1)[0];\\n\\t\\n\\tswitch (context) {\\n\\t\\tcase 'selection':\\n\\t\\t\\tif (info.selectionText.length > 0) {\\n\\t\\t\\t\\tconsole.log(JSON.stringify(info.selectionText));\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\tdefault:\\n\\t\\t\\tconsole.log('Other context than selection');\\n\\t}\\n\\t\\n\\n}\",\n \"function rightClickMenu(ctx) {\\n window.rightClickCtx = ctx\\n $(fitStrechBtn).text(\\n window\\n .references[ctx.target.id]\\n .data.metadata.ratio === 'fit' ? \\n 'Strech ratio' : 'Fit ratio'\\n )\\n\\n $(contextMenu).css({\\n 'top': `${ctx.pageY - 15}px`, \\n 'left': `${ctx.pageX + 15}px`\\n }).show();\\n ctx.preventDefault();\\n}\",\n \"function contextualMenuItems( item, view ) {\\n}\",\n \"onAfterContextMenuShow() {\\n const contextMenu = this.hot.getPlugin('contextMenu');\\n const data = contextMenu.menu.hotMenu.getData();\\n\\n // find position of 'copy' option.\\n arrayEach(data, (item, index) => {\\n if (item.key === 'copy') {\\n let zeroClipboardInstance = new ZeroClipboard(contextMenu.menu.hotMenu.getCell(index, 0));\\n\\n zeroClipboardInstance.off();\\n zeroClipboardInstance.on('copy', (event) => {\\n let clipboard = event.clipboardData;\\n\\n clipboard.setData('text/plain', this.getCopyValue());\\n this.hot.getSettings().outsideClickDeselects = this.outsideClickDeselectsCache;\\n });\\n\\n // hide copy/paste btn when error, edit by xp 2015.12.15\\n zeroClipboardInstance.on('error', (function(){\\n let $menuItems = $('.htContextMenu tbody tr');\\n $($menuItems[0]).hide();\\n $($menuItems[1]).hide();\\n $('.htSeparator').first().hide();\\n }));\\n\\n return false;\\n }\\n });\\n }\",\n \"function onContextMenu_Item(event, mEdit, mCopy, callbackEvent, callbackWindow, jaloPk, webroot) {\\r\\n\\tvar element = getMenuHTMLElement();\\r\\n\\tshowCMSMenu( element, event);\\r\\n\\taddItemLinks(element, mEdit, mCopy, callbackEvent, callbackWindow, jaloPk, webroot);\\r\\n\\tevent.cancelBubble=true;\\r\\n\\treturn false;\\r\\n}\",\n \"function setMenuContext(options) {\\n this.hType = options.hType;\\n this.hNum = options.hNum;\\n setMenuPosition.call(this, options.target);\\n }\",\n \"initContextMenu() {\\n this.menu = new D3NE.ContextMenu(this._contextMenuData);\\n }\",\n \"function detachContextMenus() {\\n $(\\\".graph .node\\\").unbind(\\\"contextmenu\\\"); \\n }\",\n \"function contextMenu(browserWindow){\\n cm({\\n browserWindow,\\n \\n prepend: (params) => [\\n {\\n role: 'reload',\\n enabled: params.isEditable === false,\\n visible: params.isEditable === false\\n },\\n {\\n role: 'undo',\\n enabled: params.isEditable && params.editFlags.canUndu,\\n visible: params.isEditable\\n },\\n {\\n role: 'redo',\\n enabled: params.isEditable && params.editFlags.canRedo,\\n visible: params.isEditable\\n }\\n ],\\n append: (params) => [\\n {\\n role: 'delete',\\n enabled: params.isEditable && params.editFlags.canDelete,\\n visible: params.isEditable\\n },\\n {\\n role: 'selectall',\\n enabled: params.isEditable && params.editFlags.canSelectAll,\\n visible: params.isEditable\\n }\\n ],\\n\\n showInspectElement: false\\n });\\n}\",\n \"function PivotContextMenu(parent){/* eslint-enable */this.parent=parent;this.parent.contextMenuModule=this;}\",\n \"function detachContextMenus() {\\n $('.graph .node').unbind('contextmenu');\\n }\",\n \"function setToolTab() {\\n\\tvar toolTabTitle = $('[data-tool-tab-title]');\\n\\tvar toolTabContent = $('[data-tool-tab-content]');\\n\\t\\ttoolTabContent.attr('hidden', true); // hide all\\n\\t\\t$('[data-tool-tab]').removeClass('active'); // reset active\\n\\n\\t\\t// loop all tab content\\n\\t\\ttoolTabContent.each(function(){\\n\\t\\t\\tvar $this = $(this);\\n\\t\\t\\tvar stringId = $this.attr('data-tool-tab-content'); // Eg. 'design', 'development' etc\\n\\n\\t\\t\\t// Choose Tab based on URL Hashbang\\n\\t\\t\\t// if level1: settings OR if level2: site\\n\\t\\t\\tif (stringId == getHashBang().level1 || stringId == getHashBang().level2) {\\n\\t\\t\\t\\t$this.removeAttr('hidden'); // show selected\\n\\t\\t\\t\\t$('[data-tool-tab*=\\\"'+stringId+'\\\"]').addClass('active'); // mark active\\n\\n\\t\\t\\t\\t// Don't let [site, docs] change title = always parent title (Development)\\n\\t\\t\\t\\tif (stringId == getHashBang().level1) {\\n\\t\\t\\t\\t\\ttoolTabTitle.text(stringId + \\\" \\\"); // space to remove glitch\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t// Funky gradient on header\\n\\t\\tapplyGradientHeader('.lv-context-menu-header .subheader');\\n}\",\n \"viewImageInNewTab()\\r\\n {\\r\\n document.getElementById(\\\"context-viewimage\\\")\\r\\n .setAttribute(\\\"oncommand\\\", `openTrustedLinkIn(gContextMenu.imageURL, \\\"tab\\\")`);\\r\\n }\",\n \"function doOpen(e) {\\n $.win.invalidateOptionsMenu();\\n}\",\n \"function options(evt, opName) {\\n var i, tabcontent, tablinks;\\n tabcontent = document.getElementsByClassName(\\\"tabcontent\\\");\\n for (i = 0; i < tabcontent.length; i++) {\\n tabcontent[i].style.display = \\\"none\\\";\\n }\\n tablinks = document.getElementsByClassName(\\\"tablinks\\\");\\n for (i = 0; i < tablinks.length; i++) {\\n tablinks[i].className = tablinks[i].className.replace(\\\" active\\\", \\\"\\\");\\n }\\n document.getElementById(opName).style.display = \\\"block\\\";\\n evt.currentTarget.className += \\\" active\\\";\\n}\",\n \"function onContextClick(info, tab) {\\n chrome.tabs.remove(tab.id);\\n}\",\n \"function loadMenuItems () {\\n chrome.contextMenus.removeAll(function () {\\n console.log(\\\"clear all context items\\\")\\n });\\n\\n chrome.storage.sync.get(null, function(items) {\\n var allKeys = Object.keys(items);\\n console.log(\\\"adding context items\\\")\\n\\n allKeys.forEach(function (key) {\\n var menuId = chrome.contextMenus.create({\\n \\\"title\\\" : key,\\n \\\"type\\\" : \\\"normal\\\",\\n \\\"contexts\\\" : [\\\"image\\\"],\\n \\\"onclick\\\" : getClickHandler()\\n });\\n mapInfo[menuId] = key;\\n })\\n });\\n\\n // default one\\n chrome.contextMenus.create({\\n \\\"title\\\" : \\\"New ChainId\\\",\\n \\\"type\\\" : \\\"normal\\\",\\n \\\"contexts\\\" : [\\\"image\\\"],\\n \\\"onclick\\\" : getNewChainClickHandler()\\n });\\n}\",\n \"function ShowExtensionItemInContextMenu(youtuberHref, titleContextMenu) {\\r\\n\\tvar message = { context: \\\"CreateContextMenu\\\", showContextMenus: \\\"true\\\", \\\"youtuberHref\\\": youtuberHref, title: titleContextMenu };\\r\\n\\t// console.log(\\\"hiden element by RMB\\\");\\r\\n\\t// console.log(videoElement);\\r\\n\\tSendMessageToBackgroundScript(message);\\r\\n}\",\n \"function DeMakaMenuClick(info, tab) {\\n chrome.tabs.query({\\n \\\"active\\\": true,\\n \\\"currentWindow\\\": true\\n }, function (tabs) {\\n chrome.tabs.sendMessage(tabs[0].id, {\\n \\\"functiontoInvoke\\\": \\\"undoMAKA\\\"\\n });\\n });\\n}\",\n \"function ContextMenu ( ) {\\n\\tthis.Menu = window.createPopup();\\n\\t\\t\\n\\tthis.currentHeight = 0;\\n\\tthis.increment = 15;\\n\\tthis.delay=2;\\n}\",\n \"function ContextMenuClickHandler() {\\n $(settings.menuSelector)\\n .off('click')\\n .on('click', function(e) {\\n $(this).hide();\\n\\n var $invokedOn = $(this).data(\\\"invokedOn\\\");\\n var $selectedMenu = $(e.target);\\n\\n settings.menuSelected.call($(this), $invokedOn, $selectedMenu);\\n });\\n\\n }\",\n \"reloadActions(actions = this.actions) {\\n if (this.menu.children.length > 0) {\\n this.menu.innerHTML = \\\"\\\";\\n }\\n var styling = document.createElement(\\\"style\\\");\\n styling.innerHTML = `\\n div.ion_contextMenu{\\n position: absolute;\\n max-width: 256px;\\n background: #1b1b1b;\\n color: white;\\n border-style: solid;\\n border-width: 2px;\\n border-color: white;\\n z-index: 10000;\\n }\\n\\n div.ion_menuEntry{\\n padding: 4px;\\n user-select: none;\\n }\\n\\n div.ion_menuEntry[checked]{\\n /* background-color: lightgreen; */\\n }\\n\\n div.ion_menuEntry:hover{\\n background: #5b5b5b;\\n cursor: pointer;\\n }\\n\\n div.ion_menuEntry.ion_label{\\n text-align: center;\\n }\\n \\n div.ion_menuEntry.ion_label:hover{\\n background: #1b1b1b;\\n cursor: not-allowed;\\n }\\n\\n div.ion_menuEntry div.checkboxTick{\\n width: 18px;\\n height: 18px;\\n border-radius: 20px;\\n background-color: white;\\n opacity: 0.75;\\n float: right;\\n }\\n\\n div.ion_menuEntry[checked] div.checkboxTick{\\n background-color: lightgreen;\\n opacity: 1;\\n }\\n `;\\n\\n this.menu.appendChild(styling);\\n\\n var inst = this;\\n for (let i = 0; i < actions.length; i++) {\\n const action = actions[i];\\n const div = document.createElement(\\\"div\\\");\\n div.className = \\\"ion_menuEntry\\\";\\n div.innerHTML = action.name;\\n \\n if (action.type && action.type == \\\"checkbox\\\") {\\n if (action.checked) {\\n div.toggleAttribute(\\\"checked\\\", true);\\n }\\n const cBox = document.createElement(\\\"div\\\");\\n cBox.className = \\\"checkboxTick\\\";\\n \\n div.appendChild(cBox);\\n\\n div.title = \\\"\\\\\\\"\\\"+action.name+\\\"\\\\\\\" is \\\"+div.hasAttribute(\\\"checked\\\")+\\\".\\\";\\n }\\n\\n if (typeof action.click == \\\"function\\\") {\\n div.onclick = function(e) {\\n action.click(e, inst.reference, e.target);\\n if (action.type == \\\"checkbox\\\") {\\n div.toggleAttribute(\\\"checked\\\");\\n div.title = \\\"\\\\\\\"\\\"+action.name+\\\"\\\\\\\" is \\\"+div.hasAttribute(\\\"checked\\\")+\\\".\\\";\\n }\\n inst.hide();\\n };\\n }\\n else {\\n div.classList.add([\\\"ion_label\\\"]);\\n div.style.borderBottomStyle = \\\"solid\\\";\\n div.style.borderBottomWidth = \\\"1px\\\";\\n div.style.borderBottomColor = \\\"#3b3b3b\\\";\\n\\n div.style.borderTopStyle = \\\"solid\\\";\\n div.style.borderTopWidth = \\\"1px\\\";\\n }\\n\\n if (typeof action.runOnThis == \\\"function\\\") {\\n action.runOnThis(div);\\n }\\n\\n this.menu.appendChild(div);\\n }\\n }\",\n \"function onPrefChange(prefName) {\\n menu.items = createMenuItems();\\n}\",\n \"function context_menu(params,event) {\\n\\tel=document.getElementById(\\\"cm\\\");\\n\\to=event.srcElement;\\n\\tx=event.clientX+document.documentElement.scrollLeft+document.body.scrollLeft;\\n\\ty=event.clientY+document.documentElement.scrollTop+document.body.scrollTop;\\n\\tel.innerHTML='';\\n\\tfor (k in params) {\\n\\t//if params[k]=='space' then draw line (separator)\\n\\t\\tif (params[k]=='space') { el.innerHTML+='<hr size=1>';\\n\\t//if menu item is disabled\\n\\t\\t} else if (params[k][\\\"disabled\\\"]) { el.innerHTML+='<a class=\\\"cm_gray\\\" href=\\\"\\\" onclick=\\\"return false;\\\" title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";\\n\\t//if current window is not opened in frame\\n\\t\\t} else if (params[k][\\\"frame\\\"]==\\\"off\\\") { if (window.frameElement==\\\"[object HTMLFrameElement]\\\") { el.innerHTML+='<a class=\\\"cm_black\\\" href=\\\"\\\"'+\\\"onclick=\\\"+'window.open('+\\\"'\\\"+params[k][\\\"href\\\"]+\\\"','','statusbar,menubar,location'); return false;\\\"+'\\\" title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";} else { el.innerHTML+='<a class=\\\"cm_black\\\" href=\\\"\\\"'+\\\"onclick=\\\"+'window.open('+\\\"'\\\"+params[k][\\\"href\\\"]+\\\"','','statusbar,menubar,location');return false;\\\"+'\\\" title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";}\\n\\t//if current window must be opened in frame\\n\\t\\t} else if (params[k][\\\"frame\\\"]==\\\"on\\\") { el.innerHTML+='<a class=\\\"cm_black\\\" href=\\\"\\\"'+'onclick='+\\\"parent\\\"+params[k][\\\"taget\\\"]+\\\".location.href='\\\"+params[k][\\\"href\\\"]+\\\"' return false;\\\"+' title=\\\"'+params[k][\\\"title\\\"]+'\\\" onmouseover=\\\"window.status=this.title;return true;\\\" onmouseout=\\\"window.status="" ;return true;\\\"> '+params[k][\\\"value\\\"]+\\\"</a><br>\\\";}\\n\\t}\\n\\tel.style.visibility=\\\"visible\\\";\\n\\tel.style.display=\\\"block\\\";\\n\\theight=el.scrollHeight-20;\\n\\tif (window.opera) height+=30;//stupid opera...\\n\\tif (event.clientY+height>document.body.clientHeight) { y-=height+14 } else { y-=2 }\\n\\tel.style.left=x+\\\"px\\\";\\n\\tel.style.top=y+\\\"px\\\";\\n\\tel.style.visibility=\\\"hidden\\\";\\n\\tel.style.display=\\\"none\\\";\\n\\tel.style.visibility=\\\"visible\\\";\\n\\tel.style.display=\\\"block\\\";\\n\\tevent.returnValue=false;\\n}\",\n \"function setMenu() {\\n //添加快捷键\\n\\tlet applicationOptions = [\\n\\t\\t{ label: \\\"About Kungfu\\\", click: showKungfuInfo},\\n\\t\\t{ label: \\\"Settings\\\", accelerator: \\\"CmdOrCtrl+,\\\", click: openSettingDialog },\\n\\t\\t{ label: \\\"Close\\\", accelerator: \\\"CmdOrCtrl+W\\\", click: function() { console.log(BrowserWindow.getFocusedWindow().close()); }}\\n\\t]\\n\\n\\tif(platform === 'mac') {\\n\\t\\tapplicationOptions.push(\\n\\t\\t\\t{ label: \\\"Quit\\\", accelerator: \\\"Command+Q\\\", click: function() { app.quit(); }},\\n\\t\\t)\\n\\t}\\n\\n\\tconst template = [\\n\\t{\\n\\t\\tlabel: \\\"Kungfu\\\",\\n\\t\\tsubmenu: applicationOptions\\n\\t}, \\n\\t{\\n\\t\\tlabel: \\\"Edit\\\",\\n\\t\\tsubmenu: [\\n\\t\\t\\t{ label: \\\"Copy\\\", accelerator: \\\"CmdOrCtrl+C\\\", selector: \\\"copy:\\\" },\\n\\t\\t\\t{ label: \\\"Paste\\\", accelerator: \\\"CmdOrCtrl+V\\\", selector: \\\"paste:\\\" },\\n\\t\\t]\\n\\t}];\\n\\t\\n\\tMenu.setApplicationMenu(Menu.buildFromTemplate(template))\\n}\",\n \"function DeMamaMenuClick(info, tab) {\\n chrome.tabs.query({\\n \\\"active\\\": true,\\n \\\"currentWindow\\\": true\\n }, function (tabs) {\\n chrome.tabs.sendMessage(tabs[0].id, {\\n \\\"functiontoInvoke\\\": \\\"undoMAMA\\\"\\n });\\n });\\n}\",\n \"function deleteEventContextMenu() {\\n confirmDeleteEvents();\\n}\",\n \"function change_tab_content()\\n{\\n $('.pages-icons').removeClass(\\\"current\\\");\\n $(this).addClass('current');\\n}\",\n \"function changeTab(event){\\n let tabs = document.getElementsByClassName('tab');\\n for(i=0; i <tabs.length;i++){\\n tabs[i].classList.remove(\\\"active\\\");\\n }\\n event.target.parentNode.classList+= \\\" active\\\";\\n let selelectedtab = event.target.innerHTML;\\n let contenttab = document.getElementById('myTabContent');\\n let contents = menuobject[selelectedtab];\\n contenttab.innerHTML = \\\"\\\";\\n for(key in contents){\\n let newbutton = document.createElement('button');\\n newbutton.className = \\\"col-lg-2 col-md-2 col-xs-4 btn contentbtn\\\";\\n newbutton.innerHTML = key;\\n newbutton.addEventListener('click',foodbtnclick);\\n contenttab.appendChild(newbutton);\\n }\\n}\",\n \"onRightClick() {\\n const menuConfig = Menu.buildFromTemplate([\\n {\\n label: 'Quit',\\n click: () => app.quit()\\n }\\n ]);\\n this.popUpContextMenu(menuConfig);\\n }\",\n \"function tabClicked(tab) {\\n $('#'+currentList).removeClass('defaulttab'); // Remove the defaulttab class from the currentlist\\n currentList = $(tab).attr('id'); // Set the currentlist to the new list\\n $('#'+currentList).addClass('defaulttab'); // Add the defaulttab class to the new (current) list\\n redrawTodosUI(); // Redraw the ToDos, as the list has changed\\n }\",\n \"function openMenu(event, menuName) {\\n // hide all elements with class=\\\"tabContent\\\"\\n const tabContent = document.getElementsByClassName(\\\"tabContent\\\")\\n for (let i = 0; i < tabContent.length; i++) {\\n tabContent[i].style.display = \\\"none\\\"\\n }\\n\\n // Remove 'active' class from all elements with the class=\\\"tablink\\\"\\n const tablink = document.getElementsByClassName(\\\"tablink\\\")\\n for (let i = 0; i < tablink.length; i++) {\\n tablink[i].className = tablink[i].className.replace(\\\" active\\\", \\\"\\\")\\n }\\n\\n // Show current tab and add \\\"active\\\" class to the button that opened the tab\\n document.getElementById(menuName).style.display = \\\"block\\\"\\n event.currentTarget.className += \\\" active\\\"\\n \\n}\",\n \"function updateCommand(element, context) {\\n var typed = element.querySelector('.gcli-help-command').textContent;\\n context.update(typed);\\n}\",\n \"function setContextMenuAttribs() {\\n\\t\\t\\tvar exportList = chart.exportDivElements;\\n\\t\\t\\tif (exportList) {\\n\\t\\t\\t\\t// Set tabindex on the menu items to allow focusing by script\\n\\t\\t\\t\\t// Set role to give screen readers a chance to pick up the contents\\n\\t\\t\\t\\tfor (var i = 0; i < exportList.length; ++i) {\\n\\t\\t\\t\\t\\tif (exportList[i].tagName === 'DIV' &&\\n\\t\\t\\t\\t\\t\\t!(exportList[i].children && exportList[i].children.length)) {\\n\\t\\t\\t\\t\\t\\texportList[i].setAttribute('role', 'menuitem');\\n\\t\\t\\t\\t\\t\\texportList[i].setAttribute('tabindex', -1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Set accessibility properties on parent div\\n\\t\\t\\t\\texportList[0].parentNode.setAttribute('role', 'menu');\\n\\t\\t\\t\\texportList[0].parentNode.setAttribute('aria-label', 'Chart export');\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function handleContextMenu(event) {\\n\\tconsole.log(\\\"Contextual Menu\\\");\\n\\tconsole.log( event.target.nodeName.toLowerCase() );\\n\\tif ( event.target.nodeName.toLowerCase() != \\\"a\\\" ) {\\n\\t\\t//\\tGet disabling to work and add on/off preference for this feature\\n\\t\\t// safari.self.tab.dispatchMessage(\\\"disable\\\", true);\\n\\t\\tsafari.self.tab.dispatchMessage(\\\"getLink\\\", document.URL);\\n\\t\\tconsole.log(document.URL);\\n\\t} else {\\n\\t\\tsafari.self.tab.dispatchMessage(\\\"getLink\\\", event.target.href);\\n\\t\\tconsole.log(event.target.href);\\t//\\tFor debugging\\n\\t}\\n}\",\n \"function main_menu_tab_change_to_etc() {\\n\\t$('#main-menu-tab li a').removeClass('select');\\n\\t$('#main-menu-etc-tab').addClass('select');\\n\\n\\t$(\\\"#main-menu-search\\\").css(\\\"display\\\",\\\"none\\\");\\n\\t$(\\\"#main-menu-etc\\\").css(\\\"display\\\",\\\"block\\\");\\n}\",\n \"setupContextMenu(saveCleanFiles) {\\n const title = (saveCleanFiles) ? 'contextMenuScanAndDownloadTitle' : 'contextMenuScanTitle';\\n return chrome.contextMenus.removeAll(() => {\\n const menuId = chrome.contextMenus.create({\\n id: MCL_CONFIG.contextMenu.scanId,\\n title: chrome.i18n.getMessage(title),\\n contexts: ['link', 'image', 'video', 'audio']\\n });\\n contextMenus[menuId] = menuId;\\n });\\n }\",\n \"function loadPagesTableContextMenu() {\\n try {\\n $.contextMenu({\\n selector: '.pages-main-panel .pages-main-table > tbody > tr > td span.column-field-page-option',\\n trigger: 'left',\\n callback: function(key, options) { \\n switch(key) {\\n case \\\"edit\\\":\\n $(this).closest('td').find('a').trigger('click');\\n break;\\n case \\\"copy\\\": \\n // \\n break;\\n case \\\"delete\\\": \\n // \\n break;\\n default : \\n // \\n break;\\n }\\n },\\n items: {\\n \\\"edit\\\": {\\n name: \\\"Edit\\\",\\n icon: 'menu-rename',\\n disabled: function(key, opt) { \\n if(!hasWriteAccess()){\\n return true;\\n }\\n return false;\\n }\\n },\\n \\\"copy\\\": {\\n name: \\\"Copy\\\",\\n icon: 'menu-copy',\\n disabled: function(key, opt) {\\n if(!hasWriteAccess()){\\n return true;\\n }\\n return false;\\n }\\n },\\n \\\"delete\\\": {\\n name: \\\"Delete\\\",\\n icon: 'menu-delete',\\n disabled: function(key, opt) {\\n if(!hasWriteAccess()){\\n return true;\\n }\\n return false;\\n }\\n }\\n }\\n });\\n } catch (error) {\\n displayLibraryCatchError('context-menu');\\n return false;\\n }\\n}\",\n \"function setupContextMenu() {\\n\\t//Add the context menu to chrome\\n\\tvar content = lh.getContent(\\\"background_script\\\");\\n\\tvar contextMenuTitle = lh.getContent(\\\"background_script\\\").context_menu_generate_random_password;\\n\\tchrome.contextMenus.create({\\n\\t\\ttitle: contextMenuTitle,\\n\\t\\ttype: \\\"normal\\\",\\n\\t\\tid: \\\"fpa_generate_random_password\\\",\\n\\t\\tcontexts: [\\\"editable\\\"]\\n\\t});\\n\\n\\t//Listen for context menu clicks\\n\\tchrome.contextMenus.onClicked.addListener(function (info, tab) {\\n\\t\\twriteLine(\\\"Context menu clicked\\\");\\n\\t\\twriteLine(info);\\n\\t\\tif (info.menuItemId !== \\\"fpa_generate_random_password\\\") return; //Check if our context menu is clicked\\n\\t\\tvar nh = new NetworkHandler();\\n\\t\\tnh.getRandomPassword().then(function (pass) { //Get random password\\n\\t\\t\\tchrome.tabs.sendMessage(tab.id, {\\\"cmd\\\": \\\"fpa_set_randomPassword\\\", \\\"success\\\": true, \\\"value\\\": pass}); //Send random password to content script\\n\\t\\t}, function (errorMessage) { //Server offline\\n\\t\\t\\twriteLine(\\\"Error occurred: \\\" + errorMessage);\\n\\t\\t\\tchrome.tabs.sendMessage(tab.id, {\\\"cmd\\\": \\\"fpa_set_randomPassword\\\", \\\"success\\\": false}) //Send error to content script\\n\\t\\t});\\n\\t\\t\\n\\t});\\n}\",\n \"function contextListener() {\\n document.addEventListener( \\\"contextmenu\\\", function(e) {\\n taskItemInContext = clickInsideElement( e, taskItemClassName );\\n\\n if ( taskItemInContext ) {\\n e.preventDefault();\\n\\n var dataFolderId = 0;\\n if(e.target.attributes['data-folder-id'] != undefined) {\\n dataFolderId = e.target.attributes['data-folder-id'].value;\\n }\\n\\n var dataFolderName = '';\\n if(e.target.attributes['data-folder-name'] != undefined) {\\n dataFolderName = e.target.attributes['data-folder-name'].value;\\n }\\n\\n var dataFolderColorId = '';\\n if(e.target.attributes['data-folder-color-id'] != undefined) {\\n dataFolderColorId = e.target.attributes['data-folder-color-id'].value;\\n }\\n\\n $(\\\"body .context-menu__link\\\").each(\\n function (index, elem) {\\n //Kostyl\\n if(dataFolderId == 0) {\\n $(elem).css(\\\"display\\\",\\\"none\\\");\\n if($(elem).attr(\\\"data-action\\\") == \\\"Create\\\") {\\n $(elem).css(\\\"display\\\",\\\"block\\\");\\n }\\n }\\n else\\n {\\n $(elem).css(\\\"display\\\",\\\"block\\\");\\n }\\n\\n\\n $(elem).attr(\\\"data-folder-id\\\", dataFolderId);\\n $(elem).attr(\\\"data-folder-name\\\", dataFolderName);\\n $(elem).attr(\\\"data-folder-color-id\\\", dataFolderColorId);\\n }\\n );\\n\\n toggleMenuOn();\\n positionMenu(e);\\n } else {\\n taskItemInContext = null;\\n toggleMenuOff();\\n }\\n });\\n }\",\n \"function contextMenuInit() {\\n document.addEventListener(\\\"contextmenu\\\", function (e) {\\n if (clickOnItem(e, settings.element)) {\\n e.preventDefault();\\n contextMenuOn();\\n setContextMenuFitted();\\n setContextMenuPosition();\\n } else contextMenuOff();\\n });\\n }\",\n \"async function focus_menu_tab()\\n {\\n const tab = await browser.tabs.get(menu_tab_id);\\n\\n await browser.tabs.update(tab.id, { active: true });\\n await browser.windows.update(tab.windowId, { focused: true });\\n }\",\n \"internalShowContextMenu(event) {\\n const me = this;\\n\\n if (me.disabled) {\\n return;\\n }\\n\\n const data = me.getDataFromEvent(event);\\n\\n if (me.shouldShowMenu(data)) {\\n me.showContextMenu(data);\\n }\\n }\",\n \"function qf(e,t){Pt(e.display,t)||jf(e,t)||Ne(e,t,\\\"contextmenu\\\")||e.display.input.onContextMenu(t)}\",\n \"function setContextualMenu(c){\\n\\n\\t\\tvar projection;\\n var contextmenuDir;\\n \\n projection = map.getProjection() ;\\n $('.contextualMenu').remove();\\n\\n //Il me semble intéressant de créer le menu contextuel par code afin de permettre l'animation par exemple dynamiquement.\\n contextmenuDir = document.createElement(\\\"div\\\");\\n contextmenuDir.className = 'contextualMenu';\\n var itemHtml = \\\"\\\";\\n for(var i = 0 ; i<contextualItem.length; i++){\\n \\titemHtml += \\\"<a id='\\\"+contextualItem[i].id+\\\"' href='#' onClick='\\\"+contextualItem[i].action+\\\"'><div class=context>\\\"+contextualItem[i].title+\\\"<\\\\/div><\\\\/a>\\\";\\n }\\n\\n contextmenuDir.innerHTML = itemHtml;\\n \\n // contextmenuDir.innerHTML = \\\"<a id='menu1'><div class=context>Emplacement par défaut<\\\\/div><\\\\/a><a id='menu2' href='#' onClick='\\\"+contextualItem[0].action+\\\"'><div class=context>Zoomer ici<\\\\/div><\\\\/a>\\\";\\n $(map.getDiv()).append(contextmenuDir);\\n \\n computeMenuPosition(c);\\n\\n contextmenuDir.style.visibility = \\\"visible\\\";\\n\\n \\n\\n}\",\n \"function ContextMenu() {\\n var boundingBox = this.ui = $('<div></div>');\\n\\n boundingBox.css('position', 'absolute');\\n // boundingBox.css('border', '1px solid black');\\n boundingBox.css('border-radius', '3px');\\n boundingBox.css('background', '#f1f1f1');\\n boundingBox.css('z-index', 99);\\n var contentBox = $('<div></div>');\\n contentBox.css('position', 'relative');\\n boundingBox.css('opacity', '0.85');\\n\\n boundingBox.append(contentBox);\\n contentBox.css({\\n 'background': '#f1f1f1',\\n 'border-radius': '4px',\\n 'padding': '4px',\\n 'width': '140px'\\n });\\n // Context Box\\n // Remove Label Button \\n\\n var labelMenuStyle = {\\n 'background': '#d3e2ee',\\n 'padding': '2px',\\n 'font-family': 'Arial',\\n 'font-weight': 'bold',\\n 'font-size': '12px',\\n 'border-radius': '2px',\\n // 'margin-top':'3px'\\n }\\n\\n var removeLabelMenu = $('<div></div>');\\n removeLabelMenu.text('Remove Label');\\n removeLabelMenu.css(labelMenuStyle);\\n removeLabelMenu.css('margin-bottom', '3px');\\n\\n contentBox.append(removeLabelMenu);\\n removeLabelMenu.hide();\\n\\n // Label Property List \\n var propertyKeys = Object.keys(validAtomSpecs);\\n var propertyList = [];\\n var propertyObjectList = [];\\n\\n propertyKeys.forEach((prop) => {\\n var propObj = validAtomSpecs;\\n if (propObj[prop].prop === true) {\\n propertyList.push(prop);\\n }\\n });\\n\\n // Property Menu \\n var propertyMenu = $('<div></div>');\\n contentBox.append(propertyMenu);\\n\\n /*\\n * Property object used in property menu \\n * \\n * @function Property \\n * @param {String} key Name of the atom property\\n * @param {*} value Value of the property \\n */\\n function Property(key, value) {\\n this.row = $('<tr></tr>');\\n var propLabelValue = this.control = {\\n key: '',\\n value: null,\\n active: true,\\n name: key,\\n }\\n\\n this.key = key;\\n this.value = value;\\n\\n var checkbox = new $3Dmol.UI.Form.Checkbox(propLabelValue);\\n var checkboxHolder = $('<td></td>');\\n checkboxHolder.append(checkbox.ui);\\n var keyHolder = $('<td></td>');\\n var separatorHolder = $('<td></td>').text(':');\\n var valueHolder = $('<td></td>');\\n\\n this.row.append(checkboxHolder, keyHolder, separatorHolder, valueHolder);\\n\\n keyHolder.text(key);\\n\\n if (typeof (value) == \\\"number\\\") {\\n valueHolder.text(value.toFixed(2));\\n } else {\\n valueHolder.text(value.replace(/\\\\^/g, ''));\\n }\\n\\n console.log('Type of value', typeof (value), value);\\n }\\n\\n /*\\n * @param {AtomSpec} atom Value of different property of the atom, if the atom has prop : true\\n * then that option is made visible in the context menu\\n */\\n function setProperties(atom) {\\n propertyMenu.empty();\\n propertyObjectList = [];\\n\\n var propertyTable = $('<table></table>');\\n\\n propertyList.forEach((prop) => {\\n var propObj = new Property(prop, atom[prop]);\\n propertyTable.append(propObj.row);\\n propertyObjectList.push(propObj);\\n });\\n\\n propertyMenu.append(propertyTable);\\n\\n var labelStyleHolder = $('<div><div>');\\n\\n var labelStyle = $('<div><div>');\\n labelStyle.text('Style');\\n labelStyle.css({\\n 'display': 'inline-block',\\n 'font-family': 'Arial',\\n 'font-size': '14px',\\n 'margin-right': '6px',\\n 'margin-left': '6px'\\n });\\n\\n var stylesForLabel = new $3Dmol.UI.Form.ListInput(labelStyle, Object.keys($3Dmol.labelStyles));\\n stylesForLabel.ui.css({\\n 'display': 'inline-block'\\n });\\n\\n stylesForLabel.setValue('milk');\\n\\n labelStyleHolder.append(labelStyle, stylesForLabel.ui);\\n propertyMenu.append(labelStyleHolder);\\n\\n var submit = new button(icons.tick, 18, { backgroundColor: 'lightgreen', tooltip: 'Submit' });\\n var cancel = new button(icons.cross, 18, { backgroundColor: 'lightcoral', tooltip: 'Cancel' });\\n\\n var controlButtons = $('<div></div>');\\n controlButtons.append(submit.ui, cancel.ui);\\n // controlButtons.css('text-align', 'center');\\n\\n var alertBox = new AlertBox();\\n propertyMenu.append(alertBox.ui);\\n\\n propertyMenu.append(controlButtons);\\n\\n\\n submit.ui.on('click', () => {\\n var props = processPropertyList();\\n var labelStyleValidation = stylesForLabel.validate();\\n\\n if (props != null) {\\n if (labelStyleValidation) {\\n stateManager.addAtomLabel(props, atom, stylesForLabel.getValue().value);\\n stateManager.exitContextMenu(false);\\n }\\n else {\\n alertBox.error('Select style for label');\\n }\\n }\\n else {\\n alertBox.error('No value selected for label');\\n }\\n });\\n\\n cancel.ui.on('click', () => {\\n stateManager.exitContextMenu();\\n });\\n }\\n\\n // Previous Labels \\n var labelHolder = $('<div></div>');\\n contentBox.append(labelHolder);\\n\\n // Add Menu \\n var addMenu = $('<div></div>');\\n contentBox.append(addMenu);\\n addMenu.css('width', '100%');\\n\\n var addLabelMenu = $('<div></div>');\\n addMenu.append(addLabelMenu);\\n\\n\\n addLabelMenu.text('Add Label');\\n addLabelMenu.css(labelMenuStyle);\\n addLabelMenu.css('margin-bottom', '3px');\\n addLabelMenu.hide();\\n\\n // Edit Menu\\n var editMenu = $('<div></div>');\\n contentBox.append(editMenu);\\n\\n contentBox.css({\\n 'position': 'relative',\\n });\\n\\n editMenu.css({\\n 'background': '#dfdfdf',\\n 'border-radius': '3px',\\n 'font-family': 'Arial',\\n 'font-weight': 'bold',\\n 'font-size': '12px',\\n // 'position': 'absolute',\\n // 'left' : '105%',\\n // 'top' : '0',,\\n 'box-sizing': 'border-box',\\n 'width': '100%',\\n\\n });\\n editMenu.hide();\\n\\n var alertBox = new AlertBox({ autohide: false });\\n contentBox.append(alertBox.ui);\\n\\n // Add Label Inputs \\n\\n /*\\n * Generate input elements that are used as form values in the context menu under addLabelForm\\n * @returns {Object} that holds different input elements\\n */\\n function generateAddLabelForm() {\\n var addLabelForm = $('<div></div>');\\n\\n var addLabelValue = {\\n text: {\\n key: 'Label Text',\\n value: null,\\n active: true,\\n },\\n\\n style: {\\n key: 'Style',\\n value: null,\\n active: true,\\n },\\n\\n sel: {\\n key: 'Selection',\\n value: null,\\n active: true,\\n }\\n }\\n var formModifierControl = $('<div></div>');\\n var removeButton = new button(icons.minus, 16);\\n var tick = new button(icons.tick, 16, { backgroundColor: 'lightgreen', tooltip: 'Submit' });\\n var cross = new button(icons.cross, 16, { backgroundColor: 'lightcoral', tooltip: 'Cancel' });\\n formModifierControl.append(removeButton.ui, tick.ui, cross.ui);\\n removeButton.ui.hide();\\n addLabelForm.append(formModifierControl);\\n\\n var addLabelTextBox = $('<div></div>');\\n var lt = $('<div></div>').text('Label Text');\\n var addLabelTextInput = new $3Dmol.UI.Form.Input(addLabelValue.text);\\n addLabelTextBox.append(lt, addLabelTextInput.ui);\\n var width = 126//editMenu.innerWidth()*0.8;\\n addLabelTextInput.setWidth(width);\\n addLabelForm.append(addLabelTextBox);\\n\\n var addLabelStyleBox = $('<div></div>');\\n var ls = $('<div></div>').text('Label Style');\\n var addLabelStyleInput = new $3Dmol.UI.Form.ListInput(addLabelValue.style, Object.keys($3Dmol.labelStyles));\\n addLabelStyleInput.setValue('milk');\\n addLabelStyleBox.append(ls, addLabelStyleInput.ui);\\n addLabelForm.append(addLabelStyleBox);\\n\\n var selectionList = stateManager.getSelectionList();\\n\\n var addLabelSelectionBox = $('<div></div>');\\n var lsl = $('<div></div>').text('Label Selection');\\n var addLabelSelectionInput = new $3Dmol.UI.Form.ListInput(addLabelValue.sel, selectionList);\\n addLabelSelectionBox.append(lsl, addLabelSelectionInput.ui);\\n addLabelForm.append(addLabelSelectionBox);\\n\\n // CSS \\n addLabelForm.css({\\n 'padding': '2px',\\n\\n });\\n\\n tick.ui.on('click', () => {\\n var validate = true;\\n\\n if (!addLabelStyleInput.validate())\\n validate = false;\\n\\n if (!addLabelTextInput.validate())\\n validate = false;\\n\\n if (!addLabelSelectionInput.validate())\\n validate = false;\\n\\n if (validate) {\\n stateManager.addLabel(addLabelValue);\\n }\\n });\\n\\n cross.ui.on('click', () => {\\n stateManager.exitContextMenu();\\n });\\n\\n removeButton.ui.on('click', () => {\\n stateManager.removeLabel()\\n });\\n\\n addLabelForm.on('keyup', (e) => {\\n if (e.key == 'Enter') {\\n tick.ui.trigger('click');\\n }\\n });\\n\\n return {\\n boundingBox: addLabelForm,\\n text: addLabelTextInput,\\n style: addLabelStyleInput,\\n selection: addLabelSelectionInput,\\n editMode: function () {\\n removeButton.ui.show();\\n }\\n }\\n }\\n\\n\\n function processPropertyList() {\\n var propsForLabel = {};\\n\\n propertyObjectList.forEach((propObj) => {\\n if (propObj.control.value === true) {\\n propsForLabel[propObj.key] = propObj.value;\\n }\\n });\\n\\n if (Object.keys(propsForLabel).length != 0) {\\n return propsForLabel\\n }\\n else {\\n return null;\\n }\\n }\\n\\n // Context Menu UI Funciton \\n boundingBox.hide();\\n this.hidden = true;\\n this.atom = null;\\n\\n removeLabelMenu.on('click', { atom: this.atom }, function () {\\n stateManager.removeAtomLabel(removeLabelMenu.atom);\\n });\\n\\n\\n /**\\n * Shows the context menu \\n * \\n * @function ContextMenu#show \\n * \\n * @param {Number} x x coordinate of the mouse\\n * @param {Number} y y coordinate of the mouse in the viewport in pixels\\n * @param {AtomSpec} atom Value of the atoms that is selected \\n * @param {Boolean} atomExist if atom label is previously added it is set true else false\\n */\\n this.show = function (x, y, atom, atomExist) {\\n\\n if (atomExist) {\\n removeLabelMenu.show();\\n removeLabelMenu.atom = atom;\\n }\\n else {\\n removeLabelMenu.hide();\\n removeLabelMenu.atom = null;\\n }\\n\\n alertBox.ui.hide();\\n addLabelMenu.hide();\\n\\n if (stateManager.getSelectionList().length == 0) {\\n alertBox.message('Please create selections before adding label');\\n } else {\\n addLabelMenu.show();\\n }\\n\\n unsetForm();\\n setPosition(boundingBox, x, y);\\n boundingBox.show();\\n this.hidden = false;\\n\\n if (atom) {\\n setProperties(atom);\\n this.atom = atom;\\n }\\n else {\\n propertyMenu.empty();\\n }\\n }\\n\\n /**\\n * Hides the context menu and if needed process the propertyMenu\\n * \\n * @function ContextMenu#hide\\n * @param {Boolean} processContextMenu If true then submission of the property to add label is executed\\n */\\n\\n this.hide = function (processContextMenu) {\\n if (processContextMenu) {\\n var propsForLabel = processPropertyList();\\n if (propsForLabel != null) {\\n stateManager.addAtomLabel(propsForLabel, this.atom);\\n }\\n }\\n\\n boundingBox.hide();\\n this.hidden = true;\\n unsetForm();\\n }\\n\\n addLabelMenu.on('click', function () {\\n var addLabelMenuForm = generateAddLabelForm();\\n setForm(addLabelMenuForm);\\n });\\n\\n function setForm(form) {\\n editMenu.children().detach();\\n editMenu.append(form.boundingBox);\\n editMenu.show();\\n }\\n\\n function unsetForm() {\\n editMenu.children().detach();\\n editMenu.hide();\\n }\\n }\",\n \"function controlsubmenu(tabcontent,tabid) {\\n\\t\\tcloseallmenus();\\n\\t\\tblocknone(tabcontent,tabid,'block','#000000','#ffc','text');\\n\\t\\tactive_tabcontent = tabcontent;\\n\\t\\tactive_tab1 = tabid\\n\\t}\",\n \"function updateTabOrder(){var selectedItem=ctrl.tabs[ctrl.selectedIndex],focusItem=ctrl.tabs[ctrl.focusIndex];ctrl.tabs=ctrl.tabs.sort(function(a,b){return a.index-b.index;});ctrl.selectedIndex=ctrl.tabs.indexOf(selectedItem);ctrl.focusIndex=ctrl.tabs.indexOf(focusItem);}\",\n \"function switchTabs(newTabNum, listItems) {\\n if (newTabNum !== curTabNum) {\\n switchToTab(newTabNum);\\n switchHighlight(newTabNum, listItems);\\n\\n curTabNum = newTabNum;\\n }\\n\\n // Show new tab, hide old tab\\n function switchToTab(newTabNum) {\\n var curTab = document.querySelector(\\\".features-tab\\\" + curTabNum);\\n var newTab = document.querySelector(\\\".features-tab\\\" + newTabNum);\\n\\n // disable current tab and enable selected tab\\n\\n curTab.style.transition = \\\"opacity 0.5s\\\";\\n curTab.style.opacity = 0;\\n curTab.style.zIndex = 1;\\n\\n newTab.style.transition = \\\"opacity 0.2s\\\";\\n newTab.style.opacity = 1;\\n newTab.style.zIndex = 2;\\n }\\n\\n // Display new highlight and hide old one in the menu list\\n function switchHighlight(newTabNum, listItems) {\\n if (newTabNum !== curTabNum) {\\n // Get current and new HL objects\\n var curListItem = listItems[curTabNum-1];\\n var curHL = curListItem.children[0];\\n var HLWidth = window.getComputedStyle(curHL).width;\\n\\n var newListItem = listItems[newTabNum-1];\\n var newHL = newListItem.children[0];\\n\\n // Apply transition effect\\n curHL.style.width = 0 + \\\"px\\\";\\n newHL.style.width = HLWidth;\\n }\\n }\\n}\",\n \"function addContextMenuButton(id, node, menu, isCase) {\\n var buttonWrapper = document.createElement('div');\\n buttonWrapper.innerHTML = '<button class=\\\"btn-more\\\"><img src=\\\"/katalon/images/SVG/more-icon.svg\\\" alt=\\\"More\\\" title=\\\"More\\\"></button>';\\n var button = buttonWrapper.firstChild;\\n node.appendChild(button);\\n button.addEventListener(\\\"click\\\", function(event) {\\n if (isCase) {\\n setSelectedCase(id);\\n } else {\\n setSelectedSuite(id);\\n }\\n var mid = \\\"#\\\" + \\\"menu\\\" + id;\\n $(\\\".menu\\\").css(\\\"left\\\", event.pageX);\\n $(\\\".menu\\\").css(\\\"top\\\", event.pageY);\\n $(mid).show();\\n }, false);\\n}\",\n \"function openPage(evt) {\\n // Go through all of the content, and hide them.\\n var tabcontent = $(\\\".ms-navigation-dialog__tabcontent\\\");\\n $(tabcontent).hide().removeClass('ms-navigation-dialog__tabcontent--active');\\n\\n var tab = $(\\\".ms-navigation-dialog__tab-link--active\\\");\\n $(tab).removeClass('ms-navigation-dialog__tab-link--active');\\n $(evt.target).addClass('ms-navigation-dialog__tab-link--active');\\n \\n // Now display the content for the selectcommand bar item.\\n $('#' + evt.target.getAttribute('data-tab')).show().addClass('ms-navigation-dialog__tabcontent--active');\\n }\",\n \"async function focus_menu_tab()\\n {\\n const tab = await browser.tabs.get(menu_tab_id);\\n\\n browser.tabs.update(tab.id, { active: true });\\n browser.windows.update(tab.windowId, { focused: true });\\n }\",\n \"function applyPrefs()\\n {\\n // Show/hide page action on all tabs\\n browser.tabs.query( {}, tabs => {\\n for (let tab of tabs)\\n {\\n if (prefs.showPageAction)\\n browser.pageAction.show( tab.id );\\n else\\n browser.pageAction.hide( tab.id );\\n }\\n });\\n\\n // Create menu for current tab\\n browser.tabs.query( {active:true, currentWindow:true}, tabs => {\\n digglerBuildMenu( tabs[0].url );\\n });\\n }\",\n \"function addChildrenToContextMenu() {\\n chrome.storage.local.get(null, function(items) {\\n\\n if (items.duckDuckGoLink === true) {\\n addChildToContextMenu('DuckDuckGo', '');\\n }\\n if (items.googleLink === true) {\\n addChildToContextMenu('Google', '!g');\\n }\\n if (items.googleImagesLink === true) {\\n addChildToContextMenu('Google Images', '!gi');\\n }\\n if (items.yandexLink === true) {\\n addChildToContextMenu('Yandex', '!ya');\\n }\\n if (items.yandexImagesLink === true) {\\n addChildToContextMenu('Yandex Images', '!ymg');\\n }\\n });\\n}\",\n \"function contextMenuWorkForRecycleBin(action, el, pos) {\\r\\n\\r\\n switch (action) {\\r\\n case \\\"delete\\\":\\r\\n {\\r\\n var contractTitle = $(el).find(\\\"#ContractTitle\\\").text();\\r\\n var entityid = $(el).find(\\\"#ContractID\\\").text();\\r\\n DeleteContractFromRecycleBin(contractTitle, entityid);\\r\\n break;\\r\\n }\\r\\n case \\\"viewdetails\\\":\\r\\n {\\r\\n var entityid = $(el).find(\\\"#ContractID\\\").text();\\r\\n location = \\\"/Contracts/ContractDetails?ContractID=\\\" + entityid;\\r\\n break;\\r\\n }\\r\\n case \\\"history\\\":\\r\\n {\\r\\n var contractID = $(el).find(\\\"#ContractID\\\").text();\\r\\n $(\\\"#hdContractID\\\").val(contractID);\\r\\n // $('#ddlHistoryFilter').val('All');\\r\\n CreateContractActivityList(contractID);\\r\\n break;\\r\\n }\\r\\n }\\r\\n}\",\n \"function initEditorContextMenuItems(aEvent)\\n{\\n var shouldShowEditPage = !gContextMenu.onImage && !gContextMenu.onLink && !gContextMenu.onTextInput && !gContextMenu.inDirList;\\n gContextMenu.showItem( \\\"context-editpage\\\", shouldShowEditPage );\\n\\n var shouldShowEditLink = gContextMenu.onSaveableLink; \\n gContextMenu.showItem( \\\"context-editlink\\\", shouldShowEditLink );\\n\\n // Hide the applications separator if there's no add-on apps present. \\n gContextMenu.showItem(\\\"context-sep-apps\\\", gContextMenu.shouldShowSeparator(\\\"context-sep-apps\\\"));\\n}\",\n \"updateSoho() {\\n this.applicationmenu.updated();\\n }\",\n \"function onContextMenu(e) {\\n\\tif (e.target && e.target.object && e.target.object instanceof Movable) {\\n\\t\\te.preventDefault();\\n\\t}\\n\\tonMouseUp(e);\\n}\",\n \"function createMainMenu() {\\n chrome.contextMenus.create({\\n id: 'parentMenu',\\n title: 'Search \\\"%s\\\" on:',\\n contexts: ['selection']\\n });\\n}\",\n \"function menuOptions() {}\",\n \"async function open_menu_in_new_tab()\\n {\\n if (menu_tab_id !== null) { focus_menu_tab(); return; }\\n\\n const options = await storage.load(storage.Key.Configuration);\\n if (options.do_limit_to_private_context)\\n {\\n const windows = await browser.windows.getAll({ windowTypes: [\\\"normal\\\"] });\\n const private_window_index = windows.findIndex(window => window.incognito);\\n if (private_window_index === -1)\\n {\\n const new_window = await browser.windows.create({\\n incognito: true,\\n url: MENU_PAGE_URL\\n });\\n menu_tab_id = new_window.tabs[0].id;\\n }\\n else\\n {\\n const tab = await browser.tabs.create({\\n active: true,\\n url: MENU_PAGE_URL,\\n windowId: windows[private_window_index].id\\n });\\n menu_tab_id = tab.id;\\n }\\n }\\n else\\n {\\n const tab = await browser.tabs.create({\\n active: true,\\n url: MENU_PAGE_URL\\n });\\n menu_tab_id = tab.id;\\n }\\n\\n function hook()\\n {\\n browser.tabs.onRemoved.addListener(on_removed);\\n browser.tabs.onUpdated.addListener(on_updated);\\n events.local.emit(\\\"menu-tab-hooked\\\", { id: menu_tab_id });\\n }\\n function unhook()\\n {\\n menu_tab_id = null;\\n browser.tabs.onRemoved.removeListener(on_removed);\\n browser.tabs.onUpdated.removeListener(on_updated);\\n events.local.emit(\\\"menu-tab-unhooked\\\");\\n }\\n function on_removed(id) { if (id === menu_tab_id) { unhook(); } }\\n function on_updated(id, changes, new_state)\\n {\\n if (id === menu_tab_id &&\\n changes.hasOwnProperty(\\\"url\\\") &&\\n new_state.url !== MENU_PAGE_URL)\\n {\\n unhook();\\n }\\n }\\n hook();\\n focus_menu_tab();\\n }\",\n \"function showContextMenu()\\n{\\n chrome.contextMenus.removeAll(function()\\n {\\n if(typeof localStorage[\\\"shouldShowBlockElementMenu\\\"] == \\\"string\\\" && localStorage[\\\"shouldShowBlockElementMenu\\\"] == \\\"true\\\")\\n {\\n chrome.contextMenus.create({'title': chrome.i18n.getMessage('block_element'), 'contexts': ['image', 'video', 'audio'], 'onclick': function(info, tab)\\n {\\n if(info.srcUrl)\\n chrome.tabs.sendRequest(tab.id, {reqtype: \\\"clickhide-new-filter\\\", filter: info.srcUrl});\\n }});\\n }\\n });\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70212114","0.6927158","0.6924702","0.6906198","0.6843413","0.67981917","0.67857164","0.6707404","0.6699512","0.6699512","0.6597538","0.65107584","0.6501404","0.6436692","0.6435966","0.6433753","0.64157784","0.6403758","0.6296309","0.6295183","0.6206347","0.62035567","0.61674064","0.6162439","0.6136232","0.6130707","0.6127862","0.6115062","0.610833","0.60413986","0.6033945","0.600459","0.5979433","0.5978796","0.59761477","0.59492105","0.5945742","0.5943684","0.5939165","0.59016836","0.58896","0.5871498","0.58707285","0.5868795","0.5847806","0.5827983","0.58253586","0.5819263","0.5812301","0.58073646","0.5803308","0.5794014","0.578984","0.5789093","0.5778309","0.57681185","0.5764357","0.5759713","0.5759202","0.57541466","0.5746916","0.5743851","0.57414836","0.57290274","0.5727089","0.571463","0.57107985","0.5709369","0.56792057","0.56776804","0.56756496","0.566285","0.56596875","0.5654658","0.5652889","0.5652476","0.5647515","0.5646735","0.5639225","0.56277674","0.561781","0.56139714","0.5601527","0.5598861","0.5591054","0.55901146","0.55872196","0.5587188","0.5581199","0.55726767","0.55702984","0.55654806","0.5560441","0.5547679","0.5547609","0.55427843","0.5542682","0.55409586","0.55347073","0.5531311"],"string":"[\n \"0.70212114\",\n \"0.6927158\",\n \"0.6924702\",\n \"0.6906198\",\n \"0.6843413\",\n \"0.67981917\",\n \"0.67857164\",\n \"0.6707404\",\n \"0.6699512\",\n \"0.6699512\",\n \"0.6597538\",\n \"0.65107584\",\n \"0.6501404\",\n \"0.6436692\",\n \"0.6435966\",\n \"0.6433753\",\n \"0.64157784\",\n \"0.6403758\",\n \"0.6296309\",\n \"0.6295183\",\n \"0.6206347\",\n \"0.62035567\",\n \"0.61674064\",\n \"0.6162439\",\n \"0.6136232\",\n \"0.6130707\",\n \"0.6127862\",\n \"0.6115062\",\n \"0.610833\",\n \"0.60413986\",\n \"0.6033945\",\n \"0.600459\",\n \"0.5979433\",\n \"0.5978796\",\n \"0.59761477\",\n \"0.59492105\",\n \"0.5945742\",\n \"0.5943684\",\n \"0.5939165\",\n \"0.59016836\",\n \"0.58896\",\n \"0.5871498\",\n \"0.58707285\",\n \"0.5868795\",\n \"0.5847806\",\n \"0.5827983\",\n \"0.58253586\",\n \"0.5819263\",\n \"0.5812301\",\n \"0.58073646\",\n \"0.5803308\",\n \"0.5794014\",\n \"0.578984\",\n \"0.5789093\",\n \"0.5778309\",\n \"0.57681185\",\n \"0.5764357\",\n \"0.5759713\",\n \"0.5759202\",\n \"0.57541466\",\n \"0.5746916\",\n \"0.5743851\",\n \"0.57414836\",\n \"0.57290274\",\n \"0.5727089\",\n \"0.571463\",\n \"0.57107985\",\n \"0.5709369\",\n \"0.56792057\",\n \"0.56776804\",\n \"0.56756496\",\n \"0.566285\",\n \"0.56596875\",\n \"0.5654658\",\n \"0.5652889\",\n \"0.5652476\",\n \"0.5647515\",\n \"0.5646735\",\n \"0.5639225\",\n \"0.56277674\",\n \"0.561781\",\n \"0.56139714\",\n \"0.5601527\",\n \"0.5598861\",\n \"0.5591054\",\n \"0.55901146\",\n \"0.55872196\",\n \"0.5587188\",\n \"0.5581199\",\n \"0.55726767\",\n \"0.55702984\",\n \"0.55654806\",\n \"0.5560441\",\n \"0.5547679\",\n \"0.5547609\",\n \"0.55427843\",\n \"0.5542682\",\n \"0.55409586\",\n \"0.55347073\",\n \"0.5531311\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.76073915"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":4671,"cells":{"query":{"kind":"string","value":"! betternormalscroll v1.14.1 (c) 20162019 ustbhuangyi Released under the MIT License."},"document":{"kind":"string","value":"function a(t,i){for(;i+1<t.length;i++)t[i]=t[i+1];t.pop()}"},"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 mkdOnWindowScroll() {\n \n }","function OCM_scrolling() {\r\n\t\t\t\t\t\r\n\t\t\t\t\t$offCanvasEl.mousewheel(function (event, delta) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tthis.scrollTop -= (delta * 30);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tevent.preventDefault();\r\n\t\t\t\t\t});\r\n\t\t\t\t\t\r\n\t\t\t\t}","function bgenScroll(e) {\n if (window.pageYOffset != null) {\n st = window.pageYOffset + '';\n }\n if (document.body.scrollWidth != null) {\n if (document.body.scrollTop) {\n st = document.body.scrollTop;\n }\n st = document.documentElement.scrollTop;\n }\n setTimeout('window.scroll(0,st)', 50);\n}","function edgtfOnWindowScroll() {\n \n }","function updateScroll(){if(!elements.li[0])return;var height=elements.li[0].offsetHeight,top=height*ctrl.index,bot=top+height,hgt=elements.scroller.clientHeight,scrollTop=elements.scroller.scrollTop;if(top<scrollTop){scrollTo(top);}else if(bot>scrollTop+hgt){scrollTo(bot-hgt);}}","function cust_PageScroll(ref) {\n\n}","function VirtualScrollStrategy() {}","function VirtualScrollStrategy() {}","function VirtualScrollStrategy() {}","function VirtualScrollStrategy() {}","function VirtualScrollStrategy() { }","function VirtualScrollStrategy() { }","scroll() {\n const env = this;\n const container = this['$container']['$node'];\n container.parentNode.addEventListener( 'scroll', function( e ) {\n env['$content'].scrollTop = container.parentNode.scrollTop;\n env['$content'].scrollLeft = container.parentNode.scrollLeft;\n env.setPage();\n });\n }","function qodeOnWindowScroll() {\n\t qodeInitNewsShortcodesPagination().scroll();\n }","function mkdfOnWindowScroll() {\n\n }","function ViewportScrollPosition() { }","function ViewportScrollPosition() { }","initScroll() {\n this.libraryView.effetLibrarySelect.scrollTop += 1;\n this.libraryView.exempleLibrarySelect.scrollTop += 1;\n this.libraryView.intrumentLibrarySelect.scrollTop += 1;\n }","function updateScroll(){\n historique.scrollTop = historique.scrollHeight;\n}","function UpdateScrollThumbs()\n{\n UpdateVerticalScrollVisual();\n UpdateHorizontalScrollVisual();\n}","function scrollStart() {\n // Hide context menu if showing\n component.hideContextMenu();\n // Bind clickout scroll\n //component.layers[\"clickout\"].on(\"scroll\", onChangeLayout);\n }","function ViewportScrollPosition() {}","function ViewportScrollPosition() {}","function ViewportScrollPosition() {}","function ViewportScrollPosition() {}","function eltdfOnWindowScroll() {\n\n }","function eltdfOnWindowScroll() {\n }","function eltdfOnWindowScroll() {\n }","function updateScroll () {\n if (!elements.li[0]) return;\n if (mode === MODE_STANDARD) {\n updateStandardScroll();\n } else {\n updateVirtualScroll();\n }\n }","function onScroll() {\r\n requestTick();\r\n}","handleScroll() {\n // //for a perfect page infinit loading ...\n let elements = document.getElementsByClassName(\"masonry\");\n let short = this.getShortestCol(elements)\n // console.log(short)\n let rect;\n if(short){\n rect = short.getBoundingClientRect();\n // if \"half port view height\" near to bottom trigger load more\n if(rect.bottom <= (window.innerHeight * 2 || document.documentElement.clientHeight * 2)){\n if(!this.state.bottom){\n // console.log(\"bottoooom\")\n this.setState({\n bottom: true,\n next: this.state.next +1,\n });\n }\n\n }else{\n if(this.state.bottom){\n // console.log(\"not bottom\")\n this.setState({\n bottom: false\n });\n }\n }\n\n }\n\n }","handleScroll() {\n if(this.scroller) {\n const heightOfContent = this.scroller.offsetHeight;\n const yOffset = window.pageYOffset;\n const wholeY = yOffset + window.innerHeight;\n if(wholeY >= heightOfContent) {\n this.lazyLoad();\n }\n }\n\n }","onscroll(event) {\n let target = event.target.scrollingElement;\n let posAtual = target.scrollTop;\n let maxScroll = target.scrollTopMax;\n if (posAtual > maxScroll * 0.9 && !this.variables.getCarregandoMaisComics()) {\n this.variables.setCarregandoMaisComics(true);\n this.comics.getComics(this.variables.getTituloBusca(), this.variables.getComics().length).subscribe(comics => {\n this.variables.setComics(comics.data.results, false);\n this.variables.setCarregandoMaisComics(false);\n });\n }\n }","function ScrollPosition() {}","_scrollHandler () {}","updateScroll(){\n \t\tif (this.$.content.scrollHeight > this.$.content.offsetHeight){\n \t\t\tthis.$.content.scrollTop = this.$.content.scrollHeight - this.$.content.offsetHeight;\n \t\t}\n \t}","function $a(e,t){var a=e.display,n=ya(e.display);t.top<0&&(t.top=0);var r=e.curOp&&null!=e.curOp.scrollTop?e.curOp.scrollTop:a.scroller.scrollTop,f=qt(e),o={};t.bottom-t.top>f&&(t.bottom=t.top+f);var i=e.doc.height+Bt(a),s=t.top<n,c=t.bottom>i-n;if(t.top<r)o.scrollTop=s?0:t.top;else if(t.bottom>r+f){var u=Math.min(t.top,(c?i:t.bottom)-f);u!=r&&(o.scrollTop=u)}var l=e.curOp&&null!=e.curOp.scrollLeft?e.curOp.scrollLeft:a.scroller.scrollLeft,d=zt(e)-(e.options.fixedGutter?a.gutters.offsetWidth:0),_=t.right-t.left>d;return _&&(t.right=t.left+d),t.left<10?o.scrollLeft=0:t.left<l?o.scrollLeft=Math.max(0,t.left-(_?0:10)):t.right>d+l-3&&(o.scrollLeft=t.right+(_?0:10)-d),o}","function customScroll(elemento) {\n if ($.fn.mCustomScrollbar) {\n //$('.withScroll').each(function() {\n $(elemento).mCustomScrollbar(\"destroy\");\n var scroll_height = $(elemento).data('height') ? $(elemento).data('height') : 'auto';\n var data_padding = $(elemento).data('padding') ? $(elemento).data('padding') : 0;\n if ($(elemento).data('height') == 'window') {\n thisHeight = $(elemento).height();\n windowHeight = $(window).height() - data_padding - 50;\n if (thisHeight < windowHeight) scroll_height = thisHeight;\n else scroll_height = windowHeight;\n }\n $(elemento).mCustomScrollbar({\n scrollButtons: {\n enable: false\n },\n autoHideScrollbar: $(elemento).hasClass('show-scroll') ? false : true,\n scrollInertia: 150,\n theme: \"light\",\n set_height: scroll_height,\n advanced: {\n updateOnContentResize: true\n }\n });\n //});\n }\n}","function activateScroll()\n{\n windowResize();\n\n if (onePageScrollActive)\n {\n new fullScroll({\n mainElement: \"main\",\n displayDots: true,\n dotsPosition: \"left\",\n animateTime: 0.7,\n animateFunction: \"ease\",\n });\n } \n}","get _scrollBottom(){return this._scrollPosition+this._viewportHeight;}","function bgenScroll()\n{\n // DESCRIPTION:\n // When using CSS-Targets, a <a href=\"#anchor\"> is required.\n // To prevent the page from jumping to the anchor and therefor putting\n // it on top of the page, the <a>-Tag needs to contain the following event:\n // onclick=\"bgenScroll();\"\n\n if (window.pageYOffset!= null)\n {\n st=window.pageYOffset+\"\";\n }\n\n if (document.body.scrollWidth!= null)\n {\n if (document.body.scrollTop)\n {\n st=document.body.scrollTop;\n }\n st=document.documentElement.scrollTop;\n }\n setTimeout(\"window.scroll(0,st)\",10);\n}","function initScroll(){var windowH=$(window).height(),newW=windowH/1400*29232+1e3/windowH*3;scrollWidth=newW-$(window).width(),$(\".helper\").width(newW),$(\"#wrapper,.helper\").height(windowH),myscroll=new iScroll(\"wrapper\",{hScrollbar:!0,useTransition:!0,hScroll:!0,vScroll:!1,checkDOMChanges:!0,bounce:!1,scrollbarClass:\"myScrollbar\"}),\n// \nmyscroll.options.onScrollStart=function(){\"block\"==$(\".detail\").css(\"display\")&&($(\".detail\").css(\"display\",\"none\"),$(\"#daoyu\").attr(\"id\",\"\")),\"block\"==$(\".detail-w\").css(\"display\")&&($(\".detail-w\").css(\"display\",\"none\"),$(\"#daoyu\").attr(\"id\",\"\"))},myscroll.options.onScrollEnd=function(){$(\".myScrollbarH\").hide(),timer&&clearTimeout(timer),timer=setTimeout(function(){clearTimeout(timer),timer=null,myscroll.scrollTo(myscroll.x+scrollWidth,0,Math.abs(5e5*(scrollWidth+myscroll.x)/scrollWidth),\"relative\")},2e4)},myscroll.scrollTo(scrollWidth,0,5e5,\"relative\"),$(\".myScrollbarH\").hide()}","function hsClickScroll()\n {\n var imageOffset = self.getOffsetRect(this).top; \n var clientOffset = (docElement.clientHeight-hs.maxHeight) / 2;\n window.scrollTo(0,imageOffset-clientOffset);\n }","function initializeScrollbar() { \n $(\".mcustomScroll\").mCustomScrollbar({ \n theme:\"dark-3\",\n axis:\"yx\",\n advanced:{\n updateOnContentResize: true\n }\n });\n\n $(\".mcustomScroll.mcustomScrollVerticalOnly\").mCustomScrollbar({ \n theme:\"dark-3\",\n axis:\"y\",\n advanced:{\n updateOnContentResize: true\n }\n });\n }","function customScroll() {\n $( '.cn-custom-scroll' ).mCustomScrollbar( {\n theme: \"dark-2\",\n scrollEasing: \"linear\",\n scrollInertia: 200,\n } );\n\n $( '.cn-custom-scroll-inner' ).bind( 'mousewheel DOMMouseScroll', function( e ) {\n var e0 = e.originalEvent,\n delta = e0.wheelDelta || -e0.detail;\n\n this.scrollTop += ( delta < 0 ? 1 : -1 ) * 30;\n e.preventDefault();\n } );\n }","function throttledScrollEvents() {\n\n }","function setScrollingArguments0() {\n elem_position = \"0\";\n elem_name = 'body'\n }","function updateScroll(){\n var treshold = 5;\n ux.scroll.offsetPrevious = ux.scroll.offset;\n ux.scroll.offset = $(window).scrollTop();\n \n // We compare distance traveled with a defined treshold and report scroll direction\n if( ux.scroll.offset - ux.scroll.offsetPrevious > treshold ){\n ux.scroll.direction = 'down';\n } else if( ux.scroll.offsetPrevious - ux.scroll.offset > treshold ){\n ux.scroll.direction = 'up';\n }\n \n ux.viewport.visibleTop = ux.scroll.offset\n ux.viewport.visibleBottom = ux.viewport.height + ux.scroll.offset;\n}","function updateScreenshotScroll() {\r\n if (!isMobile) { \r\n $('#screenshots').slimScroll(slimOptionsContent); \r\n }\r\n}","function setScrolling()\n {\n scrolling = true;\n }","[scroll]() {\n if (!this.scrollableElement || !this.currentMousePosition) {\n return;\n }\n\n cancelAnimationFrame(this.scrollAnimationFrame);\n\n const { speed, sensitivity } = this.options;\n\n const rect = this.scrollableElement.getBoundingClientRect();\n const bottomCutOff = rect.bottom > window.innerHeight;\n const topCutOff = rect.top < 0;\n const cutOff = topCutOff || bottomCutOff;\n\n const documentScrollingElement = getDocumentScrollingElement();\n const scrollableElement = this.scrollableElement;\n const clientX = this.currentMousePosition.clientX;\n const clientY = this.currentMousePosition.clientY;\n\n if (scrollableElement !== document.body && scrollableElement !== document.documentElement && !cutOff) {\n const { offsetHeight, offsetWidth } = scrollableElement;\n\n if (rect.top + offsetHeight - clientY < sensitivity) {\n scrollableElement.scrollTop += speed;\n } else if (clientY - rect.top < sensitivity) {\n scrollableElement.scrollTop -= speed;\n }\n\n if (rect.left + offsetWidth - clientX < sensitivity) {\n scrollableElement.scrollLeft += speed;\n } else if (clientX - rect.left < sensitivity) {\n scrollableElement.scrollLeft -= speed;\n }\n } else {\n const { innerHeight, innerWidth } = window;\n\n if (clientY < sensitivity) {\n documentScrollingElement.scrollTop -= speed;\n } else if (innerHeight - clientY < sensitivity) {\n documentScrollingElement.scrollTop += speed;\n }\n\n if (clientX < sensitivity) {\n documentScrollingElement.scrollLeft -= speed;\n } else if (innerWidth - clientX < sensitivity) {\n documentScrollingElement.scrollLeft += speed;\n }\n }\n\n this.scrollAnimationFrame = requestAnimationFrame(this[scroll]);\n }","get _scrollBottom(){return this._scrollPosition+this._viewportHeight}","function setCustomScrollBars() {\n /* * * M a l i h u j Q u e r y C u s t o m C o n t e n t S c r o l l e r : BEGIN * * */\n /*http://manos.malihu.gr/jquery-custom-content-scroller/*/\n //$(\".consoleLogOutput\").append('<div class=\"consoleLog_helm\">$(window).load() event starting.</div>');\n if (Compass.Global.isInternetExplorer === false) {\n $(\"#LoanDatesPanelContent_helm\").mCustomScrollbar({\n theme: \"dark\",\n alwaysShowScrollbar: 0, //Disable scrolll bar when there’s nothing to scroll.\n //scrollbarPosition: \"outside\",\n snapAmount: 26,\n snapOffset: 3,\n mouseWheel: {\n deltaFactor: 28,\n normalizeDelta: false\n },\n callbacks: {\n onScrollStart: function () {\n Compass.Helm.hideHelpPopOvers();\n }\n },\n scrollInertia: 500\n\n });\n $(\"#LoanContactsListContainer_helm\").mCustomScrollbar({\n theme: \"dark\",\n alwaysShowScrollbar: 0, //Disable scrolll bar when there’s nothing to scroll.\n //scrollbarPosition: \"outside\",\n snapAmount: 26,\n snapOffset: 3,\n mouseWheel: {\n deltaFactor: 28,\n normalizeDelta: false\n },\n scrollInertia: 500\n\n });\n }\n /* * * M a l i h u j Q u e r y C u s t o m C o n t e n t S c r o l l e r : END * * */\n }","function eltdOnWindowScrollHeader() {\n \n }","scroll() {\r\n window.onscroll = () => {\r\n let bottomOfWindow = document.documentElement.scrollTop + window.innerHeight >= (document.documentElement.offsetHeight - 200);\r\n if (bottomOfWindow) {\r\n this.page++\r\n if(this.searchedTitle === \"\"){\r\n this.searchPopular()\r\n } else if(this.genreSelected === \"All\"){\r\n this.searchFilm()\r\n this.searchTv()\r\n } else if(this.genreSelected === \"Films\") {\r\n this.searchFilm()\r\n } else {\r\n this.searchTv()\r\n }\r\n }\r\n };\r\n }","set scrolling(scrolling) {\n this._scrolling = scrolling;\n }","function gscroll(cont) {\n if (cont) {\n return [{ c: cont, y: 1 }];\n }\n }","function customScroll() {\n if ($.fn.mCustomScrollbar) {\n $('.withScroll').each(function() {\n $(this).mCustomScrollbar(\"destroy\");\n var scroll_height = $(this).data('height') ? $(this).data('height') : 'auto';\n var data_padding = $(this).data('padding') ? $(this).data('padding') : 0;\n if ($(this).data('height') == 'window') {\n thisHeight = $(this).height();\n windowHeight = $(window).height() - data_padding - 50;\n if (thisHeight < windowHeight) scroll_height = thisHeight;\n else scroll_height = windowHeight;\n }\n $(this).mCustomScrollbar({\n scrollButtons: {\n enable: false\n },\n autoHideScrollbar: $(this).hasClass('show-scroll') ? false : true,\n scrollInertia: 150,\n theme: \"light\",\n set_height: scroll_height,\n advanced: {\n updateOnContentResize: true\n }\n });\n });\n }\n}","function scroll() {\n d3.select(window)\n .on('scroll.scroller', position)\n .on('resize.scroller', resize)\n resize();\n let timer = d3.timer(function() {\n position();\n timer.stop();\n });\n }","function fullscreenBioScrolling() {\r\n\t\t\t\t\t$('.nectar_team_member_overlay .inner-wrap').mousewheel(function (event, delta) {\r\n\t\t\t\t\t\tthis.scrollTop -= (delta * 30);\r\n\t\t\t\t\t\tevent.preventDefault();\r\n\t\t\t\t\t});\r\n\t\t\t\t\t\r\n\t\t\t\t}","scrollBehavior() {\n return { x: 0, y: 0 };\n }","function C16101_KeyWord_Mouse_Wheel_to_Scroll()\n{ \ntry{\n Log.AppendFolder(\"C16101_KeyWord_Mouse_Wheel_to_Scroll\");\n InitializationEnviornment.initiliaze();\n AppLoginLogout.login();\n passportPOS.listListgroup.Refresh();\n aqUtils.Delay(1000);\n var keyWordName =\"Trade\";\n WrapperFunction.selectKeywordName(keyWordName);\n passportPOS.listListgroup.Refresh();\n aqUtils.Delay(1000);\n keyWordName =\"Reservations\";\n WrapperFunction.selectKeywordName(keyWordName);\n passportPOS.listListgroup.Refresh();\n aqUtils.Delay(1000);\n keyWordName =\"Taxes and Fees\";\n WrapperFunction.selectKeywordName(keyWordName);\n// var wnd = Aliases.Passport_POS.wndApolloRuntimeContentWindow;\n// var passportPOS = wnd.passportposPassportpos1;\n// var Keyword_Listgroup =passportPOS.Keyword_Listgroup;\n// var allItemCnt = Keyword_Listgroup.ItemCount;\n// temp = Keyword_Listgroup.FindAllChildren(\"Visible\",\"True\" ,1, true);\n// var visibleItemCnt = temp.length;\n// var counter = allItemCnt - visibleItemCnt; \n// cnt = Keyword_Listgroup.ChildCount;\n// flag = false; \n// while(!flag){\n// if (counter == 0){\n// flag = true;\n// merlinLogError(\"Scroll is not working correctly.\");\n// break;\n// }\n// counter -- ; \n// Keyword_Listgroup.MouseWheel(-1);\n// Keyword_Listgroup.Refresh();\n// Log.Message(\"--\"+counter);\n// cnt = Keyword_Listgroup.ChildCount;\n// for(let i = 0 ; i < cnt ; i++){\n// if((Keyword_Listgroup.Child(i).Visible)&&(Keyword_Listgroup.Child(i).Caption == \"Promo Codes\")){\n// Keyword_Listgroup.MouseWheel(-1);\n// flag = true;\n// Log.Message(\"Scroll functionality working correctly.\");\n// break;\n// }\n// } \n// } \n AppLoginLogout.logout(); \n } catch (e) {\n\t merlinLogError(\"Oops! There's some glitch in the script: \" + e.message);\t \n }\n finally { \n\t Log.PopLogFolder();\n } \n}","function eltdOnWindowScrollHeaderBehaviour() {\n }","update() {\n\t\tthis.scroll.update();\n\t}","function resetMaxScrolls()\n {\n var offsets = getPageOffsets();\n\n var x = offsets[0];\n minXOffset = x;\n maxXOffset = x;\n\n var y = offsets[1];\n minYOffset = y;\n maxYOffset = y;\n }","jump() {\n const env = this;\n const container = this['$container']['$node'];\n container.parentNode.addEventListener( 'scroll', function( e ) {\n env['$content'].scrollTop = container.parentNode.scrollTop;\n env['$content'].scrollLeft = container.parentNode.scrollLeft;\n env.setPage();\n });\n }","start() {\n\t\tthis.scroll.start();\n\t}","function onScroll() {\n lastScrollY = window.scrollY;\n requestFrame();\n}","handleScroll(){\n this.setState({\n detachIOPanel: window.scrollY > 80\n });\n }","function cs_nicescroll(){\r\n\t\t'use strict';\t\r\n\t\tvar nice = jQuery(\"html\").niceScroll({mousescrollstep: \"20\",scrollspeed: \"150\",}); \r\n\t}","handleScroll() {\n const { scrollPos } = this.state;\n this.setState({\n scrollPos: document.body.getBoundingClientRect().top,\n show: document.body.getBoundingClientRect().top > scrollPos\n });\n }","function customScroll() {\r\n\t\tvar windowWidth = $(window).width();\r\n\t\tif (windowWidth > 991) {\r\n\t\t\t// Custom Subpage Scroll\r\n\t\t\t$(\".pt-page\").mCustomScrollbar({\r\n\t\t\t\tscrollInertia: 8\r\n\t\t\t});\r\n\r\n\t\t\t// Custom Header Scroll\r\n\t\t\t$(\"#site_header\").mCustomScrollbar({\r\n\t\t\t\tscrollInertia: 8\r\n\t\t\t});\r\n\t\t} else {\r\n\t\t\t$(\".pt-page\").mCustomScrollbar('destroy');\r\n\r\n\t\t\t$(\"#site_header\").mCustomScrollbar('destroy');\r\n\t\t}\r\n\t}","function createScrollBarForAll(){\n if($('body').hasClass(RESPONSIVE)){\n removeResponsiveScrollOverflows();\n }\n else{\n forEachSectionAndSlide(createScrollBar);\n }\n }","function body_scroll(){\n\n\tdrag_manager.body_scroll = document.documentElement.scrollTop;\n\n}","function handleScrollStop() {\n scrollEngaged = false;\n}","function onIndexPageScroll() {\n var clientHeight = $(this).height();\n var scrollTop = Math.ceil($(this).scrollTop());\n var scrollHeight = $(document).height();\n if(scrollTop + clientHeight === scrollHeight){\n // Get the first then items from the grid, clone them, and add them to the bottom of the grid\n var $container = $(\"#waterfall\");\n var $items = $('div.item', $container);\n var $itemCount = $items.length;\n if ($itemCount < 100) {\n getIndexPicture(appendItemToWaterFall);\n }\n }\n}","controlScroll(e) {\n const event = e.nativeEvent;\n const interval = Dimensions.get('window').width - (dimensions.widthWeight * 57);\n\n let rate = event.contentOffset.x / interval\n - Math.floor(event.contentOffset.x / interval);\n let moveTo;\n if (rate <= 0.25 || rate >= 0.75) {\n moveTo = (Math.round(event.contentOffset.x / interval));\n } else {\n moveTo = (event.contentOffset.x - this.state.scrollBegin >= 0) ?\n (Math.ceil(event.contentOffset.x / interval)) :\n (Math.floor(event.contentOffset.x / interval));\n }\n\n if (moveTo > this.props.dataSource._cachedRowCount - 1) {\n moveTo -= 1;\n } else if (moveTo < 0) {\n moveTo = 0;\n }\n\n this.resetListView.scrollTo({\n x: moveTo * interval,\n y: 0,\n animated: true,\n });\n\n }","function tinyScroll() {\n window.scrollBy(0, 1);\n}","function onScroll() {\n latest = getScrollY();\n requestTick();\n }","function onScroll() {\n _lastScrollY = window.scrollY;\n requestTick();\n }","scrollBehavior () {\n return { x: 0, y: 0 }\n }","appendScrollBar(){\n $('body').append('<div class=\"scroll position-fixed\" style=\"width:70px; bottom: 100%;right:1em; transition: all .3s ease-in-out\">' +\n '<img src=\"../../File/T--USTC-Software--scroll.png\"/>' +\n '<div class=\"position-relative backHead\" style=\"width: 70px; height: 110px; top: -110px; cursor: pointer;\"></div>' +\n '</div>');\n }","_addScrollBar() {\n const canvas = this.getCanvas();\n\n canvas.add(this._horizontalScroll);\n canvas.add(this._verticalScroll);\n\n if (this.scrollBarTid) {\n clearTimeout(this.scrollBarTid);\n }\n\n this.scrollBarTid = setTimeout(() => {\n canvas.remove(this._horizontalScroll);\n canvas.remove(this._verticalScroll);\n }, 3000);\n }","function updateScroll() {\n\t//gets the div class element that holds the list and the scroll.\n let element = document.getElementsByClassName(\"isgrP\")[0];\n element.scrollTop = element.scrollHeight;\n}","scrollPage(){\n setTimeout(() => {\n window.scrollBy(0, this.scrollDirection * AUTO_SCROLL_STEP);\n if(this.shouldScroll){\n this.scrollPage();\n }\n }, AUTO_SCROLL_DELAY);\n }","updateScroll() {\n\t\t\tthis.scrollPosition = window.scrollY;\n\t\t}","function onscrolling(){if($(document).scrollTop()+$(window).height() + 10/*some px before touch bottom*/ >= $(document).height()){console.log('loading...');loadquery();/*$(\"#container\").BlocksIt('reload');*/}}","function judgeScroll(){\n\n for(var j= 1 ; j < num.length ; j++ ){\n if ( num[j] < (wScrollTop + wH) ) {\n for ( var k = 0 ; k <= j ; k++){\n obj.eq(k).addClass('scrollIn');\n }\n }\n }\n }","function updateMaxScrolls()\n {\n var offsets = getPageOffsets();\n\n var x = offsets[0];\n if (x < minXOffset)\n {\n minXOffset = x;\n } else if (x > maxXOffset)\n {\n maxXOffset = x;\n }\n\n var y = offsets[1];\n if (y < minYOffset)\n {\n minYOffset = y;\n } else if (y > maxYOffset)\n {\n maxYOffset = y;\n }\n }","startScroll(element) {\n // VARIABLE QUE NOS PERMITIRA GUARDAR EL NUMERO DEL SCROLL EN EL QUE VA EL ELEMENTO Y COMPARARLO \n // CON EL OBJETIVO DE VER SI YA LLEGO A SU MAXIMO REINICIALIZAR EL SCROLL DEL ELEMENTO A 0 PARA HACER UNA ANIMACION \n // INFINITA\n let maxScroll = 0;\n var animateScroll = function(){ \n // SE AUMENTA 1 CADA VEZ QUE SE EJECUTA ESTA FUNCION AL SCROLLLEFT DEL ELEMENTO\n element.scrollLeft += 1;\n // ESTE COMPARATIVO REVISA SI EL SCROLL DEL ELEMENTO HA LLEGADO A SU MAXIMO DEBE REINICIALIZAR EL SCROLL A 0, \n // ES DECIR QUE EL ELEMENTO QUE SE MUESTRE SEA EL PRIMERO\n if(maxScroll === element.scrollLeft && element.scrollLeft !== 0){\n element.scrollLeft = 0\n }\n // SI EL SCROLL TODAVIA NO LLEGA A SU MAXIMO QUE SE GUARDE EL VALOR DEL SCROLLLEFT DEL ELEMENTO EN LA VARIABLE MAXSCROLL EL CUAL \n // EN UN FUTURO NOS AYUDARA A COMPARARLO \n else{\n maxScroll = element.scrollLeft;\n }\n // INTERVALO DE TIEMPO QUE EJECUTARA LA FUNCION HASTA QUE LE DIGAMOS QUE PARE\n setTime = setTimeout(animateScroll);\n };\n // EJECUTAMOS EL CALLBACK DE ESTA FUNCION\n animateScroll();\n }","function scroll_check(ev,tag){\n\n\tdrag_manager.scroll_value = tag.scrollTop;\n\n\tfolder_positions_find();\n\n}","function detecteScroll() {\n var myElement= document.getElementsByClassName(\"right-side__product\")[0];\n // console.log(`the position scroll is :${window.scrollY}`);\n if( myElement.scrollHeight> window.scrollY) {\n gsap.to('.demande-btn', {opacity:1, height:\"auto\", display:\"block\", ease:\"ease-in\"});\n } else {\n gsap.to('.demande-btn', {opacity:0, height:0, display:\"none\"});\n }\n \n}","function Wa(e,t){null!=t&&(Qa(e),e.curOp.scrollTop=(null==e.curOp.scrollTop?e.doc.scrollTop:e.curOp.scrollTop)+t)}","function updateScroll () {\n if (!elements.li[0]) return;\n var height = elements.li[0].offsetHeight,\n top = height * ctrl.index,\n bot = top + height,\n hgt = elements.scroller.clientHeight,\n scrollTop = elements.scroller.scrollTop;\n if (top < scrollTop) {\n scrollTo(top);\n } else if (bot > scrollTop + hgt) {\n scrollTo(bot - hgt);\n }\n }","function updateScroll () {\n if (!elements.li[0]) return;\n var height = elements.li[0].offsetHeight,\n top = height * ctrl.index,\n bot = top + height,\n hgt = elements.scroller.clientHeight,\n scrollTop = elements.scroller.scrollTop;\n if (top < scrollTop) {\n scrollTo(top);\n } else if (bot > scrollTop + hgt) {\n scrollTo(bot - hgt);\n }\n }","function updateScroll () {\n if (!elements.li[0]) return;\n var height = elements.li[0].offsetHeight,\n top = height * ctrl.index,\n bot = top + height,\n hgt = elements.scroller.clientHeight,\n scrollTop = elements.scroller.scrollTop;\n if (top < scrollTop) {\n scrollTo(top);\n } else if (bot > scrollTop + hgt) {\n scrollTo(bot - hgt);\n }\n }","scrollBehavior () {\n return { x: 0, y: 0 }\n }","e_mouseScroll(e)\n\t{\n\t\t\n\t}","function post_load_setup() {\n update_scroll_pad();\n}","function scrollHandler()\n {\n updateMaxScrolls();\n activityHandler();\n }","function load(){\r\n\t// window.location.hash=\"#third\";\r\n\tv = document.getElementById('scrollBody');\r\n\tv.scrollLeft = (pageWidth*2/5);\r\n}"],"string":"[\n \"function mkdOnWindowScroll() {\\n \\n }\",\n \"function OCM_scrolling() {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t$offCanvasEl.mousewheel(function (event, delta) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tthis.scrollTop -= (delta * 30);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tevent.preventDefault();\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\",\n \"function bgenScroll(e) {\\n if (window.pageYOffset != null) {\\n st = window.pageYOffset + '';\\n }\\n if (document.body.scrollWidth != null) {\\n if (document.body.scrollTop) {\\n st = document.body.scrollTop;\\n }\\n st = document.documentElement.scrollTop;\\n }\\n setTimeout('window.scroll(0,st)', 50);\\n}\",\n \"function edgtfOnWindowScroll() {\\n \\n }\",\n \"function updateScroll(){if(!elements.li[0])return;var height=elements.li[0].offsetHeight,top=height*ctrl.index,bot=top+height,hgt=elements.scroller.clientHeight,scrollTop=elements.scroller.scrollTop;if(top<scrollTop){scrollTo(top);}else if(bot>scrollTop+hgt){scrollTo(bot-hgt);}}\",\n \"function cust_PageScroll(ref) {\\n\\n}\",\n \"function VirtualScrollStrategy() {}\",\n \"function VirtualScrollStrategy() {}\",\n \"function VirtualScrollStrategy() {}\",\n \"function VirtualScrollStrategy() {}\",\n \"function VirtualScrollStrategy() { }\",\n \"function VirtualScrollStrategy() { }\",\n \"scroll() {\\n const env = this;\\n const container = this['$container']['$node'];\\n container.parentNode.addEventListener( 'scroll', function( e ) {\\n env['$content'].scrollTop = container.parentNode.scrollTop;\\n env['$content'].scrollLeft = container.parentNode.scrollLeft;\\n env.setPage();\\n });\\n }\",\n \"function qodeOnWindowScroll() {\\n\\t qodeInitNewsShortcodesPagination().scroll();\\n }\",\n \"function mkdfOnWindowScroll() {\\n\\n }\",\n \"function ViewportScrollPosition() { }\",\n \"function ViewportScrollPosition() { }\",\n \"initScroll() {\\n this.libraryView.effetLibrarySelect.scrollTop += 1;\\n this.libraryView.exempleLibrarySelect.scrollTop += 1;\\n this.libraryView.intrumentLibrarySelect.scrollTop += 1;\\n }\",\n \"function updateScroll(){\\n historique.scrollTop = historique.scrollHeight;\\n}\",\n \"function UpdateScrollThumbs()\\n{\\n UpdateVerticalScrollVisual();\\n UpdateHorizontalScrollVisual();\\n}\",\n \"function scrollStart() {\\n // Hide context menu if showing\\n component.hideContextMenu();\\n // Bind clickout scroll\\n //component.layers[\\\"clickout\\\"].on(\\\"scroll\\\", onChangeLayout);\\n }\",\n \"function ViewportScrollPosition() {}\",\n \"function ViewportScrollPosition() {}\",\n \"function ViewportScrollPosition() {}\",\n \"function ViewportScrollPosition() {}\",\n \"function eltdfOnWindowScroll() {\\n\\n }\",\n \"function eltdfOnWindowScroll() {\\n }\",\n \"function eltdfOnWindowScroll() {\\n }\",\n \"function updateScroll () {\\n if (!elements.li[0]) return;\\n if (mode === MODE_STANDARD) {\\n updateStandardScroll();\\n } else {\\n updateVirtualScroll();\\n }\\n }\",\n \"function onScroll() {\\r\\n requestTick();\\r\\n}\",\n \"handleScroll() {\\n // //for a perfect page infinit loading ...\\n let elements = document.getElementsByClassName(\\\"masonry\\\");\\n let short = this.getShortestCol(elements)\\n // console.log(short)\\n let rect;\\n if(short){\\n rect = short.getBoundingClientRect();\\n // if \\\"half port view height\\\" near to bottom trigger load more\\n if(rect.bottom <= (window.innerHeight * 2 || document.documentElement.clientHeight * 2)){\\n if(!this.state.bottom){\\n // console.log(\\\"bottoooom\\\")\\n this.setState({\\n bottom: true,\\n next: this.state.next +1,\\n });\\n }\\n\\n }else{\\n if(this.state.bottom){\\n // console.log(\\\"not bottom\\\")\\n this.setState({\\n bottom: false\\n });\\n }\\n }\\n\\n }\\n\\n }\",\n \"handleScroll() {\\n if(this.scroller) {\\n const heightOfContent = this.scroller.offsetHeight;\\n const yOffset = window.pageYOffset;\\n const wholeY = yOffset + window.innerHeight;\\n if(wholeY >= heightOfContent) {\\n this.lazyLoad();\\n }\\n }\\n\\n }\",\n \"onscroll(event) {\\n let target = event.target.scrollingElement;\\n let posAtual = target.scrollTop;\\n let maxScroll = target.scrollTopMax;\\n if (posAtual > maxScroll * 0.9 && !this.variables.getCarregandoMaisComics()) {\\n this.variables.setCarregandoMaisComics(true);\\n this.comics.getComics(this.variables.getTituloBusca(), this.variables.getComics().length).subscribe(comics => {\\n this.variables.setComics(comics.data.results, false);\\n this.variables.setCarregandoMaisComics(false);\\n });\\n }\\n }\",\n \"function ScrollPosition() {}\",\n \"_scrollHandler () {}\",\n \"updateScroll(){\\n \\t\\tif (this.$.content.scrollHeight > this.$.content.offsetHeight){\\n \\t\\t\\tthis.$.content.scrollTop = this.$.content.scrollHeight - this.$.content.offsetHeight;\\n \\t\\t}\\n \\t}\",\n \"function $a(e,t){var a=e.display,n=ya(e.display);t.top<0&&(t.top=0);var r=e.curOp&&null!=e.curOp.scrollTop?e.curOp.scrollTop:a.scroller.scrollTop,f=qt(e),o={};t.bottom-t.top>f&&(t.bottom=t.top+f);var i=e.doc.height+Bt(a),s=t.top<n,c=t.bottom>i-n;if(t.top<r)o.scrollTop=s?0:t.top;else if(t.bottom>r+f){var u=Math.min(t.top,(c?i:t.bottom)-f);u!=r&&(o.scrollTop=u)}var l=e.curOp&&null!=e.curOp.scrollLeft?e.curOp.scrollLeft:a.scroller.scrollLeft,d=zt(e)-(e.options.fixedGutter?a.gutters.offsetWidth:0),_=t.right-t.left>d;return _&&(t.right=t.left+d),t.left<10?o.scrollLeft=0:t.left<l?o.scrollLeft=Math.max(0,t.left-(_?0:10)):t.right>d+l-3&&(o.scrollLeft=t.right+(_?0:10)-d),o}\",\n \"function customScroll(elemento) {\\n if ($.fn.mCustomScrollbar) {\\n //$('.withScroll').each(function() {\\n $(elemento).mCustomScrollbar(\\\"destroy\\\");\\n var scroll_height = $(elemento).data('height') ? $(elemento).data('height') : 'auto';\\n var data_padding = $(elemento).data('padding') ? $(elemento).data('padding') : 0;\\n if ($(elemento).data('height') == 'window') {\\n thisHeight = $(elemento).height();\\n windowHeight = $(window).height() - data_padding - 50;\\n if (thisHeight < windowHeight) scroll_height = thisHeight;\\n else scroll_height = windowHeight;\\n }\\n $(elemento).mCustomScrollbar({\\n scrollButtons: {\\n enable: false\\n },\\n autoHideScrollbar: $(elemento).hasClass('show-scroll') ? false : true,\\n scrollInertia: 150,\\n theme: \\\"light\\\",\\n set_height: scroll_height,\\n advanced: {\\n updateOnContentResize: true\\n }\\n });\\n //});\\n }\\n}\",\n \"function activateScroll()\\n{\\n windowResize();\\n\\n if (onePageScrollActive)\\n {\\n new fullScroll({\\n mainElement: \\\"main\\\",\\n displayDots: true,\\n dotsPosition: \\\"left\\\",\\n animateTime: 0.7,\\n animateFunction: \\\"ease\\\",\\n });\\n } \\n}\",\n \"get _scrollBottom(){return this._scrollPosition+this._viewportHeight;}\",\n \"function bgenScroll()\\n{\\n // DESCRIPTION:\\n // When using CSS-Targets, a <a href=\\\"#anchor\\\"> is required.\\n // To prevent the page from jumping to the anchor and therefor putting\\n // it on top of the page, the <a>-Tag needs to contain the following event:\\n // onclick=\\\"bgenScroll();\\\"\\n\\n if (window.pageYOffset!= null)\\n {\\n st=window.pageYOffset+\\\"\\\";\\n }\\n\\n if (document.body.scrollWidth!= null)\\n {\\n if (document.body.scrollTop)\\n {\\n st=document.body.scrollTop;\\n }\\n st=document.documentElement.scrollTop;\\n }\\n setTimeout(\\\"window.scroll(0,st)\\\",10);\\n}\",\n \"function initScroll(){var windowH=$(window).height(),newW=windowH/1400*29232+1e3/windowH*3;scrollWidth=newW-$(window).width(),$(\\\".helper\\\").width(newW),$(\\\"#wrapper,.helper\\\").height(windowH),myscroll=new iScroll(\\\"wrapper\\\",{hScrollbar:!0,useTransition:!0,hScroll:!0,vScroll:!1,checkDOMChanges:!0,bounce:!1,scrollbarClass:\\\"myScrollbar\\\"}),\\n// \\nmyscroll.options.onScrollStart=function(){\\\"block\\\"==$(\\\".detail\\\").css(\\\"display\\\")&&($(\\\".detail\\\").css(\\\"display\\\",\\\"none\\\"),$(\\\"#daoyu\\\").attr(\\\"id\\\",\\\"\\\")),\\\"block\\\"==$(\\\".detail-w\\\").css(\\\"display\\\")&&($(\\\".detail-w\\\").css(\\\"display\\\",\\\"none\\\"),$(\\\"#daoyu\\\").attr(\\\"id\\\",\\\"\\\"))},myscroll.options.onScrollEnd=function(){$(\\\".myScrollbarH\\\").hide(),timer&&clearTimeout(timer),timer=setTimeout(function(){clearTimeout(timer),timer=null,myscroll.scrollTo(myscroll.x+scrollWidth,0,Math.abs(5e5*(scrollWidth+myscroll.x)/scrollWidth),\\\"relative\\\")},2e4)},myscroll.scrollTo(scrollWidth,0,5e5,\\\"relative\\\"),$(\\\".myScrollbarH\\\").hide()}\",\n \"function hsClickScroll()\\n {\\n var imageOffset = self.getOffsetRect(this).top; \\n var clientOffset = (docElement.clientHeight-hs.maxHeight) / 2;\\n window.scrollTo(0,imageOffset-clientOffset);\\n }\",\n \"function initializeScrollbar() { \\n $(\\\".mcustomScroll\\\").mCustomScrollbar({ \\n theme:\\\"dark-3\\\",\\n axis:\\\"yx\\\",\\n advanced:{\\n updateOnContentResize: true\\n }\\n });\\n\\n $(\\\".mcustomScroll.mcustomScrollVerticalOnly\\\").mCustomScrollbar({ \\n theme:\\\"dark-3\\\",\\n axis:\\\"y\\\",\\n advanced:{\\n updateOnContentResize: true\\n }\\n });\\n }\",\n \"function customScroll() {\\n $( '.cn-custom-scroll' ).mCustomScrollbar( {\\n theme: \\\"dark-2\\\",\\n scrollEasing: \\\"linear\\\",\\n scrollInertia: 200,\\n } );\\n\\n $( '.cn-custom-scroll-inner' ).bind( 'mousewheel DOMMouseScroll', function( e ) {\\n var e0 = e.originalEvent,\\n delta = e0.wheelDelta || -e0.detail;\\n\\n this.scrollTop += ( delta < 0 ? 1 : -1 ) * 30;\\n e.preventDefault();\\n } );\\n }\",\n \"function throttledScrollEvents() {\\n\\n }\",\n \"function setScrollingArguments0() {\\n elem_position = \\\"0\\\";\\n elem_name = 'body'\\n }\",\n \"function updateScroll(){\\n var treshold = 5;\\n ux.scroll.offsetPrevious = ux.scroll.offset;\\n ux.scroll.offset = $(window).scrollTop();\\n \\n // We compare distance traveled with a defined treshold and report scroll direction\\n if( ux.scroll.offset - ux.scroll.offsetPrevious > treshold ){\\n ux.scroll.direction = 'down';\\n } else if( ux.scroll.offsetPrevious - ux.scroll.offset > treshold ){\\n ux.scroll.direction = 'up';\\n }\\n \\n ux.viewport.visibleTop = ux.scroll.offset\\n ux.viewport.visibleBottom = ux.viewport.height + ux.scroll.offset;\\n}\",\n \"function updateScreenshotScroll() {\\r\\n if (!isMobile) { \\r\\n $('#screenshots').slimScroll(slimOptionsContent); \\r\\n }\\r\\n}\",\n \"function setScrolling()\\n {\\n scrolling = true;\\n }\",\n \"[scroll]() {\\n if (!this.scrollableElement || !this.currentMousePosition) {\\n return;\\n }\\n\\n cancelAnimationFrame(this.scrollAnimationFrame);\\n\\n const { speed, sensitivity } = this.options;\\n\\n const rect = this.scrollableElement.getBoundingClientRect();\\n const bottomCutOff = rect.bottom > window.innerHeight;\\n const topCutOff = rect.top < 0;\\n const cutOff = topCutOff || bottomCutOff;\\n\\n const documentScrollingElement = getDocumentScrollingElement();\\n const scrollableElement = this.scrollableElement;\\n const clientX = this.currentMousePosition.clientX;\\n const clientY = this.currentMousePosition.clientY;\\n\\n if (scrollableElement !== document.body && scrollableElement !== document.documentElement && !cutOff) {\\n const { offsetHeight, offsetWidth } = scrollableElement;\\n\\n if (rect.top + offsetHeight - clientY < sensitivity) {\\n scrollableElement.scrollTop += speed;\\n } else if (clientY - rect.top < sensitivity) {\\n scrollableElement.scrollTop -= speed;\\n }\\n\\n if (rect.left + offsetWidth - clientX < sensitivity) {\\n scrollableElement.scrollLeft += speed;\\n } else if (clientX - rect.left < sensitivity) {\\n scrollableElement.scrollLeft -= speed;\\n }\\n } else {\\n const { innerHeight, innerWidth } = window;\\n\\n if (clientY < sensitivity) {\\n documentScrollingElement.scrollTop -= speed;\\n } else if (innerHeight - clientY < sensitivity) {\\n documentScrollingElement.scrollTop += speed;\\n }\\n\\n if (clientX < sensitivity) {\\n documentScrollingElement.scrollLeft -= speed;\\n } else if (innerWidth - clientX < sensitivity) {\\n documentScrollingElement.scrollLeft += speed;\\n }\\n }\\n\\n this.scrollAnimationFrame = requestAnimationFrame(this[scroll]);\\n }\",\n \"get _scrollBottom(){return this._scrollPosition+this._viewportHeight}\",\n \"function setCustomScrollBars() {\\n /* * * M a l i h u j Q u e r y C u s t o m C o n t e n t S c r o l l e r : BEGIN * * */\\n /*http://manos.malihu.gr/jquery-custom-content-scroller/*/\\n //$(\\\".consoleLogOutput\\\").append('<div class=\\\"consoleLog_helm\\\">$(window).load() event starting.</div>');\\n if (Compass.Global.isInternetExplorer === false) {\\n $(\\\"#LoanDatesPanelContent_helm\\\").mCustomScrollbar({\\n theme: \\\"dark\\\",\\n alwaysShowScrollbar: 0, //Disable scrolll bar when there’s nothing to scroll.\\n //scrollbarPosition: \\\"outside\\\",\\n snapAmount: 26,\\n snapOffset: 3,\\n mouseWheel: {\\n deltaFactor: 28,\\n normalizeDelta: false\\n },\\n callbacks: {\\n onScrollStart: function () {\\n Compass.Helm.hideHelpPopOvers();\\n }\\n },\\n scrollInertia: 500\\n\\n });\\n $(\\\"#LoanContactsListContainer_helm\\\").mCustomScrollbar({\\n theme: \\\"dark\\\",\\n alwaysShowScrollbar: 0, //Disable scrolll bar when there’s nothing to scroll.\\n //scrollbarPosition: \\\"outside\\\",\\n snapAmount: 26,\\n snapOffset: 3,\\n mouseWheel: {\\n deltaFactor: 28,\\n normalizeDelta: false\\n },\\n scrollInertia: 500\\n\\n });\\n }\\n /* * * M a l i h u j Q u e r y C u s t o m C o n t e n t S c r o l l e r : END * * */\\n }\",\n \"function eltdOnWindowScrollHeader() {\\n \\n }\",\n \"scroll() {\\r\\n window.onscroll = () => {\\r\\n let bottomOfWindow = document.documentElement.scrollTop + window.innerHeight >= (document.documentElement.offsetHeight - 200);\\r\\n if (bottomOfWindow) {\\r\\n this.page++\\r\\n if(this.searchedTitle === \\\"\\\"){\\r\\n this.searchPopular()\\r\\n } else if(this.genreSelected === \\\"All\\\"){\\r\\n this.searchFilm()\\r\\n this.searchTv()\\r\\n } else if(this.genreSelected === \\\"Films\\\") {\\r\\n this.searchFilm()\\r\\n } else {\\r\\n this.searchTv()\\r\\n }\\r\\n }\\r\\n };\\r\\n }\",\n \"set scrolling(scrolling) {\\n this._scrolling = scrolling;\\n }\",\n \"function gscroll(cont) {\\n if (cont) {\\n return [{ c: cont, y: 1 }];\\n }\\n }\",\n \"function customScroll() {\\n if ($.fn.mCustomScrollbar) {\\n $('.withScroll').each(function() {\\n $(this).mCustomScrollbar(\\\"destroy\\\");\\n var scroll_height = $(this).data('height') ? $(this).data('height') : 'auto';\\n var data_padding = $(this).data('padding') ? $(this).data('padding') : 0;\\n if ($(this).data('height') == 'window') {\\n thisHeight = $(this).height();\\n windowHeight = $(window).height() - data_padding - 50;\\n if (thisHeight < windowHeight) scroll_height = thisHeight;\\n else scroll_height = windowHeight;\\n }\\n $(this).mCustomScrollbar({\\n scrollButtons: {\\n enable: false\\n },\\n autoHideScrollbar: $(this).hasClass('show-scroll') ? false : true,\\n scrollInertia: 150,\\n theme: \\\"light\\\",\\n set_height: scroll_height,\\n advanced: {\\n updateOnContentResize: true\\n }\\n });\\n });\\n }\\n}\",\n \"function scroll() {\\n d3.select(window)\\n .on('scroll.scroller', position)\\n .on('resize.scroller', resize)\\n resize();\\n let timer = d3.timer(function() {\\n position();\\n timer.stop();\\n });\\n }\",\n \"function fullscreenBioScrolling() {\\r\\n\\t\\t\\t\\t\\t$('.nectar_team_member_overlay .inner-wrap').mousewheel(function (event, delta) {\\r\\n\\t\\t\\t\\t\\t\\tthis.scrollTop -= (delta * 30);\\r\\n\\t\\t\\t\\t\\t\\tevent.preventDefault();\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\",\n \"scrollBehavior() {\\n return { x: 0, y: 0 };\\n }\",\n \"function C16101_KeyWord_Mouse_Wheel_to_Scroll()\\n{ \\ntry{\\n Log.AppendFolder(\\\"C16101_KeyWord_Mouse_Wheel_to_Scroll\\\");\\n InitializationEnviornment.initiliaze();\\n AppLoginLogout.login();\\n passportPOS.listListgroup.Refresh();\\n aqUtils.Delay(1000);\\n var keyWordName =\\\"Trade\\\";\\n WrapperFunction.selectKeywordName(keyWordName);\\n passportPOS.listListgroup.Refresh();\\n aqUtils.Delay(1000);\\n keyWordName =\\\"Reservations\\\";\\n WrapperFunction.selectKeywordName(keyWordName);\\n passportPOS.listListgroup.Refresh();\\n aqUtils.Delay(1000);\\n keyWordName =\\\"Taxes and Fees\\\";\\n WrapperFunction.selectKeywordName(keyWordName);\\n// var wnd = Aliases.Passport_POS.wndApolloRuntimeContentWindow;\\n// var passportPOS = wnd.passportposPassportpos1;\\n// var Keyword_Listgroup =passportPOS.Keyword_Listgroup;\\n// var allItemCnt = Keyword_Listgroup.ItemCount;\\n// temp = Keyword_Listgroup.FindAllChildren(\\\"Visible\\\",\\\"True\\\" ,1, true);\\n// var visibleItemCnt = temp.length;\\n// var counter = allItemCnt - visibleItemCnt; \\n// cnt = Keyword_Listgroup.ChildCount;\\n// flag = false; \\n// while(!flag){\\n// if (counter == 0){\\n// flag = true;\\n// merlinLogError(\\\"Scroll is not working correctly.\\\");\\n// break;\\n// }\\n// counter -- ; \\n// Keyword_Listgroup.MouseWheel(-1);\\n// Keyword_Listgroup.Refresh();\\n// Log.Message(\\\"--\\\"+counter);\\n// cnt = Keyword_Listgroup.ChildCount;\\n// for(let i = 0 ; i < cnt ; i++){\\n// if((Keyword_Listgroup.Child(i).Visible)&&(Keyword_Listgroup.Child(i).Caption == \\\"Promo Codes\\\")){\\n// Keyword_Listgroup.MouseWheel(-1);\\n// flag = true;\\n// Log.Message(\\\"Scroll functionality working correctly.\\\");\\n// break;\\n// }\\n// } \\n// } \\n AppLoginLogout.logout(); \\n } catch (e) {\\n\\t merlinLogError(\\\"Oops! There's some glitch in the script: \\\" + e.message);\\t \\n }\\n finally { \\n\\t Log.PopLogFolder();\\n } \\n}\",\n \"function eltdOnWindowScrollHeaderBehaviour() {\\n }\",\n \"update() {\\n\\t\\tthis.scroll.update();\\n\\t}\",\n \"function resetMaxScrolls()\\n {\\n var offsets = getPageOffsets();\\n\\n var x = offsets[0];\\n minXOffset = x;\\n maxXOffset = x;\\n\\n var y = offsets[1];\\n minYOffset = y;\\n maxYOffset = y;\\n }\",\n \"jump() {\\n const env = this;\\n const container = this['$container']['$node'];\\n container.parentNode.addEventListener( 'scroll', function( e ) {\\n env['$content'].scrollTop = container.parentNode.scrollTop;\\n env['$content'].scrollLeft = container.parentNode.scrollLeft;\\n env.setPage();\\n });\\n }\",\n \"start() {\\n\\t\\tthis.scroll.start();\\n\\t}\",\n \"function onScroll() {\\n lastScrollY = window.scrollY;\\n requestFrame();\\n}\",\n \"handleScroll(){\\n this.setState({\\n detachIOPanel: window.scrollY > 80\\n });\\n }\",\n \"function cs_nicescroll(){\\r\\n\\t\\t'use strict';\\t\\r\\n\\t\\tvar nice = jQuery(\\\"html\\\").niceScroll({mousescrollstep: \\\"20\\\",scrollspeed: \\\"150\\\",}); \\r\\n\\t}\",\n \"handleScroll() {\\n const { scrollPos } = this.state;\\n this.setState({\\n scrollPos: document.body.getBoundingClientRect().top,\\n show: document.body.getBoundingClientRect().top > scrollPos\\n });\\n }\",\n \"function customScroll() {\\r\\n\\t\\tvar windowWidth = $(window).width();\\r\\n\\t\\tif (windowWidth > 991) {\\r\\n\\t\\t\\t// Custom Subpage Scroll\\r\\n\\t\\t\\t$(\\\".pt-page\\\").mCustomScrollbar({\\r\\n\\t\\t\\t\\tscrollInertia: 8\\r\\n\\t\\t\\t});\\r\\n\\r\\n\\t\\t\\t// Custom Header Scroll\\r\\n\\t\\t\\t$(\\\"#site_header\\\").mCustomScrollbar({\\r\\n\\t\\t\\t\\tscrollInertia: 8\\r\\n\\t\\t\\t});\\r\\n\\t\\t} else {\\r\\n\\t\\t\\t$(\\\".pt-page\\\").mCustomScrollbar('destroy');\\r\\n\\r\\n\\t\\t\\t$(\\\"#site_header\\\").mCustomScrollbar('destroy');\\r\\n\\t\\t}\\r\\n\\t}\",\n \"function createScrollBarForAll(){\\n if($('body').hasClass(RESPONSIVE)){\\n removeResponsiveScrollOverflows();\\n }\\n else{\\n forEachSectionAndSlide(createScrollBar);\\n }\\n }\",\n \"function body_scroll(){\\n\\n\\tdrag_manager.body_scroll = document.documentElement.scrollTop;\\n\\n}\",\n \"function handleScrollStop() {\\n scrollEngaged = false;\\n}\",\n \"function onIndexPageScroll() {\\n var clientHeight = $(this).height();\\n var scrollTop = Math.ceil($(this).scrollTop());\\n var scrollHeight = $(document).height();\\n if(scrollTop + clientHeight === scrollHeight){\\n // Get the first then items from the grid, clone them, and add them to the bottom of the grid\\n var $container = $(\\\"#waterfall\\\");\\n var $items = $('div.item', $container);\\n var $itemCount = $items.length;\\n if ($itemCount < 100) {\\n getIndexPicture(appendItemToWaterFall);\\n }\\n }\\n}\",\n \"controlScroll(e) {\\n const event = e.nativeEvent;\\n const interval = Dimensions.get('window').width - (dimensions.widthWeight * 57);\\n\\n let rate = event.contentOffset.x / interval\\n - Math.floor(event.contentOffset.x / interval);\\n let moveTo;\\n if (rate <= 0.25 || rate >= 0.75) {\\n moveTo = (Math.round(event.contentOffset.x / interval));\\n } else {\\n moveTo = (event.contentOffset.x - this.state.scrollBegin >= 0) ?\\n (Math.ceil(event.contentOffset.x / interval)) :\\n (Math.floor(event.contentOffset.x / interval));\\n }\\n\\n if (moveTo > this.props.dataSource._cachedRowCount - 1) {\\n moveTo -= 1;\\n } else if (moveTo < 0) {\\n moveTo = 0;\\n }\\n\\n this.resetListView.scrollTo({\\n x: moveTo * interval,\\n y: 0,\\n animated: true,\\n });\\n\\n }\",\n \"function tinyScroll() {\\n window.scrollBy(0, 1);\\n}\",\n \"function onScroll() {\\n latest = getScrollY();\\n requestTick();\\n }\",\n \"function onScroll() {\\n _lastScrollY = window.scrollY;\\n requestTick();\\n }\",\n \"scrollBehavior () {\\n return { x: 0, y: 0 }\\n }\",\n \"appendScrollBar(){\\n $('body').append('<div class=\\\"scroll position-fixed\\\" style=\\\"width:70px; bottom: 100%;right:1em; transition: all .3s ease-in-out\\\">' +\\n '<img src=\\\"../../File/T--USTC-Software--scroll.png\\\"/>' +\\n '<div class=\\\"position-relative backHead\\\" style=\\\"width: 70px; height: 110px; top: -110px; cursor: pointer;\\\"></div>' +\\n '</div>');\\n }\",\n \"_addScrollBar() {\\n const canvas = this.getCanvas();\\n\\n canvas.add(this._horizontalScroll);\\n canvas.add(this._verticalScroll);\\n\\n if (this.scrollBarTid) {\\n clearTimeout(this.scrollBarTid);\\n }\\n\\n this.scrollBarTid = setTimeout(() => {\\n canvas.remove(this._horizontalScroll);\\n canvas.remove(this._verticalScroll);\\n }, 3000);\\n }\",\n \"function updateScroll() {\\n\\t//gets the div class element that holds the list and the scroll.\\n let element = document.getElementsByClassName(\\\"isgrP\\\")[0];\\n element.scrollTop = element.scrollHeight;\\n}\",\n \"scrollPage(){\\n setTimeout(() => {\\n window.scrollBy(0, this.scrollDirection * AUTO_SCROLL_STEP);\\n if(this.shouldScroll){\\n this.scrollPage();\\n }\\n }, AUTO_SCROLL_DELAY);\\n }\",\n \"updateScroll() {\\n\\t\\t\\tthis.scrollPosition = window.scrollY;\\n\\t\\t}\",\n \"function onscrolling(){if($(document).scrollTop()+$(window).height() + 10/*some px before touch bottom*/ >= $(document).height()){console.log('loading...');loadquery();/*$(\\\"#container\\\").BlocksIt('reload');*/}}\",\n \"function judgeScroll(){\\n\\n for(var j= 1 ; j < num.length ; j++ ){\\n if ( num[j] < (wScrollTop + wH) ) {\\n for ( var k = 0 ; k <= j ; k++){\\n obj.eq(k).addClass('scrollIn');\\n }\\n }\\n }\\n }\",\n \"function updateMaxScrolls()\\n {\\n var offsets = getPageOffsets();\\n\\n var x = offsets[0];\\n if (x < minXOffset)\\n {\\n minXOffset = x;\\n } else if (x > maxXOffset)\\n {\\n maxXOffset = x;\\n }\\n\\n var y = offsets[1];\\n if (y < minYOffset)\\n {\\n minYOffset = y;\\n } else if (y > maxYOffset)\\n {\\n maxYOffset = y;\\n }\\n }\",\n \"startScroll(element) {\\n // VARIABLE QUE NOS PERMITIRA GUARDAR EL NUMERO DEL SCROLL EN EL QUE VA EL ELEMENTO Y COMPARARLO \\n // CON EL OBJETIVO DE VER SI YA LLEGO A SU MAXIMO REINICIALIZAR EL SCROLL DEL ELEMENTO A 0 PARA HACER UNA ANIMACION \\n // INFINITA\\n let maxScroll = 0;\\n var animateScroll = function(){ \\n // SE AUMENTA 1 CADA VEZ QUE SE EJECUTA ESTA FUNCION AL SCROLLLEFT DEL ELEMENTO\\n element.scrollLeft += 1;\\n // ESTE COMPARATIVO REVISA SI EL SCROLL DEL ELEMENTO HA LLEGADO A SU MAXIMO DEBE REINICIALIZAR EL SCROLL A 0, \\n // ES DECIR QUE EL ELEMENTO QUE SE MUESTRE SEA EL PRIMERO\\n if(maxScroll === element.scrollLeft && element.scrollLeft !== 0){\\n element.scrollLeft = 0\\n }\\n // SI EL SCROLL TODAVIA NO LLEGA A SU MAXIMO QUE SE GUARDE EL VALOR DEL SCROLLLEFT DEL ELEMENTO EN LA VARIABLE MAXSCROLL EL CUAL \\n // EN UN FUTURO NOS AYUDARA A COMPARARLO \\n else{\\n maxScroll = element.scrollLeft;\\n }\\n // INTERVALO DE TIEMPO QUE EJECUTARA LA FUNCION HASTA QUE LE DIGAMOS QUE PARE\\n setTime = setTimeout(animateScroll);\\n };\\n // EJECUTAMOS EL CALLBACK DE ESTA FUNCION\\n animateScroll();\\n }\",\n \"function scroll_check(ev,tag){\\n\\n\\tdrag_manager.scroll_value = tag.scrollTop;\\n\\n\\tfolder_positions_find();\\n\\n}\",\n \"function detecteScroll() {\\n var myElement= document.getElementsByClassName(\\\"right-side__product\\\")[0];\\n // console.log(`the position scroll is :${window.scrollY}`);\\n if( myElement.scrollHeight> window.scrollY) {\\n gsap.to('.demande-btn', {opacity:1, height:\\\"auto\\\", display:\\\"block\\\", ease:\\\"ease-in\\\"});\\n } else {\\n gsap.to('.demande-btn', {opacity:0, height:0, display:\\\"none\\\"});\\n }\\n \\n}\",\n \"function Wa(e,t){null!=t&&(Qa(e),e.curOp.scrollTop=(null==e.curOp.scrollTop?e.doc.scrollTop:e.curOp.scrollTop)+t)}\",\n \"function updateScroll () {\\n if (!elements.li[0]) return;\\n var height = elements.li[0].offsetHeight,\\n top = height * ctrl.index,\\n bot = top + height,\\n hgt = elements.scroller.clientHeight,\\n scrollTop = elements.scroller.scrollTop;\\n if (top < scrollTop) {\\n scrollTo(top);\\n } else if (bot > scrollTop + hgt) {\\n scrollTo(bot - hgt);\\n }\\n }\",\n \"function updateScroll () {\\n if (!elements.li[0]) return;\\n var height = elements.li[0].offsetHeight,\\n top = height * ctrl.index,\\n bot = top + height,\\n hgt = elements.scroller.clientHeight,\\n scrollTop = elements.scroller.scrollTop;\\n if (top < scrollTop) {\\n scrollTo(top);\\n } else if (bot > scrollTop + hgt) {\\n scrollTo(bot - hgt);\\n }\\n }\",\n \"function updateScroll () {\\n if (!elements.li[0]) return;\\n var height = elements.li[0].offsetHeight,\\n top = height * ctrl.index,\\n bot = top + height,\\n hgt = elements.scroller.clientHeight,\\n scrollTop = elements.scroller.scrollTop;\\n if (top < scrollTop) {\\n scrollTo(top);\\n } else if (bot > scrollTop + hgt) {\\n scrollTo(bot - hgt);\\n }\\n }\",\n \"scrollBehavior () {\\n return { x: 0, y: 0 }\\n }\",\n \"e_mouseScroll(e)\\n\\t{\\n\\t\\t\\n\\t}\",\n \"function post_load_setup() {\\n update_scroll_pad();\\n}\",\n \"function scrollHandler()\\n {\\n updateMaxScrolls();\\n activityHandler();\\n }\",\n \"function load(){\\r\\n\\t// window.location.hash=\\\"#third\\\";\\r\\n\\tv = document.getElementById('scrollBody');\\r\\n\\tv.scrollLeft = (pageWidth*2/5);\\r\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6926268","0.67611235","0.6744457","0.6743667","0.6718017","0.6713843","0.66943103","0.66943103","0.66943103","0.66943103","0.66652805","0.66652805","0.6653458","0.6641574","0.6626136","0.66128874","0.66128874","0.66011393","0.6569429","0.6566255","0.65203905","0.6513874","0.6513874","0.6513874","0.6513874","0.6508212","0.6495917","0.6495917","0.64913535","0.6483231","0.64642507","0.64578205","0.64512116","0.6445202","0.6442732","0.6419575","0.6413681","0.64093286","0.6388245","0.63871294","0.63793486","0.6375545","0.6373094","0.6362516","0.63546336","0.63461554","0.63440025","0.6333989","0.6327512","0.63223195","0.6313869","0.63135165","0.6307112","0.6299659","0.62961423","0.6286526","0.6262682","0.6261962","0.6225093","0.62233907","0.62137437","0.62109244","0.6209781","0.6208811","0.6207959","0.6205782","0.61965823","0.61905086","0.6181823","0.61778766","0.6177119","0.6170543","0.6165759","0.61588037","0.6157919","0.61552155","0.61542827","0.61531186","0.6151642","0.61515087","0.61478883","0.61477476","0.61442095","0.6142506","0.61285317","0.6118816","0.61158884","0.61129475","0.61124337","0.6098626","0.6097404","0.6092328","0.6087394","0.60823965","0.60823965","0.60823965","0.6079917","0.6058555","0.605325","0.6047952","0.60444784"],"string":"[\n \"0.6926268\",\n \"0.67611235\",\n \"0.6744457\",\n \"0.6743667\",\n \"0.6718017\",\n \"0.6713843\",\n \"0.66943103\",\n \"0.66943103\",\n \"0.66943103\",\n \"0.66943103\",\n \"0.66652805\",\n \"0.66652805\",\n \"0.6653458\",\n \"0.6641574\",\n \"0.6626136\",\n \"0.66128874\",\n \"0.66128874\",\n \"0.66011393\",\n \"0.6569429\",\n \"0.6566255\",\n \"0.65203905\",\n \"0.6513874\",\n \"0.6513874\",\n \"0.6513874\",\n \"0.6513874\",\n \"0.6508212\",\n \"0.6495917\",\n \"0.6495917\",\n \"0.64913535\",\n \"0.6483231\",\n \"0.64642507\",\n \"0.64578205\",\n \"0.64512116\",\n \"0.6445202\",\n \"0.6442732\",\n \"0.6419575\",\n \"0.6413681\",\n \"0.64093286\",\n \"0.6388245\",\n \"0.63871294\",\n \"0.63793486\",\n \"0.6375545\",\n \"0.6373094\",\n \"0.6362516\",\n \"0.63546336\",\n \"0.63461554\",\n \"0.63440025\",\n \"0.6333989\",\n \"0.6327512\",\n \"0.63223195\",\n \"0.6313869\",\n \"0.63135165\",\n \"0.6307112\",\n \"0.6299659\",\n \"0.62961423\",\n \"0.6286526\",\n \"0.6262682\",\n \"0.6261962\",\n \"0.6225093\",\n \"0.62233907\",\n \"0.62137437\",\n \"0.62109244\",\n \"0.6209781\",\n \"0.6208811\",\n \"0.6207959\",\n \"0.6205782\",\n \"0.61965823\",\n \"0.61905086\",\n \"0.6181823\",\n \"0.61778766\",\n \"0.6177119\",\n \"0.6170543\",\n \"0.6165759\",\n \"0.61588037\",\n \"0.6157919\",\n \"0.61552155\",\n \"0.61542827\",\n \"0.61531186\",\n \"0.6151642\",\n \"0.61515087\",\n \"0.61478883\",\n \"0.61477476\",\n \"0.61442095\",\n \"0.6142506\",\n \"0.61285317\",\n \"0.6118816\",\n \"0.61158884\",\n \"0.61129475\",\n \"0.61124337\",\n \"0.6098626\",\n \"0.6097404\",\n \"0.6092328\",\n \"0.6087394\",\n \"0.60823965\",\n \"0.60823965\",\n \"0.60823965\",\n \"0.6079917\",\n \"0.6058555\",\n \"0.605325\",\n \"0.6047952\",\n \"0.60444784\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4672,"cells":{"query":{"kind":"string","value":"Load Drive API client library."},"document":{"kind":"string","value":"loadDriveApi() {\n window.gapi.client.load('drive', 'v3');\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 loadDriveApi() {\n\tgapi.client.load('drive', 'v3', buscarArquivoHoje);\n}","function apiClientLoad() {\n\n //gapi.client.load('oauth2', 'v2', apiClientLoaded);\n gapi.client.load('plus', 'v1', apiClientLoaded);\n}","loadDriveApi() {\n var event = new CustomEvent(\"startloaddrive\");\n document.dispatchEvent(event);\n gapi.client.load('drive', 'v2', () => { this.listFolder(); });\n }","function loadLibraries() {\n gapi.load('client:auth2', {'callback': onClientLoad});\n gapi.load('picker', {'callback': () => { pickerApiLoaded = true; }});\n}","handleClientLoad() {\n gapi.load(\"client:auth2\", this.initClient);\n }","function handleClientLoad() {\n // Load the API client and auth2 library\n gapi.load('client:auth2', initClient);\n}","handleClientLoad() {\n const script = document.createElement(\"script\");\n script.onload = () => {\n // Gapi isn't available immediately so we have to wait until it is to use gapi.\n this.loadClientWhenGapiReady(script);\n //window['gapi'].load('client:auth2', this.initClient);\n };\n script.src = \"https://apis.google.com/js/client.js\";\n document.body.appendChild(script);\n }","function handleClientLoad() {\n // gapi.load(\"auth:client,drive-realtime,drive-share\", callback);\n checkAuth();\n}","function initializeApi() {\n gapi.client.load('storage', API_VERSION);\n}","handleClientLoad() {\n this.gapi = window[\"gapi\"];\n var script = document.createElement(\"script\");\n script.src = \"https://apis.google.com/js/api.js\";\n document.body.appendChild(script);\n script.onload = () => {\n window[\"gapi\"].load(\"client:auth2\", this.initClient);\n };\n }","function handleClientLoad() {\n gapi.load(\"client\", initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\n gapi.load('client:auth2', initClient)\n}","function handleClientLoad() {\r\n gapi.load('client:auth2', initClient); //General syntax for gapi.load(): gapi.load(libraries, callbackFunction);\r\n}","function handleClientLoad() {\n gapi.load(\"client:auth2\", initClient);\n}","function handleClientLoad() {\n gapi.load(\"client:auth2\", initClient);\n}","function handleClientLoad() {\n gapi.load(\"client:auth2\", initClient);\n}","function handleClientLoad() {\n gapi.load(\"client:auth2\", initClient);\n}","function handleClientLoad() {\n gapi.load(\"client:auth2\", initClient);\n}","function loadCalendarApi() {\n console.log(\"loading calendar library\");\n gapi.client.load('calendar', 'v3', init);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\n gapi.load('client', initClient);\n}","async load() {\n\t\tif(gapi.client && gapi.client.oauth2) return gapi;\n\n\t\tconst apis = [{ \"name\": 'oauth2', \"version\": 'v2' }];\n\t\tvar options = {\n\t\t\tdiscoveryDocs: apis.map(api => this.apiToDiscoveryDoc(api)),\n\t\t\tclientId: this.clientId,\n\t\t\tscope: this.scopesString\n\t\t};\n\t\tawait this.loadAuth2();\n\t\t//await this.loadClientAuth2();\n\t\tawait this.initGapi(options);\n\t\tawait this.initAuth2();\n\t\tawait this.getCurrentUser();\n\t\treturn gapi;\n\t}","function handleClientLoad() {\r\n gapi.load(\"client:auth2\", initClient);\r\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function handleClientLoad() {\ngapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n}","function loadCalendarApi() {\n\tgapi.client.load('calendar', 'v3');\n}","function loadCalendarApiForImport() {\n gapi.client.load('calendar', 'v3', importGoogleCalendar);\n }","function handleClientLoad() {\r\n gapi.load('client:auth2', initClient);\r\n}","function handleClientLoad() {\r\n \"use strict\";\r\n gapi.load('client:auth2', initClient);\r\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n }","function loadAPIClientInterfaces() {\n gapi.client.init({apiKey: 'AIzaSyBdL3GreHV24Qn-xae-PAJchrK_PSepYXA'})\n gapi.client.load('youtube', 'v3', function() {\n handleAPILoaded();\n });\n}","async loadApi(api){\n if(!gapi.client) throw \"Must call load first\";\n\n const doc = this.getDiscoveryDoc(api);\n return gapi.client.load(doc);\n }","function handleClientLoad() {\n\tgapi.load('client:auth2', initClient);\n}","function handleClientLoad() {\n\tgapi.load('client:auth2', initClient);\n}","function handleClientLoad(clientid, apikey, appid, callback) {\n post_google_init = callback;\n // Load the API's client and auth2 modules.\n // Call the initClient function after the modules load.\n google_clientid = clientid;\n google_apikey = apikey;\n google_appid = appid;\n gapi.load('client:auth2', initClient);\n }","async function loadGapi() {\n //\n // Load gapi.js\n //\n if (window.gapi) {\n console.info('gapi.js already loaded.')\n } else {\n await logAction.promise(`loading ${GapiJavaScriptUrl}`, (resolve, reject) =>\n loadjs(GapiJavaScriptUrl, resolve, reject)\n )\n }\n\n //\n // Load and initialize client and auth2 libraries\n //\n let gapi = window.gapi\n await logAction.promise(`loading gapi modules ${GapiLibraries}`, (resolve, reject) =>\n gapi.load(GapiLibraries, { callback: resolve, onerror: reject })\n )\n return gapi\n}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n init();\n}","function handleClientLoad() {\n console.log(\"client load\")\n gapi.load('client:auth2', initClient);\n}","function initializeApi() {\r\n gapi.client.load('compute', API_VERSION);\r\n}","function initClient() {\r\n gapi.client.init({\r\n discoveryDocs: DISCOVERY_DOCS,\r\n clientId: CLIENT_ID,\r\n scope: SCOPES\r\n });\r\n}","function loadSheetsApi() {\n\tvar discoveryUrl = 'https://sheets.googleapis.com/$discovery/rest?version=v4';\n\tgapi.client.load(discoveryUrl);\n}","function loadAPIClientInterfaces() {\n gapi.client.load('youtube', 'v3', function() {\n handleAPILoaded();\n });\n}","function handleClientLoad() {\n window.gapi.load('client:auth2', initClient);\n }","function loadCalendarApi() {\n\tgapi.client.load('calendar', 'v3', getEvent);\n}","function handleClientLoad() {\n window.gapi.load('client:auth2', initClient);\n}","function loadCalendarApi() {\n gapi.client.load('calendar', 'v3', createEvent);\n }","function handleClientLoad() {\n console.log('Gapi client loaded successfully');\n console.log('Loading client module');\n gapi.load('client', () => {console.log('Google api client module loaded')});\n}","function initClient() {\n gapi.client.init({\n apiKey: API_KEY,\n discoveryDocs: DISCOVERY_DOCS,\n scope: SCOPES\n }).then(function () {\n getInventory();\n }, function(error) {\n console.error(JSON.stringify(error, null, 2));\n });\n}","function init() {\n gapi.load('client:auth2', initAuth);\n}","function loadGmailApi() {\n gapi.client.setApiKey('AIzaSyA5d9KwNG-4h5BbbWsiLxeUnMlj1El8k84');\n gapi.client.load('gmail', 'v1');\n console.log(\"GAPI LOADED\");\n}","function handleClientLoad() { \n gapi.load('client:auth2', initClientCalendar);\n gapi.load('client:auth2', initClientPeople);\n console.log('people and calendar clients loaded');\n \t}","function handleClientLoad() {\n gapi.load('client:auth2', initClient);\n initSonos();\n initLights();\n}","setDriveApi(drive) {\n this.drive = drive;\n this.save.drive = drive;\n this.load.drive = drive;\n }","function handleClientLoad() {\n gapi.client.setApiKey(apiKey);\n window.setTimeout(checkAuth, 1);\n}","function handleClientLoad() {\n\t gapi.client.setApiKey(apiKey);\n\t window.setTimeout(checkAuth,1);\n \t}","async function wrapLoad() {\n return new Promise((resolve, reject) => {\n let return_link = '';\n window.gapi.load(\"client\", () => {\n return_link = initClient();\n resolve(return_link);\n });\n });\n }","function loadGmailApi() {\n gapi.client.load('gmail', 'v1', listLabels);\n }","function loadGapi() {\n //'use strict';\n gapi.client.load('cycleendpoint', 'v1', function () {\n console.log(\"API Loaded\");\n // fetchData();\n });\n}","function onApiLoad() {\n gapi.load('auth', {'callback': onAuthApiLoad});\n gapi.load('picker', {'callback': onPickerApiLoad});\n }","function loadGmailApi() {\ngapi.client.load('gmail', 'v1', listMessages);\n}","function onClientLoad() {\n gapi.client.init({\n 'apiKey': developerKey,\n 'discoveryDocs': discoveryDoc,\n 'clientId': clientId,\n 'scope': scope,\n 'immediate': false\n }).then(function() {\n // initialize global GoogleAuth object and assign listener function\n googleAuth = gapi.auth2.getAuthInstance();\n googleAuth.isSignedIn.listen(updateSignInStatus);\n }).then(function() {\n // add 'onChange' event for file input tag\n if(input_os_file) {\n input_os_file.addEventListener(\"change\", updateOSFileName);\n }\n // add default 'onClick' event for the button and remove disabled property\n if(button_import) {\n button_import.addEventListener(\"click\", loadFilePicker);\n button_import.disabled = false;\n }\n }).catch(function(error) {\n console.log(\"Something went wrong: \" + error);\n });\n}","function initClient() {\n gapi.client\n .init({\n apiKey: API_KEY,\n clientId: CLIENT_ID,\n discoveryDocs: DISCOVERY_DOCS,\n scope: SCOPES,\n })\n .then(\n function () {\n // Listen for sign-in state changes.\n gapi.auth2.getAuthInstance().isSignedIn.listen(updateSigninStatus);\n\n // Handle the initial sign-in state.\n updateSigninStatus(gapi.auth2.getAuthInstance().isSignedIn.get());\n authorizeButton.onclick = handleAuthClick;\n signoutButton.onclick = handleSignoutClick;\n listFilesButton.onclick = handleListFilesClick;\n listFoldersButton.onclick = handleListFoldersClick;\n listSpreadsheetsButton.onclick = handleListSpreadsheetsClick;\n createFolderButton.onclick = handleCreateFolderClick;\n createSpreadsheetButton.onclick = handleCreateSpreadsheetClick;\n createShoppingListButton.onclick = handleCreateShoppingListClick;\n createNewItemButton.onclick = handleCreateNewItemClick;\n shareButton.onclick = handleShareFile;\n },\n function (error) {\n appendPre(JSON.stringify(error, null, 2));\n }\n );\n}","function onApiLoad() { \n\t\t\t\tgapi.load('auth', {'callback': onAuthApiLoad});\n\t\t\t\tgapi.load('picker', {'callback': onPickerApiLoad});\n\t\t }","function loadAPI() {\n // wait for all classes to be loaded\n // on attend que les classes soient chargées\n if (checkApiLoading('loadAPI();',['OpenLayers','Geoportal','Geoportal.Viewer','Geoportal.Viewer.Standard'])===false) {\n return;\n }\n\n // load API keys configuration, then load the interface\n // on charge la configuration de la clef API, puis on charge l'application\n Geoportal.GeoRMHandler.getConfig(['123454565444344'], null,null, {\n onContractsComplete: initMap\n });\n}","function loadAPI() {\n // wait for all classes to be loaded\n // on attend que les classes soient chargées\n if (checkApiLoading('loadAPI();',['OpenLayers','Geoportal','Geoportal.Viewer','Geoportal.Viewer.Default'])===false) {\n return;\n }\n\n // load API keys configuration, then load the interface\n // on charge la configuration de la clef API, puis on charge l'application\n Geoportal.GeoRMHandler.getConfig(['nhf8wztv3m9wglcda6n6cbuf'], null,null, {\n onContractsComplete: initMap\n });\n}","function handleClientLoad() {\r\n\tgapi.client.setApiKey(apiKey);\r\n\twindow.setTimeout(checkAuth, 1);\r\n\tloadYoutubeApi()\r\n}","function loadAPI() {\n // wait for all classes to be loaded\n // on attend que les classes soient chargées\n if (checkApiLoading('loadAPI();',['OpenLayers','Geoportal','Geoportal.Viewer','Geoportal.Viewer.Simple'])===false) {\n return;\n }\n\n // load API keys configuration, then load the interface\n // on charge la configuration de la clef API, puis on charge l'application\n Geoportal.GeoRMHandler.getConfig(['nhf8wztv3m9wglcda6n6cbuf'], null,null, {\n onContractsComplete: initMap\n });\n}","function loadCalendarApi() {\n gapi.auth.authorize(\n {client_id: oauth2.client_id, scope: oauth2.scopes, immediate: true},\n function(){\n gapi.client.load('calendar', 'v3', function(){\n console.log(\"calendar api loaded.\");\n });\n });\n return false;\n }","function loadGmailApi() {\n console.log(\"gmail.js:loadGmailApi\");\n gapi.client.load('gmail', 'v1', getInboxState);\n}","async initClient() {\n this.gapi = window[\"gapi\"];\n const config = await this.getConfig();\n this.gapi.client\n .init(config.data)\n .then(() => {\n // Get the google auth instance\n this.GoogleAuth = this.gapi.auth2.getAuthInstance();\n if (!this.GoogleAuth) {\n throw new Error(\"Could not authorize Google API\");\n }\n\n // Listen for sign-in state changes.\n this.GoogleAuth.isSignedIn.listen(this.updateSigninStatus);\n\n // Handle the initial sign-in state.\n this.updateSigninStatus(this.GoogleAuth.isSignedIn.get());\n\n // Call the callback\n if (this.onLoadCallback) {\n this.onLoadCallback(this.signedIn);\n }\n })\n .catch((e) => {\n console.error(\"Error in setting up the google client:\");\n console.error(e);\n });\n }","function init() {\n gapi.load('auth2', function() {});\n}","function loadLibrary() {\n\n if ( loaded ) {\n return onLibraryLoaded();\n }\n\n var googletag,\n gads,\n useSSL,\n node,\n readyStateLoaded = false\n ;\n\n window.googletag = window.googletag || {};\n window.googletag.cmd = window.googletag.cmd || [];\n\n // Called when GPT is Available\n window.googletag.cmd.push( onLibraryLoaded )\n\n gads = document.createElement( 'script' );\n gads.async = true;\n gads.type = 'text/javascript';\n gads.src = 'https://www.googletagservices.com/tag/js/gpt.js';\n\n node = document.getElementsByTagName( 'script' )[0];\n node.parentNode.insertBefore( gads, node );\n\n }","function onClientLoad() {\n gapi.client.load('youtube', 'v3', onYouTubeApiLoad);\n }","async function loadClient() {\n client = await mongodb.MongoClient.connect(url, { useNewUrlParser: true })\n}","function onApiLoad() {\n gapi.load('auth', {'callback': onAuthApiLoad});\n gapi.load('picker', {'callback': onPickerApiLoad});\n}"],"string":"[\n \"function loadDriveApi() {\\n\\tgapi.client.load('drive', 'v3', buscarArquivoHoje);\\n}\",\n \"function apiClientLoad() {\\n\\n //gapi.client.load('oauth2', 'v2', apiClientLoaded);\\n gapi.client.load('plus', 'v1', apiClientLoaded);\\n}\",\n \"loadDriveApi() {\\n var event = new CustomEvent(\\\"startloaddrive\\\");\\n document.dispatchEvent(event);\\n gapi.client.load('drive', 'v2', () => { this.listFolder(); });\\n }\",\n \"function loadLibraries() {\\n gapi.load('client:auth2', {'callback': onClientLoad});\\n gapi.load('picker', {'callback': () => { pickerApiLoaded = true; }});\\n}\",\n \"handleClientLoad() {\\n gapi.load(\\\"client:auth2\\\", this.initClient);\\n }\",\n \"function handleClientLoad() {\\n // Load the API client and auth2 library\\n gapi.load('client:auth2', initClient);\\n}\",\n \"handleClientLoad() {\\n const script = document.createElement(\\\"script\\\");\\n script.onload = () => {\\n // Gapi isn't available immediately so we have to wait until it is to use gapi.\\n this.loadClientWhenGapiReady(script);\\n //window['gapi'].load('client:auth2', this.initClient);\\n };\\n script.src = \\\"https://apis.google.com/js/client.js\\\";\\n document.body.appendChild(script);\\n }\",\n \"function handleClientLoad() {\\n // gapi.load(\\\"auth:client,drive-realtime,drive-share\\\", callback);\\n checkAuth();\\n}\",\n \"function initializeApi() {\\n gapi.client.load('storage', API_VERSION);\\n}\",\n \"handleClientLoad() {\\n this.gapi = window[\\\"gapi\\\"];\\n var script = document.createElement(\\\"script\\\");\\n script.src = \\\"https://apis.google.com/js/api.js\\\";\\n document.body.appendChild(script);\\n script.onload = () => {\\n window[\\\"gapi\\\"].load(\\\"client:auth2\\\", this.initClient);\\n };\\n }\",\n \"function handleClientLoad() {\\n gapi.load(\\\"client\\\", initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient)\\n}\",\n \"function handleClientLoad() {\\r\\n gapi.load('client:auth2', initClient); //General syntax for gapi.load(): gapi.load(libraries, callbackFunction);\\r\\n}\",\n \"function handleClientLoad() {\\n gapi.load(\\\"client:auth2\\\", initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load(\\\"client:auth2\\\", initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load(\\\"client:auth2\\\", initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load(\\\"client:auth2\\\", initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load(\\\"client:auth2\\\", initClient);\\n}\",\n \"function loadCalendarApi() {\\n console.log(\\\"loading calendar library\\\");\\n gapi.client.load('calendar', 'v3', init);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\n gapi.load('client', initClient);\\n}\",\n \"async load() {\\n\\t\\tif(gapi.client && gapi.client.oauth2) return gapi;\\n\\n\\t\\tconst apis = [{ \\\"name\\\": 'oauth2', \\\"version\\\": 'v2' }];\\n\\t\\tvar options = {\\n\\t\\t\\tdiscoveryDocs: apis.map(api => this.apiToDiscoveryDoc(api)),\\n\\t\\t\\tclientId: this.clientId,\\n\\t\\t\\tscope: this.scopesString\\n\\t\\t};\\n\\t\\tawait this.loadAuth2();\\n\\t\\t//await this.loadClientAuth2();\\n\\t\\tawait this.initGapi(options);\\n\\t\\tawait this.initAuth2();\\n\\t\\tawait this.getCurrentUser();\\n\\t\\treturn gapi;\\n\\t}\",\n \"function handleClientLoad() {\\r\\n gapi.load(\\\"client:auth2\\\", initClient);\\r\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function handleClientLoad() {\\ngapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function loadCalendarApi() {\\n\\tgapi.client.load('calendar', 'v3');\\n}\",\n \"function loadCalendarApiForImport() {\\n gapi.client.load('calendar', 'v3', importGoogleCalendar);\\n }\",\n \"function handleClientLoad() {\\r\\n gapi.load('client:auth2', initClient);\\r\\n}\",\n \"function handleClientLoad() {\\r\\n \\\"use strict\\\";\\r\\n gapi.load('client:auth2', initClient);\\r\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n }\",\n \"function loadAPIClientInterfaces() {\\n gapi.client.init({apiKey: 'AIzaSyBdL3GreHV24Qn-xae-PAJchrK_PSepYXA'})\\n gapi.client.load('youtube', 'v3', function() {\\n handleAPILoaded();\\n });\\n}\",\n \"async loadApi(api){\\n if(!gapi.client) throw \\\"Must call load first\\\";\\n\\n const doc = this.getDiscoveryDoc(api);\\n return gapi.client.load(doc);\\n }\",\n \"function handleClientLoad() {\\n\\tgapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad() {\\n\\tgapi.load('client:auth2', initClient);\\n}\",\n \"function handleClientLoad(clientid, apikey, appid, callback) {\\n post_google_init = callback;\\n // Load the API's client and auth2 modules.\\n // Call the initClient function after the modules load.\\n google_clientid = clientid;\\n google_apikey = apikey;\\n google_appid = appid;\\n gapi.load('client:auth2', initClient);\\n }\",\n \"async function loadGapi() {\\n //\\n // Load gapi.js\\n //\\n if (window.gapi) {\\n console.info('gapi.js already loaded.')\\n } else {\\n await logAction.promise(`loading ${GapiJavaScriptUrl}`, (resolve, reject) =>\\n loadjs(GapiJavaScriptUrl, resolve, reject)\\n )\\n }\\n\\n //\\n // Load and initialize client and auth2 libraries\\n //\\n let gapi = window.gapi\\n await logAction.promise(`loading gapi modules ${GapiLibraries}`, (resolve, reject) =>\\n gapi.load(GapiLibraries, { callback: resolve, onerror: reject })\\n )\\n return gapi\\n}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n init();\\n}\",\n \"function handleClientLoad() {\\n console.log(\\\"client load\\\")\\n gapi.load('client:auth2', initClient);\\n}\",\n \"function initializeApi() {\\r\\n gapi.client.load('compute', API_VERSION);\\r\\n}\",\n \"function initClient() {\\r\\n gapi.client.init({\\r\\n discoveryDocs: DISCOVERY_DOCS,\\r\\n clientId: CLIENT_ID,\\r\\n scope: SCOPES\\r\\n });\\r\\n}\",\n \"function loadSheetsApi() {\\n\\tvar discoveryUrl = 'https://sheets.googleapis.com/$discovery/rest?version=v4';\\n\\tgapi.client.load(discoveryUrl);\\n}\",\n \"function loadAPIClientInterfaces() {\\n gapi.client.load('youtube', 'v3', function() {\\n handleAPILoaded();\\n });\\n}\",\n \"function handleClientLoad() {\\n window.gapi.load('client:auth2', initClient);\\n }\",\n \"function loadCalendarApi() {\\n\\tgapi.client.load('calendar', 'v3', getEvent);\\n}\",\n \"function handleClientLoad() {\\n window.gapi.load('client:auth2', initClient);\\n}\",\n \"function loadCalendarApi() {\\n gapi.client.load('calendar', 'v3', createEvent);\\n }\",\n \"function handleClientLoad() {\\n console.log('Gapi client loaded successfully');\\n console.log('Loading client module');\\n gapi.load('client', () => {console.log('Google api client module loaded')});\\n}\",\n \"function initClient() {\\n gapi.client.init({\\n apiKey: API_KEY,\\n discoveryDocs: DISCOVERY_DOCS,\\n scope: SCOPES\\n }).then(function () {\\n getInventory();\\n }, function(error) {\\n console.error(JSON.stringify(error, null, 2));\\n });\\n}\",\n \"function init() {\\n gapi.load('client:auth2', initAuth);\\n}\",\n \"function loadGmailApi() {\\n gapi.client.setApiKey('AIzaSyA5d9KwNG-4h5BbbWsiLxeUnMlj1El8k84');\\n gapi.client.load('gmail', 'v1');\\n console.log(\\\"GAPI LOADED\\\");\\n}\",\n \"function handleClientLoad() { \\n gapi.load('client:auth2', initClientCalendar);\\n gapi.load('client:auth2', initClientPeople);\\n console.log('people and calendar clients loaded');\\n \\t}\",\n \"function handleClientLoad() {\\n gapi.load('client:auth2', initClient);\\n initSonos();\\n initLights();\\n}\",\n \"setDriveApi(drive) {\\n this.drive = drive;\\n this.save.drive = drive;\\n this.load.drive = drive;\\n }\",\n \"function handleClientLoad() {\\n gapi.client.setApiKey(apiKey);\\n window.setTimeout(checkAuth, 1);\\n}\",\n \"function handleClientLoad() {\\n\\t gapi.client.setApiKey(apiKey);\\n\\t window.setTimeout(checkAuth,1);\\n \\t}\",\n \"async function wrapLoad() {\\n return new Promise((resolve, reject) => {\\n let return_link = '';\\n window.gapi.load(\\\"client\\\", () => {\\n return_link = initClient();\\n resolve(return_link);\\n });\\n });\\n }\",\n \"function loadGmailApi() {\\n gapi.client.load('gmail', 'v1', listLabels);\\n }\",\n \"function loadGapi() {\\n //'use strict';\\n gapi.client.load('cycleendpoint', 'v1', function () {\\n console.log(\\\"API Loaded\\\");\\n // fetchData();\\n });\\n}\",\n \"function onApiLoad() {\\n gapi.load('auth', {'callback': onAuthApiLoad});\\n gapi.load('picker', {'callback': onPickerApiLoad});\\n }\",\n \"function loadGmailApi() {\\ngapi.client.load('gmail', 'v1', listMessages);\\n}\",\n \"function onClientLoad() {\\n gapi.client.init({\\n 'apiKey': developerKey,\\n 'discoveryDocs': discoveryDoc,\\n 'clientId': clientId,\\n 'scope': scope,\\n 'immediate': false\\n }).then(function() {\\n // initialize global GoogleAuth object and assign listener function\\n googleAuth = gapi.auth2.getAuthInstance();\\n googleAuth.isSignedIn.listen(updateSignInStatus);\\n }).then(function() {\\n // add 'onChange' event for file input tag\\n if(input_os_file) {\\n input_os_file.addEventListener(\\\"change\\\", updateOSFileName);\\n }\\n // add default 'onClick' event for the button and remove disabled property\\n if(button_import) {\\n button_import.addEventListener(\\\"click\\\", loadFilePicker);\\n button_import.disabled = false;\\n }\\n }).catch(function(error) {\\n console.log(\\\"Something went wrong: \\\" + error);\\n });\\n}\",\n \"function initClient() {\\n gapi.client\\n .init({\\n apiKey: API_KEY,\\n clientId: CLIENT_ID,\\n discoveryDocs: DISCOVERY_DOCS,\\n scope: SCOPES,\\n })\\n .then(\\n function () {\\n // Listen for sign-in state changes.\\n gapi.auth2.getAuthInstance().isSignedIn.listen(updateSigninStatus);\\n\\n // Handle the initial sign-in state.\\n updateSigninStatus(gapi.auth2.getAuthInstance().isSignedIn.get());\\n authorizeButton.onclick = handleAuthClick;\\n signoutButton.onclick = handleSignoutClick;\\n listFilesButton.onclick = handleListFilesClick;\\n listFoldersButton.onclick = handleListFoldersClick;\\n listSpreadsheetsButton.onclick = handleListSpreadsheetsClick;\\n createFolderButton.onclick = handleCreateFolderClick;\\n createSpreadsheetButton.onclick = handleCreateSpreadsheetClick;\\n createShoppingListButton.onclick = handleCreateShoppingListClick;\\n createNewItemButton.onclick = handleCreateNewItemClick;\\n shareButton.onclick = handleShareFile;\\n },\\n function (error) {\\n appendPre(JSON.stringify(error, null, 2));\\n }\\n );\\n}\",\n \"function onApiLoad() { \\n\\t\\t\\t\\tgapi.load('auth', {'callback': onAuthApiLoad});\\n\\t\\t\\t\\tgapi.load('picker', {'callback': onPickerApiLoad});\\n\\t\\t }\",\n \"function loadAPI() {\\n // wait for all classes to be loaded\\n // on attend que les classes soient chargées\\n if (checkApiLoading('loadAPI();',['OpenLayers','Geoportal','Geoportal.Viewer','Geoportal.Viewer.Standard'])===false) {\\n return;\\n }\\n\\n // load API keys configuration, then load the interface\\n // on charge la configuration de la clef API, puis on charge l'application\\n Geoportal.GeoRMHandler.getConfig(['123454565444344'], null,null, {\\n onContractsComplete: initMap\\n });\\n}\",\n \"function loadAPI() {\\n // wait for all classes to be loaded\\n // on attend que les classes soient chargées\\n if (checkApiLoading('loadAPI();',['OpenLayers','Geoportal','Geoportal.Viewer','Geoportal.Viewer.Default'])===false) {\\n return;\\n }\\n\\n // load API keys configuration, then load the interface\\n // on charge la configuration de la clef API, puis on charge l'application\\n Geoportal.GeoRMHandler.getConfig(['nhf8wztv3m9wglcda6n6cbuf'], null,null, {\\n onContractsComplete: initMap\\n });\\n}\",\n \"function handleClientLoad() {\\r\\n\\tgapi.client.setApiKey(apiKey);\\r\\n\\twindow.setTimeout(checkAuth, 1);\\r\\n\\tloadYoutubeApi()\\r\\n}\",\n \"function loadAPI() {\\n // wait for all classes to be loaded\\n // on attend que les classes soient chargées\\n if (checkApiLoading('loadAPI();',['OpenLayers','Geoportal','Geoportal.Viewer','Geoportal.Viewer.Simple'])===false) {\\n return;\\n }\\n\\n // load API keys configuration, then load the interface\\n // on charge la configuration de la clef API, puis on charge l'application\\n Geoportal.GeoRMHandler.getConfig(['nhf8wztv3m9wglcda6n6cbuf'], null,null, {\\n onContractsComplete: initMap\\n });\\n}\",\n \"function loadCalendarApi() {\\n gapi.auth.authorize(\\n {client_id: oauth2.client_id, scope: oauth2.scopes, immediate: true},\\n function(){\\n gapi.client.load('calendar', 'v3', function(){\\n console.log(\\\"calendar api loaded.\\\");\\n });\\n });\\n return false;\\n }\",\n \"function loadGmailApi() {\\n console.log(\\\"gmail.js:loadGmailApi\\\");\\n gapi.client.load('gmail', 'v1', getInboxState);\\n}\",\n \"async initClient() {\\n this.gapi = window[\\\"gapi\\\"];\\n const config = await this.getConfig();\\n this.gapi.client\\n .init(config.data)\\n .then(() => {\\n // Get the google auth instance\\n this.GoogleAuth = this.gapi.auth2.getAuthInstance();\\n if (!this.GoogleAuth) {\\n throw new Error(\\\"Could not authorize Google API\\\");\\n }\\n\\n // Listen for sign-in state changes.\\n this.GoogleAuth.isSignedIn.listen(this.updateSigninStatus);\\n\\n // Handle the initial sign-in state.\\n this.updateSigninStatus(this.GoogleAuth.isSignedIn.get());\\n\\n // Call the callback\\n if (this.onLoadCallback) {\\n this.onLoadCallback(this.signedIn);\\n }\\n })\\n .catch((e) => {\\n console.error(\\\"Error in setting up the google client:\\\");\\n console.error(e);\\n });\\n }\",\n \"function init() {\\n gapi.load('auth2', function() {});\\n}\",\n \"function loadLibrary() {\\n\\n if ( loaded ) {\\n return onLibraryLoaded();\\n }\\n\\n var googletag,\\n gads,\\n useSSL,\\n node,\\n readyStateLoaded = false\\n ;\\n\\n window.googletag = window.googletag || {};\\n window.googletag.cmd = window.googletag.cmd || [];\\n\\n // Called when GPT is Available\\n window.googletag.cmd.push( onLibraryLoaded )\\n\\n gads = document.createElement( 'script' );\\n gads.async = true;\\n gads.type = 'text/javascript';\\n gads.src = 'https://www.googletagservices.com/tag/js/gpt.js';\\n\\n node = document.getElementsByTagName( 'script' )[0];\\n node.parentNode.insertBefore( gads, node );\\n\\n }\",\n \"function onClientLoad() {\\n gapi.client.load('youtube', 'v3', onYouTubeApiLoad);\\n }\",\n \"async function loadClient() {\\n client = await mongodb.MongoClient.connect(url, { useNewUrlParser: true })\\n}\",\n \"function onApiLoad() {\\n gapi.load('auth', {'callback': onAuthApiLoad});\\n gapi.load('picker', {'callback': onPickerApiLoad});\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.78346795","0.6759061","0.6677482","0.66763383","0.6563972","0.6477016","0.63805455","0.63769317","0.6372109","0.6365058","0.6361253","0.6345905","0.6345905","0.6345905","0.63422436","0.6339838","0.6326001","0.6326001","0.6326001","0.6326001","0.6326001","0.6321911","0.6316381","0.6312509","0.63032734","0.62989664","0.6293892","0.62831765","0.62831765","0.62831765","0.62831765","0.62831765","0.62831765","0.62831765","0.62831765","0.62824637","0.62824637","0.62824637","0.6272446","0.6264934","0.6264934","0.6264934","0.6264934","0.6264934","0.6264934","0.6264934","0.6264934","0.6264934","0.6264934","0.6264934","0.62598","0.6241845","0.6241177","0.62164235","0.61900723","0.6147987","0.61184424","0.6115788","0.6115788","0.6104828","0.6073557","0.60726213","0.60610265","0.60477823","0.5981743","0.59740156","0.5957957","0.5942847","0.5912268","0.5847842","0.58376735","0.58107406","0.5801084","0.57776576","0.5751052","0.5734896","0.5662069","0.5615188","0.55499834","0.5546123","0.5538612","0.55309844","0.55227643","0.549577","0.54771674","0.54587966","0.5446097","0.54169285","0.5413446","0.5408821","0.5402354","0.54017365","0.5394303","0.5386094","0.5381992","0.537428","0.5373427","0.535837","0.535506","0.53525907"],"string":"[\n \"0.78346795\",\n \"0.6759061\",\n \"0.6677482\",\n \"0.66763383\",\n \"0.6563972\",\n \"0.6477016\",\n \"0.63805455\",\n \"0.63769317\",\n \"0.6372109\",\n \"0.6365058\",\n \"0.6361253\",\n \"0.6345905\",\n \"0.6345905\",\n \"0.6345905\",\n \"0.63422436\",\n \"0.6339838\",\n \"0.6326001\",\n \"0.6326001\",\n \"0.6326001\",\n \"0.6326001\",\n \"0.6326001\",\n \"0.6321911\",\n \"0.6316381\",\n \"0.6312509\",\n \"0.63032734\",\n \"0.62989664\",\n \"0.6293892\",\n \"0.62831765\",\n \"0.62831765\",\n \"0.62831765\",\n \"0.62831765\",\n \"0.62831765\",\n \"0.62831765\",\n \"0.62831765\",\n \"0.62831765\",\n \"0.62824637\",\n \"0.62824637\",\n \"0.62824637\",\n \"0.6272446\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.6264934\",\n \"0.62598\",\n \"0.6241845\",\n \"0.6241177\",\n \"0.62164235\",\n \"0.61900723\",\n \"0.6147987\",\n \"0.61184424\",\n \"0.6115788\",\n \"0.6115788\",\n \"0.6104828\",\n \"0.6073557\",\n \"0.60726213\",\n \"0.60610265\",\n \"0.60477823\",\n \"0.5981743\",\n \"0.59740156\",\n \"0.5957957\",\n \"0.5942847\",\n \"0.5912268\",\n \"0.5847842\",\n \"0.58376735\",\n \"0.58107406\",\n \"0.5801084\",\n \"0.57776576\",\n \"0.5751052\",\n \"0.5734896\",\n \"0.5662069\",\n \"0.5615188\",\n \"0.55499834\",\n \"0.5546123\",\n \"0.5538612\",\n \"0.55309844\",\n \"0.55227643\",\n \"0.549577\",\n \"0.54771674\",\n \"0.54587966\",\n \"0.5446097\",\n \"0.54169285\",\n \"0.5413446\",\n \"0.5408821\",\n \"0.5402354\",\n \"0.54017365\",\n \"0.5394303\",\n \"0.5386094\",\n \"0.5381992\",\n \"0.537428\",\n \"0.5373427\",\n \"0.535837\",\n \"0.535506\",\n \"0.53525907\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.77509207"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":4673,"cells":{"query":{"kind":"string","value":"Build the Jekyll Site"},"document":{"kind":"string","value":"function jekyllBuild() {\n browserSync.notify(messages.jekyllBuild);\n if (env === 'prod') {\n return cp.spawn(jekyll, ['build'], { stdio: 'inherit' });\n } else {\n return cp.spawn(\n jekyll,\n ['build', '--config', '_config.yml,_config.dev.yml'],\n {\n stdio: 'inherit',\n },\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":["build(source){\n const paths = Helpers.files(source);\n const view = Helpers.includes(paths.includes);\n\n //build _site directory, unless it already exists\n const sitePath = paths.site;\n fs.mkdir(sitePath, (err) => {\n if (err) {\n if (err.code === 'EEXIST') console.log('the _site folder already exists, building some new children...');\n else console.log(err);\n } else console.log('_site directory initialized')\n });\n\n //get array of all posts in _posts directory using glob module\n //then create a new set of directories according to the post title\n const index = module.exports.index(source);\n\n //run down the directory structure rabbit hole for each post\n index.forEach(post => {\n postDir(sitePath, post, 'year');\n postDir(sitePath, post, 'month');\n postDir(sitePath, post, 'day');\n postDir(sitePath, post, 'title');\n\n //move markdown and template (view) data to index.html file at root of post directories\n const path = post.year + '-' + post.month + '-' + post.day + '-' + post.title + '.' + post.ext;\n const postPath = paths.posts + '/' + path;\n\n Helpers.reader(postPath, (data) => {\n const html = marked(data);\n const newPath = sitePath + '/' + post.year + '/' + post.month + '/' + post.day + '/' + post.title;\n Helpers.writer(paths.layouts, view, newPath, html, 'posts');\n });\n });\n\n //build landing page (index.html) using same writer function as for posts, without needing to read markdown\n Helpers.writer(paths.layouts, view, sitePath, '', 'landing');\n }","function build_page(){\n\t\t\tfor ( var key in sitemap.pages ) {\n\t\t\t\tvar site_obj = sitemap;\n\t\t\t\tvar page_obj = site_obj.pages[ key ];\n\n\t\t\t\tif ( page_obj.file !== false ) {\n\t\t\t\t\tvar sourceFile = \"test/preprocess/\" + page_obj.template + \".tmpl\";\n\t\t\t\t\tvar root = page_obj.file_root.replace( new RegExp( \"[\\/]+$\", \"g\" ), \"\" );\n\t\t\t\t\tvar page = page_obj.file || page_obj.nav_key + \".html\";\n\t\t\t\t\tvar targetFile = root + \"/\" + page;\n\t\t\t\t\tvar content = fs.readFileSync( sourceFile, \"utf8\" );\n\n\t\t\t\t\tsite_obj.current_page = page;\n\t\t\t\t\tsite_obj.current_build = page_obj.nav_key;\n\n\t\t\t\t\tvar tmpl = new nunjucks.Template( content, env );\n\t\t\t\t\tvar res = tmpl.render( site_obj );\n\n\t\t\t\t\tgrunt.log.writeln( \"building \" + targetFile );\n\t\t\t\t\tfs.writeFile( targetFile, res );\n\t\t\t\t}\n\t\t\t}\n\t\t}","function build() {\n // Tidy directory first\n // to ensure all files\n // are in the right place\n tidy();\n\n mmark.parseDirectory(process.cwd() + \"/posts\", function(err, posts){\n if (err) {\n console.log(err.red);\n }\n\n var feed_html = \"\";\n for (post in posts) {\n var post = posts[post];\n\n // Fetch post data\n var title = post['meta']['title'];\n var date = post['meta']['date'];\n var markd = post['content'];\n\n // Produce HTML\n var html = [\n '<div class=\"post\">',\n '<h2 class=\"post-title\">',\n title,\n '</h2>',\n '<h4 class=\"post-date\">',\n date,\n '</h4>',\n markd,\n '</div>'\n ].join();\n\n feed_html += html;\n }\n var out = tinyt.renderFile(template_source, {feed: feed_html});\n fs.writeFile(html_source, out, function(data, err){\n if (err) {\n console.log(err);\n }\n console.log(\"All posts succesfully rendered ✔\".green);\n });\n });\n\n}","function buildSite( cb, options, environment = \"development\" ) {\n const args = options ? hugoArgsDefault.concat( options ) : hugoArgsDefault;\n\n process.env.NODE_ENV = environment;\n\n return spawn( hugoBin, args, { stdio: \"inherit\" } ).on( \"close\", ( code ) => {\n if ( code === 0 ) {\n browserSync.reload();\n cb();\n } else {\n browserSync.notify( \"Hugo build failed :(\" );\n cb( \"Hugo build failed\" );\n }\n } );\n}","function buildSite(cb, options, environment = \"development\") {\n const args = options ? hugoArgsDefault.concat(options) : hugoArgsDefault;\n\n process.env.NODE_ENV = environment;\n\n return spawn(hugoBin, args, {stdio: \"inherit\"}).on(\"close\", (code) => {\n if (code === 0) {\n browserSync.reload();\n cb();\n } else {\n browserSync.notify(\"Hugo build failed :(\");\n cb(\"Hugo build failed\");\n }\n });\n}","function buildSite(unusedFileEntities, options) {\n if (options === void 0) { options = defaultOptions; }\n var outputPath = options.outputPath;\n console.log(\"Writing documentation to \" + outputPath);\n // delete everything in the outputPath\n if (fs.existsSync(outputPath)) {\n try {\n rimraf.sync(outputPath);\n }\n catch (e) {\n console.error('Error Deleting output path', e);\n }\n }\n // Generate the html and dump into the output path\n var html = site_builder_1.generateHtmlPage(unusedFileEntities);\n try {\n if (!fs.existsSync(outputPath)) {\n fs.mkdirSync(outputPath);\n }\n var docsPath = path.join(outputPath, 'index.html');\n fs.writeFileSync(docsPath, html);\n }\n catch (e) {\n console.error('Error creating output path', e);\n }\n // Copy the asset folders to the output path\n try {\n for (var _i = 0, _a = options.copyFolders; _i < _a.length; _i++) {\n var folder = _a[_i];\n var assetFolderPath = path.join(path.dirname(require.main.filename), folder);\n var destFolderPath = path.join(outputPath, folder);\n if (fs.existsSync(assetFolderPath)) {\n fs.copySync(assetFolderPath, destFolderPath);\n }\n }\n }\n catch (e) {\n console.error('Error copying asset directories', e);\n }\n}","function jekyll() {\r\n return cp.spawn(jekyllCommand,\r\n ['exec', 'jekyll', 'build'],\r\n {stdio : 'inherit'}\r\n );\r\n}","function buildJekyll(done) {\n browser.notify(messages.jekyllBuild);\n return cp.spawn( jekyll , ['build'], {stdio: 'inherit'})\n .on('close', done);\n}","function pages(cb) {\n // Gets .html files. see file layout at bottom\n var env = new $.nunjucks.Environment(\n new $.nunjucks.FileSystemLoader(templates)\n );\n // all fo the follwing is optional and this will all work just find if you don't include any of it. included it here just in case you need to configure it.\n $.marked.setOptions({\n renderer: new $.marked.Renderer(),\n gfm: true,\n tables: true,\n breaks: false,\n pedantic: false,\n sanitize: true,\n smartLists: true,\n smartypants: false\n });\n\n // This takes the freshley created nunjucks envroment object (env) and passes it to nunjucks-markdown to have the custom tag regestered to the env object.\n // The second is the marked library. anything that can be called to render markdown can be passed here.\n $.markdown.register(env, $.marked);\n\n // let data = JSON.parse({ files: getData('markup') });\n let data = { files: getData('markup') };\n let cData = { cFiles: getData('markup-c') };\n\n // get styles data\n src([templates + '/*.html'])\n // Renders template with nunjucks and marked\n .pipe($.data(data))\n .pipe($.gulpnunjucks.compile('', { env: env }))\n // Uncomment the following if your source pages are something other than *.html.\n // .pipe(rename(function (path) { path.extname=\".html\" }))\n // output files in dist folder\n .pipe(dest(dist));\n\n // get components data\n src([templates + '/*.html'])\n // Renders template with nunjucks and marked\n .pipe($.data(cData))\n .pipe($.gulpnunjucks.compile('', { env: env }))\n .pipe(dest(dist));\n\n cb();\n}","function compileTemplates(){\n\tvar siteMap = config();//JSON.parse( fs.readFileSync( config() ) );\n\n\t//generate paths to the example sources\n\tvar sources = [];\n\tsiteMap.examples.forEach(function( example ){\n\t\tsources.push( source( example.src ) );\n\t});\n\t//pass to docco, then jade, then clean up\n\tdocco.document(sources, { language: \"javascript\", template: view(\"docco-template.jst\") }, function( err ){\n\t\tif( err ) throw err;\n\t\tasync.forEach( siteMap.examples, generateExample, function exit( err ) {\n\t\t\tif( err ) throw err;\n\t\t\tsetTimeout(function(){\n\t\t\t\t//clean();\n\t\t\t}, 500);\n\t\t});\n\t});\n\n\t//handle pages\n\tsiteMap.pages.forEach(function( page ){\n\t\tgeneratePage( page );\n\t});\n\n\n\t//remove the docs folder\n\tfunction clean(){\n\t\twrench.rmdirRecursive( __dirname + '/docs/', function(){\n\t\t\tmsg('docs deleted');\n\t\t});\n\t}\n}","function jekyllBuild(done) {\n exec(\"bundle exec jekyll serve\", function (err, stdout, stderr) {\n console.log(stdout);\n console.error(stderr);\n });\n done();\n}","static get tag(){return\"haxcms-site-builder\"}","async build () {\n let src = await this.fs.promises.readdir(this.config.settings.SRC)\n let items = await Promise.all(src.filter((key) => { return key !== \"assets\" }).map((key) => {\n return new Promise(async (resolve, reject) => {\n let md = await this.fs.promises.readFile(`${this.config.settings.SRC}/${key}`, \"utf8\")\n let { content, data } = matter(md)\n resolve({ key, data, content })\n })\n }))\n let publicItems = []\n let privateItems = []\n for(let item of items) {\n if (item.data.draft) privateItems.push(item)\n else publicItems.push(item)\n }\n for(let item of privateItems) {\n await this.fs.promises.unlink(`${this.config.settings.DEST}/post/${item.key}/index.html`)\n }\n publicItems.sort((a, b) => {\n return parseInt(b.data.updated) - parseInt(a.data.updated);\n })\n for(let item of publicItems) {\n await this.buildPost(item.key)\n }\n await this.plugins(\"onpublish\", publicItems)\n }","async compile(filepath) {\n const siteData = await helper.siteData();\n const currentUrl = path.relative(\n './src',\n _.replace(filepath, '.md', '.html')\n );\n const destination = `./docs/${currentUrl}`;\n\n // Read file, and extract front-matter from raw text\n const rawContent = await helper.readFile(filepath);\n const parsed = frontMatter(rawContent);\n const fileData = parsed.attributes;\n const pageData = _.merge({}, siteData, fileData);\n\n // Update {{config}} placeholders\n let markdownBody = parsed.body;\n _.each(pageData.config, (value, key) => {\n markdownBody = _.replace(\n markdownBody,\n new RegExp(`{{${key}}}`, 'g'),\n value\n );\n });\n\n // Convert markdown to html\n const htmlBody = markdown.render(markdownBody);\n\n // Add the hierarchy of headings to the matching link in the sidebar\n const headings = this.getHeadings(htmlBody);\n const sidebar = _.clone(pageData.sidebar);\n _.each(sidebar, category => {\n _.each(category.pages, page => {\n const linkBasename = path.basename(page.url, '.html');\n if (linkBasename === currentUrl) {\n page.headings = headings; // eslint-disable-line no-param-reassign\n }\n });\n });\n\n // Init layout\n const layoutName = fileData.layout;\n const layoutFile = `./src/_layouts/${layoutName}.pug`;\n const layoutContent = await helper.readFile(layoutFile);\n const pugCompile = pug.compile(layoutContent, { filename: layoutFile });\n\n // Compile layout\n const compileData = {\n ...pageData,\n sidebar,\n current: {\n url: currentUrl,\n content: htmlBody,\n ...fileData,\n },\n };\n const htmlContent = pugCompile(compileData);\n\n // Save to disk\n await helper.writeFile(destination, htmlContent);\n }","function jekyll_production() {\n return child_process.spawn(\"bundle\", [\"exec\", \"jekyll\", \"build\", \"--config\", \"_config-production.yml\"], { stdio: \"inherit\" });\n}","function buildPage(file, { srcPath, outputPath, site }) {\n return new Promise((resolve, reject) => {\n const fileData = path.parse(file);\n let destPath = path.join(outputPath, fileData.dir);\n\n // create extra dir if filename is not index\n if (fileData.name !== 'index') {\n destPath = path.join(destPath, fileData.name);\n }\n\n // create destination directory\n fse.mkdirsSync(destPath);\n\n // read page file\n const data = fse.readFileSync(`${srcPath}/pages/${file}`, 'utf-8');\n\n // render page\n const pageData = frontMatter(data);\n\n const templateConfig = {\n site,\n page: Object.assign({}, pageData.attributes, { url: `/${fileData.dir}` })\n };\n\n let pageContent;\n const pageSlug = file.split(path.sep).join('-');\n\n // generate page content according to file type\n switch (fileData.ext) {\n case '.md':\n pageContent = marked(pageData.body);\n break;\n case '.ejs':\n pageContent = ejs.render(pageData.body, templateConfig, {\n filename: `${srcPath}/page-${pageSlug}`\n });\n break;\n default:\n pageContent = pageData.body;\n }\n\n // render layout with page contents\n const layoutName = pageData.attributes.layout || 'default';\n const layout = loadLayout(layoutName, {\n srcPath\n });\n\n const completePage = ejs.render(\n layout.data,\n Object.assign({}, templateConfig, {\n body: pageContent,\n filename: `${srcPath}/layout-${layoutName}`\n })\n );\n\n fse.writeFile(`${destPath}/index.html`, completePage, error => {\n if (error) {\n log.error(`Error building page '${file}'`);\n reject();\n } else {\n resolve();\n }\n });\n\n fse.writeFileSync(`${destPath}/index.html`, completePage);\n });\n}","function build() {\n\tconst markdown = fs\n\t\t// Load markdown.\n\t\t.readFileSync(readmePath, 'utf8')\n\t\t// Uncomment docdash HTML hints.\n\t\t.replace(/(<)!--\\s*|\\s*--(>)/g, '$1$2')\n\t\t// Convert source and npm package links to anchors.\n\t\t.replace(\n\t\t\t/\\[source\\]\\(([^)]+)\\) \\[npm package\\]\\(([^)]+)\\)/g,\n\t\t\t(match, href1, href2) =>\n\t\t\t\t`<p class=\"pee-balls\"><a class=\"a-balls\" href=\"${href1}\">source</a><a href=\"${href2}\">npm package</a></p>`\n\t\t)\n\n\tconst $ = cheerio.load(\n\t\tmarky(markdown, {\n\t\t\tenableHeadingLinkIcons: false,\n\t\t\tsanitize: false\n\t\t})\n\t)\n\n\tconst $header = $('h1')\n\t\t.first()\n\t\t.remove()\n\n\tconst version = $header\n\t\t.find('span')\n\t\t.first()\n\t\t.text()\n\t\t.trim()\n\t\t.slice(1)\n\n\t// Auto-link flodash method references.\n\tautoLink($)\n\t// Rename \"_\" id references to \"flodash\".\n\trenameflodashId($)\n\t// Remove docdash horizontal rules.\n\tremoveHorizontalRules($)\n\t// Remove marky-markdown attribute additions.\n\tremoveMarkyAttributes($)\n\t// Repair marky-markdown wrapping around headers.\n\trepairMarkyHeaders($)\n\t// Cleanup highlights.\n\ttidyHighlights($)\n\n\tconst _html = () => {\n\t\treturn /* html */ `\n\t\t\t<!DOCTYPE html>\n\t\t\t<html class=\"docs gr__flodash_com\" style=\"overflow: auto;\">\n\t\t\t\t<head>\n\t\t\t\t\t<meta charset=\"utf-8\">\n\t\t\t\t\t<meta content=\"IE=edge\" http-equiv=\"X-UA-Compatible\">\n\t\t\t\t\t<title>flodash Docs</title>\n\t\t\t\t\t<meta content=\"width=device-width, initial-scale=1\" name=\"viewport\">\n\t\t\t\t\t<link href=\"assets/css/doc.css\" rel=\"stylesheet\" type=\"text/css\">\n\t\t\t\t\t<script src=\"../vendor/lodash/lodash.min.js\"></script>\n\t\t\t\t\t<script src=\"../vendor/g/fuse@2.6.1,react@15.4.0(react.min.js+react-dom.min.js\"></script>\n\t\t\t\t\t<script async src=\"../assets/js/docs.js\"></script>\n\t\t\t\t\t<link href=\"https://cdn.jsdelivr.net/fontawesome/4.7.0/css/font-awesome.min.css\" rel=\"stylesheet\">\n\t\t\t\t\t<script async src=\"../assets/js/boot.js\"></script>\n\t\t\t\t\t<script async src=\"https://embed.runkit.com\" async></script>\n\t\t\t\t</head>\n\t\t\t\t<body class=\"layout-docs\">\n\t\t\t\t\t<header>\n\t\t\t\t\t\t<div class=\"container\">\n\t\t\t\t\t\t\t\t<div class=\"header-section logo-section\">\n\t\t\t\t\t\t\t\t\t\t<div class=\"logo\">\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"../index.html\" title=\"flodash\">flodash</a>\n\t\t\t\t\t\t\t\t\t\t</div>\n\t\t\t\t\t\t\t\t\t\t<div class=\"header-group\">\n\t\t\t\t\t\t\t\t\t\t\t\t<h1>flodash</h1>\n\t\t\t\t\t\t\t\t\t\t</div>\n\t\t\t\t\t\t\t\t</div>\n\t\t\t\t\t\t\t\t<div class=\"header-section mobile-menu\">\n \t\t\t\t\t\t\t<a href=\"#\"><i class=\"fa fa-bars\" aria-hidden=\"true\"></i>Menu</a>\n \t\t\t\t\t\t</div>\n\t\t\t\t\t\t</div>\n\t\t\t\t\t</header>\n\t\t\t\t\t<div class=\"doc-main\">\n\t\t\t\t\t\t${$.html().trim()}\n\t\t\t\t\t</div>\n\t\t\t\t</body>\n\t\t\t</html>\n\t\t`\n\t}\n\n\tconst __html = /* html */ `${_html()}`\n\n\tfs.writeFile(path.join(docPath, 'balls' + '.html'), __html, util.pitch)\n\t// fs.writeFile(path.join(docPath, 'doc' + '.html'), __html, util.pitch)\n\n}","function deploy() {\n return gulp.src('./public/**/*')\n .pipe($.ghPages());\n}","function jekyllProd() {\n return gulp.src('.').pipe(run('bundle exec jekyll build'));\n}","async function generate() {\n const prettierConfig = await prettier.resolveConfig('./.prettierrc.js')\n const pages = await globby([\n 'pages/*.js',\n 'pages/*.tsx',\n 'pages/*/*.tsx',\n 'data/**/*.mdx',\n '_blog/*.mdx',\n '!pages/index.tsx',\n '!data/*.mdx',\n '!pages/_*.js',\n '!pages/*/index.tsx',\n '!pages/api',\n '!pages/404.js',\n ])\n\n const sitemap = `\n <?xml version=\"1.0\" encoding=\"UTF-8\"?>\n <urlset xmlns=\"http://www.sitemaps.org/schemas/sitemap/0.9\">\n ${pages\n .filter((page) => !page.includes('_document.tsx'))\n .map((page) => {\n const path = page\n .replace('pages', '')\n // add a `/` for blog posts\n .replace('_blog', '/blog')\n .replace('.tsx', '')\n .replace('.mdx', '')\n // replace the paths for nested 'index' based routes\n .replace('/auth/Auth', '/auth')\n .replace('/database/Database', '/database')\n .replace('/storage/Storage', '/storage')\n\n let route = path === '/index' ? '' : path\n\n //\n // blog specific urls\n //\n if (route.includes('/blog/')) {\n // clean blog post route from string\n const _route = route.replace('/blog/', '')\n // splut the url\n let split = _route.split('')\n // target and replace the `-` between dates\n split[4] = '/'\n split[7] = '/'\n split[10] = '/'\n // reconstruct the url\n route = '/blog/' + split.join('')\n }\n\n return `\n <url>\n <loc>${`https://supabase.com${route}`}</loc>\n <changefreq>weekly</changefreq>\n <changefreq>0.5</changefreq>\n </url>\n `\n })\n .join('')}\n </urlset>\n `\n\n const formatted = prettier.format(sitemap, {\n ...prettierConfig,\n parser: 'html',\n })\n\n // eslint-disable-next-line no-sync\n writeFileSync('public/sitemap_www.xml', formatted)\n}","function generatestatic() {\n console.log(\"Generating unique pages...\");\n const scams = JSON.parse(fs.readFileSync('./_site/data/scams.json'));\n const addresses = JSON.parse(fs.readFileSync('./_site/data/addresses.json'));\n const ips = JSON.parse(fs.readFileSync('./_site/data/ips.json'));\n const layout_scams = fs.readFileSync('./_layouts/scam.html', 'utf8');\n const layout_addresses = fs.readFileSync('./_layouts/address.html', 'utf8');\n const layout_ips = fs.readFileSync('./_layouts/ip.html', 'utf8');\n if (!fs.existsSync(\"./_site\")) {\n fs.mkdirSync(\"./_site/\");\n }\n if (!fs.existsSync(\"./_site/scam/\")) {\n fs.mkdirSync(\"./_site/scam/\");\n }\n for (var key = 0, len = scams.length; key < len; key++) {\n var layout = template.replace(\"{{ content }}\", layout_scams);\n var sc_nameservers = \"\";\n var sc_addresses = \"\";\n var history = \"\";\n var actions = \"<button id='share' class='ui icon secondary button'><i class='share alternate icon'></i> Share</button>\";\n if (\"nameservers\" in scams[key]) {\n scams[key]['nameservers'].forEach(function(nameindex) {\n sc_nameservers += \"<div class='item'>\" + nameindex + '</div>';\n });\n if (sc_nameservers) {\n layout = layout.replace(/{{ scam.nameservers }}/ig, '<b>Nameservers</b>: <div class=\"ui bulleted list\">' + sc_nameservers + '</div>');\n }\n } else {\n layout = layout.replace(/{{ scam.nameservers }}/ig, \"\");\n }\n if (\"addresses\" in scams[key]) {\n scams[key]['addresses'].forEach(function(nameindex) {\n sc_addresses += \"<div class='item'><a href='/address/\" + nameindex + \"'>\" + nameindex + \"</a></div>\";\n });\n if (sc_addresses) {\n layout = layout.replace(/{{ scam.addresses }}/ig, '<b>Related addresses</b>: <div class=\"ui bulleted list\">' + sc_addresses + '</div>');\n }\n } else {\n layout = layout.replace(/{{ scam.addresses }}/ig, \"\");\n }\n if (\"status\" in scams[key]) {\n if (scams[key]['status'][0]['status'] != \"Unknown\") {\n scams[key]['status'].forEach(function(nameindex) {\n var st = nameindex['status'];\n if (st == \"Active\") {\n st = '<i class=\"checkmark icon\"></i> Active';\n } else if (st == \"Offline\") {\n st = '<i class=\"remove icon\"></i> Offline';\n } else if (st == \"Suspended\") {\n st = '<i class=\"warning sign icon\"></i> Suspended';\n }\n history += \"<tr><td class='\" + nameindex['status'].toLowerCase().replace('active', 'activ') + \"'>\" + st + \"</td><td>\" + dateFormat(nameindex['time'], \"mmmm dS, yyyy, HH:MM:ss Z\", true) + \"</td></tr>\"\n });\n actions = '<button id=\"history\" class=\"ui icon secondary button\"><i class=\"history icon\"></i> History</button>' + actions\n layout = layout.replace(/{{ scam.history }}/ig, '<table class=\"ui celled table\"><thead><tr><th>Status</th><th>Date</th></tr></thead><tbody>' + history + '</tbody></table>');\n layout = layout.replace(/{{ scam.status }}/ig, \"<b>Status</b>: <span class='\" + scams[key]['status'][0]['status'].toLowerCase().replace('active', 'activ') + \"'>\" + scams[key]['status'][0]['status'] + \"</span> (\" + dateFormat(scams[key]['status'][0]['time'], \"mmmm dS, yyyy, HH:MM:ss Z\", true) + \")<BR>\");\n } else {\n layout = layout.replace(/{{ scam.history }}/ig, \"\");\n layout = layout.replace(/{{ scam.status }}/ig, \"\");\n }\n } else {\n layout = layout.replace(/{{ scam.history }}/ig, \"\");\n layout = layout.replace(/{{ scam.status }}/ig, \"\");\n }\n if (\"description\" in scams[key]) {\n layout = layout.replace(/{{ scam.description }}/ig, \"<b>Description</b>: \" + scams[key]['description'] + \"<BR>\");\n } else {\n layout = layout.replace(/{{ scam.description }}/ig, \"\");\n }\n if (\"ip\" in scams[key]) {\n layout = layout.replace(/{{ scam.ip }}/ig, '<b>IP</b>: <a href=\"/ip/' + scams[key]['ip'] + '\">' + scams[key]['ip'] + '</a><BR>');\n } else {\n layout = layout.replace(/{{ scam.ip }}/ig, \"\");\n }\n if (\"category\" in scams[key]) {\n if (\"subcategory\" in scams[key]) {\n layout = layout.replace(/{{ scam.category }}/ig, \"<b>Category</b>: \" + scams[key]['category'] + \" - \" + scams[key]['subcategory'] + \"<BR>\");\n } else {\n layout = layout.replace(/{{ scam.category }}/ig, \"<b>Category</b>: \" + scams[key]['category'] + \"<BR>\");\n }\n } else {\n layout = layout.replace(/{{ scam.category }}/ig, \"\");\n }\n if (\"url\" in scams[key]) {\n actions = '<a target=\"_blank\" href=\"http://web.archive.org/web/*/' + encodeURIComponent(url.parse(scams[key]['url']).hostname) + '\" class=\"ui icon secondary button\"><i class=\"archive icon\"></i> Archive</a>' + actions\n layout = layout.replace(/{{ scam.url }}/ig, '<b>URL</b>: <a id=\"url\" target=\"_blank\" href=\"/redirect/?url=' + encodeURIComponent(scams[key]['url']) + '\">' + scams[key]['url'] + '</a><BR>');\n layout = layout.replace(/{{ scam.ethaddresslookup }}/ig, \"<b>EtherAddressLookup</b>: <span id='blocked'>loading...</span><BR>\");\n layout = layout.replace(/{{ scam.googlethreat }}/ig, \"<b>Google Safe Browsing</b>: <span id='googleblocked'>loading...</span><BR>\");\n\n if (\"status\" in scams[key] && scams[key]['status'][0]['status'] == \"Active\") {\n actions = '<button id=\"gen\" class=\"ui icon secondary button\"><i class=\"setting icon\"></i> Abuse Report</button>' + actions\n layout = layout.replace(/{{ scam.abusereport }}/ig, generateAbuseReport(scams[key]));\n } else {\n layout = layout.replace(/{{ scam.abusereport }}/ig, \"\");\n }\n } else {\n layout = layout.replace(/{{ scam.url }}/ig, \"\");\n layout = layout.replace(/{{ scam.abusereport }}/ig, \"\");\n layout = layout.replace(/{{ scam.ethaddresslookup }}/ig, \"\");\n layout = layout.replace(/{{ scam.googlethreat }}/ig, \"\");\n }\n layout = layout.replace(/{{ scam.id }}/ig, scams[key]['id']);\n layout = layout.replace(/{{ scam.history }}/ig, history);\n layout = layout.replace(/{{ scam.actions }}/ig, actions);\n layout = layout.replace(/{{ scam.name }}/ig, scams[key]['name']);\n if (!fs.existsSync(\"./_site/scam/\" + scams[key]['id'] + \"/\")) {\n fs.mkdirSync(\"./_site/scam/\" + scams[key]['id'] + \"/\");\n }\n if (minify) {\n layout = htmlmin(layout);\n }\n fs.writeFile(\"./_site/scam/\" + scams[key]['id'] + \"/index.html\", layout, function(err) {\n if (err) {\n return console.log(err);\n }\n });\n }\n if (!fs.existsSync(\"./_site/address/\")) {\n fs.mkdirSync(\"./_site/address/\");\n }\n Object.keys(addresses).forEach(function(key) {\n var layout = template.replace(\"{{ content }}\", layout_addresses);\n var related = \"\";\n for (var i = 0, len = addresses[key].length; i < len; i++) {\n related += \"<div class='item'><a href='/scam/\" + addresses[key][i] + \"'>\" + data.find(o => o['id'] === addresses[key][i])['name'] + \"</a></div>\";\n }\n if (related) {\n related = '<div class=\"ui bulleted list\">' + related + '</div>';\n } else {\n related = \"None\";\n }\n layout = layout.replace(/{{ address.address }}/ig, key);\n layout = layout.replace(/{{ address.scams }}/ig, related);\n if (!fs.existsSync(\"./_site/address/\" + key + \"/\")) {\n fs.mkdirSync(\"./_site/address/\" + key + \"/\");\n }\n if (minify) {\n layout = htmlmin(layout);\n }\n fs.writeFile(\"./_site/address/\" + key + \"/index.html\", layout, function(err) {\n if (err) {\n return console.log(err);\n }\n });\n });\n if (!fs.existsSync(\"./_site/ip/\")) {\n fs.mkdirSync(\"./_site/ip/\");\n }\n Object.keys(ips).forEach(function(key) {\n var layout = template.replace(\"{{ content }}\", layout_ips);\n var related = \"\";\n for (var i = 0, len = ips[key].length; i < len; i++) {\n related += \"<div class='item'><a href='/scam/\" + ips[key][i] + \"'>\" + data.find(o => o['id'] === ips[key][i])['name'] + \"</a></div>\"\n }\n if (related) {\n related = '<div class=\"ui bulleted list\">' + related + '</div>'\n } else {\n related = \"None\"\n }\n layout = layout.replace(/{{ ip.ip }}/ig, key);\n layout = layout.replace(/{{ ip.scams }}/ig, related);\n if (!fs.existsSync(\"./_site/ip/\" + key + \"/\")) {\n fs.mkdirSync(\"./_site/ip/\" + key + \"/\");\n }\n if (minify) {\n layout = htmlmin(layout);\n }\n fs.writeFile(\"./_site/ip/\" + key + \"/index.html\", layout, function(err) {\n if (err) {\n return console.log(err);\n }\n });\n });\n console.log(\"Done generating unique scam pages\");\n if (job == \"build\" || job == false) {\n copyStatic();\n } else {\n finish();\n }\n}","function documentationPages() {\n return gulp.src(Config.paths.srcDocsPages + \"/**/index.html\")\n .pipe(Plugins.plumber(ErrorHandling.oneErrorInPipe))\n .pipe(Plugins.debug({\n title: \"Building Documentation Page File to \" + Config.paths.distDocumentation\n }))\n .pipe(Plugins.handlebars(templateData, hbsoptions))\n .pipe(Plugins.fileinclude({\n context: {\n filePath: filePath,\n build: build\n }\n }))\n .pipe(gulp.dest(Config.paths.distDocumentation));\n}","function buildPage(contents)\n{\n\tvar pageContents = \"\";\n\tfor(var i = 0; i < contents.length; i++)\n\t{\n\t\t//build a page.\n\t\tpageContents += \"<div class= 'post'><h2>\" + contents[i].gsx$posttitle.$t + \" Made on \" + contents[i].gsx$timestamp.$t + \"</h2><p>\" + contents[i].gsx$postbody.$t + \"</p></div>\";\n\t}\n\t//now load it.\n\t$(\".mainContent\").html(pageContents);\n}","function pages() {\n return gulp.src( 'src/pages/**/*.html' )\n .pipe( panini({\n root: 'src/pages',\n layouts: 'src/layouts',\n partials: 'src/partials',\n helpers: 'src/helpers',\n data: 'src/data'\n }))\n .pipe( gulp.dest( 'build' ) );\n}","async build(write = true) {\n for(let g in this.items) {\n if(this.items[g].hasConfig && this.items[g].config.build != false) {\n // render out this page\n let dirs = this.items[g].href.split('/');\n dirs.pop();\n let page = {\n data: this.items[g].render({ pages: this.items }),\n config: this.items[g].config,\n name: g };\n await this.emitMiddleware('after', page);\n if(write) {\n console.log(' [build] Writing file ' + this.config.base + '/' + this.items[g].href + '...');\n fs.mkdir(this.config.base + '/' + dirs.join('/'), { recursive: true }, (err) => {\n if (err) throw err;\n fs.writeFileSync(this.config.base + '/' + this.items[g].href, page.data);\n });\n } else {\n this.output[g] = page.data;\n }\n }\n }\n this.emitMiddleware('finish');\n }","function jekyll_staging() {\n return child_process.spawn(\"bundle\", [\"exec\", \"jekyll\", \"build\", \"--config\", \"_config-staging.yml\"], { stdio: \"inherit\" });\n}","async buildPost (filename) {\n let md = await this.fs.promises.readFile(`${this.config.settings.SRC}/${filename}`, \"utf8\")\n let { content, data } = matter(md)\n data.permalink = filename\n let html = marked(content, { baseUrl: \"../../\" }) \n //await this.processContent( { content, html, data, filename } )\n //await this.processImages({ content })\n await this.plugins(\"onsave\", { content, html, data, filename })\n return { html, data }\n }","function BlogIndex(conf) {\n\n var self = this;\n\n this.conf = conf;\n\n this.genBlogIndex = function() {\n\n /* write some HTML to format the data */\n var mdBodyObj = document.getElementById(gs_body_id);\n var ul = document.createElement('ul');\n appendAttribute(ul, 'class', 'list-group');\n mdBodyObj.appendChild(ul);\n\n var firstPost = 1;\n var reqPage = self.conf.requested_blog_index_page;\n var itemMax = self.conf.blog_items.length;\n\n if (self.conf.paginationIsActive()) {\n itemMax = self.conf.pagination;\n firstPost = (reqPage-1) * itemMax + 1;\n var gsPagination = new PageNav(gsConfig);\n gsPagination.genNavListTags();\n }\n\n var itemCnt = 0;\n for (index = firstPost; index < self.conf.blog_items.length; index++) {\n if (itemCnt >= itemMax) { break; }\n\n var item = self.conf.blog_items[index];\n var li = document.createElement('li');\n li.setAttribute('id', item);\n appendAttribute(li, 'class', 'list-group-item');\n ul.appendChild(li);\n\n self.PostPreviewToHTML(gs_post_path+'/'+item, item);\n itemCnt++;\n }\n };\n\n /* Download a post file (yaml + markdown), parse YAML, convert to HTML,\n * then post to given div-id. */\n this.PostPreviewToHTML = function(relpath, markdown_div) {\n var callback = function (text) {\n\n /* circumvent github's auto-meta parsing */\n text = text.replace(\"(((\",'---');\n text = text.replace(\")))\",'---');\n\n if ((isBlank(text)) || (text == null) || (text == 'null') ||\n (typeof text === 'undefined')) {\n var li = document.getElementById(markdown_div);\n li.innerHTML = 'Unable to load text for: '+relpath;\n return;\n }\n\n /* parse YAML header */\n var obj = jsyaml.loadFront(text)\n\n /* check for post meta data */\n var date = typeof obj.Date !== 'undefined' ? obj.Date.toDateString() : '';\n var author = typeof obj.Author !== 'undefined' ? obj.Author : '';\n var summary = typeof obj.Summary !== 'undefined' ? obj.Summary : '';\n var title = typeof obj.Title !== 'undefined' ? obj.Title : '';\n\n /* write some HTML to format the data */\n var li = document.getElementById(markdown_div);\n li.innerHTML = '<a href=?post='+markdown_div+'><b>'+title+\n '</b><br></a> ' + author + ' | <small>' + \n date + '</small><br><i>' + summary +\n '</i>';\n\n };\n getFile(relpath, callback);\n };\n\n this.genBlogIndex();\n}","function generateGemini() {\n\tprint(\"\\x1b[90m->\\x1b[0m generating gemini site...\");\n\t// sanity\n\tlet files = {};\n\n\t// generate index\n\tlet _books = [\"📕\", \"📗\", \"📘\", \"📙\", \"📓\"].sort(() => Math.random() - .5); // random book emojis\n\tlet _wikiRecent = pages\n\t\t// remove stubs\n\t\t.filter(page => !page.category.includes(\"stub\"))\n\t\t// first five\n\t\t.slice(0, 5)\n\t\t// render\n\t\t.map((p, i) => {\n\t\t\tlet book = _books[i]; // get random book emoji\n\t\t\tlet category = prependRelevantEmoji(p.category[0]);\n\t\t\treturn `=> /wiki/${p.page}.xyz ${book} wiki/${p.title}`\n\t\t\t\t+ \"\\n```\\n \" + `[${p.modified}] [${category}]` + \"\\n```\";\n\t\t})\n\t\t// stringify\n\t\t.join(\"\\n\");\n\tfiles[\"index\"] = templates[\"index.gmi\"].replace(\"{wiki_recent}\", _wikiRecent);\n\n\t// generate wiki index\n\tlet _wikiAll = pages\n\t\t// remove stubs\n\t\t.filter(page => !page.category.includes(\"stub\"))\n\t\t// render\n\t\t.map(p => {\n\t\t\tlet category = p.category.map(prependRelevantEmoji).join(\", \");\n\t\t\treturn `=> /wiki/${p.page}.xyz ${p.title}` +\n\t\t\t\t\"\\n```\\n \" + `[${p.modified}] [${category}]` + \"\\n```\";\n\t\t})\n\t\t// stringify\n\t\t.join(\"\\n\");\n\tfiles[\"wiki/index\"] = templates[\"wiki-index.gmi\"].replace(\"{wiki_all}\", _wikiAll);\n\n\tfiles[\"stats\"] = templates[\"stats.gmi\"];\n\n\t// generate wiki pages\n\tpages.forEach(p => {\n\t\tfiles[\"wiki/\" + p.page] = templates[\"wiki-page.gmi\"].replace(\"{content}\", p.content);\n\t});\n\n\t// write pages\n\tlet x = 0;\n\tlet _files = Object.keys(files);\n\t_files.forEach((f) => new Promise((resolve, reject) => {\n\t\tlet content = files[f]\n\t\t\t// remove html-only templates\n\t\t\t.replace(/{html[a-z_]*}\\n/g, \"\")\n\t\t\t// add filenames to thumbnails\n\t\t\t.replace(/(\\w*)\\.(png|jpg) (thumbnail|cover|image)/gi, \"$1.$2 $3 ($1.$2)\")\n\t\t\t// replace ambiguous links\n\t\t\t.replace(/\\.xyz/g, \".gmi\");\n\n\t\tlet _f = std.open(\"out/gemini/\" + f + \".gmi\", \"w\");\n\t\tif (_f.error()) return reject(_f.error());\n\t\t_f.puts(content);\n\n\t\t// update terminal readout\n\t\tstd.printf(`\\r\\x1b[32m-->\\x1b[0m wrote gemini page ${x + 1}/${_files.length}`);\n\t\t// if all pages have been written\n\t\tif (++x == _files.length) {\n\t\t\tstd.printf(\"\\n\");\n\t\t\tgenerateHTML(files);\n\t\t}\n\t\tresolve();\n\t}).catch(print));\n}","function buildPage(){\n addItems('make', make);\n addItems('model', model);\n addItems('keywords', keywords);\n checkAll();\n}","function buildPortfolio() {\n const queue = [];\n queue.push(publish(Portfolio, {\n pagePath: '/showcase/',\n pageHeading: Portfolio.defaultProps.pageHeading\n }));\n global.DBUSHELL.__pConfig.pages.forEach(props => queue.push(\n publish(Page, {\n ...props,\n pageHeading: props.pageHeading,\n pagePath: `/showcase/${props.slug}/`,\n innerHTML: Page.getHTML(path.join(global.DBUSHELL.__pSrc, `${props.slug}.md`))\n })\n ));\n return Promise.all(queue);\n}","function generateBlogPostsIndex(graphql, createPage){\n\n //Query the siteMetadata for the blogs, For each blog -\n let prArray = [] //the promise array\n BC.forEach((blog) =>{\n // query all the markdown in it's children folder with -\n // render!=false, publish=true, type=post\n\n //RegEx cant end without '/', it interprets \"blog\" as a flag. like \\foo.bar/g\\ \n // where 'g' is the flag. Never mind, it needs 2 \"/\" at the end. Sigh. :'(\n // This regex processing is WEIRD - (some even need to start with '/')\n // NEED to figure out whats happening, gatsby's handling mostly\n // Even though it's a string, needs to start and end with \"/\"\n let blogPath = `${__dirname}/src/pages/${blog.path}/`\n let filePath = `${blogPath}posts/index.md`\n\n let task = graphql(`\n {\n allMarkdownRemark(\n filter: {\n fileAbsolutePath: {regex: \"${blogPath}/\"}\n frontmatter:{\n published: {eq : true}\n type: {ne: \"page\"}\n }\n }\n ){\n totalCount\n }\n\n markdownRemark(\n fileAbsolutePath :{eq:\"${filePath}\"}\n ){\n id\n frontmatter {\n layout\n postsPerPage\n }\n fields{\n slug\n }\n }\n }\n `)\n .then(result => {\n let {allMarkdownRemark, markdownRemark} = result.data\n let layout = markdownRemark.frontmatter.layout || \"blog-posts-index.js\"\n let postsPerPage = markdownRemark.frontmatter.postsPerPage || 5\n let numPages = Math.ceil(allMarkdownRemark.totalCount/ postsPerPage)\n let slug = markdownRemark.fields.slug\n\n Array.from({ length: numPages }).forEach((_, i) => {\n createPage({\n path: i === 0 ? slug : `${slug}${i + 1}`,\n component: path.resolve(`./src/templates/${layout}`),\n context: {\n limit: postsPerPage,\n skip: i * postsPerPage,\n blogPath: blogPath+'/', //apparently you need this :( or it matches 'blog' and 'blog2'\n filePath,\n totalPages: numPages\n },\n })\n })\n })\n\n prArray.push(task)\n })\n\n return Promise.all(prArray)\n\n}","function build(options) {\n\n options = extend(true, defaultOptions, options);\n\n return function() {\n\n return gulp.src(options.src.css)\n .pipe(extract())\n .pipe(rename({ extname: '.html' }))\n .pipe(ssg({ sort: 'order' }))\n .pipe(render(options.site, compiledTemplates))\n .pipe(gulp.dest(options.dest.html));\n };\n}","function renderPageForBots() {\n\n /* Fill the body content with either a blog-index, post or page. */\n if (gsConfig.blogIndexIsActive()) {\n\n /* use the sitemap instead of the blog index */\n var gsSitemap = new Sitemap(gsConfig);\n PrettyMarkdownTextToHTML(gsSitemap.links(), gs_body_id);\n\n } else if (gsConfig.postIsActive()) {\n /* If a post was found in the url query. */\n MarkdownFileToBody(gs_post_path+'/'+gsConfig.requested_page);\n\n /* render previous and next links */\n var gsPagination = new PageNav(gsConfig);\n gsPagination.genPostNavListTags();\n\n } else {\n /* The active page needs to correspond to a file at this point so \n * that the getter can download it. The getter should be post aware.*/\n MarkdownFileToBody(gsConfig.requested_page); \n }\n\n /* render the simple sitemap */\n if (gsConfig.sitemapIsActive()) {\n var gsSitemap = new Sitemap(gsConfig);\n PrettyMarkdownTextToHTML(gsSitemap.links(), gs_body_id);\n }\n\n /* Fill the body content with either a blog-index, post or page. */\n /* fill in the navbar */\n var gsNav = new Nav(gsConfig);\n \n}","function build_content(path) {\r\n var _con = content,\r\n // package.json\r\n json = '{' + eol, ce = program.css, dir_arr = build_path(path), engine = program.template;\r\n json += ' \"name\": \"' + program.name + '\" \\'' + eol;\r\n json += '+\\' , \"version\": \"0.0.1-alpha\" \\'' + eol;\r\n json += '+\\' , \"private\": true \\'' + eol;\r\n json += '+\\' , \"dependencies\": { \\'' + eol;\r\n if(program.css)\r\n json += '+\\' \"' + program.css + '\": \">= 0.0.1\" \\'' + eol;\r\n if(program.template)\r\n json += ' +\\' , \"' + program.template + '\": \">= 0.0.1\" \\'' + eol;\r\n json += '+\\' } \\'' + eol;\r\n json += '+\\'}';\r\n var css_content = 'var ' + engine + 'Layout=' + config.template[engine + 'Layout'] + eol + 'var ' + engine + 'Index=' + config.template[engine + 'Index'] + eol;\r\n _con = _con.replace(\"{name}\", program.name).replace(\"{json}\", json.replace(/\\r\\n/,''));\r\n _con = _con.replace(\"{css_template}\", css_content);\r\n _con = _con.replace(\"{create_css}\", ' write(path + \"' + config.custum_dir.css[ce] + '/style.css\", \"/*please write your '+ program.css +' code here!*/\");' + eol);\r\n _con = _con.replace(\"{create_js}\", '//todo: choose some lib to use ' + program.architec + ' by yourself!'+eol);\r\n _con = _con.replace(\"{create_template}\", '//todo: load template to use ' + program.css + ' by yourself!' + eol);\r\n _con = _con.replace(\"{create_html}\", 'write(path +\"/index.html\",index_html);'+eol);\r\n _con = _con.replace(\"{dir}\",\"'\"+ dir_arr+\"'.split(',').join(' '+path).split(' ').slice(1)\"+eol);\r\n return _con;\r\n}","static build()\n\t{\n\t\tIndex.buildeNotifications();\n\t\tIndex.buildePersonalPanel();\n\t\tIndex.buildePageContent();\n\t\t\n\t\taddCollapseFunction();\n\t}","function build(cb) {\n const buildCommand = 'JEKYLL_ENV=production bundle exec jekyll build';\n exec(buildCommand, (error, stdout, stderr) => {\n if (error) {\n gutil.log(gutil.colors.magenta(`exec error: ${error}`));\n return cb(error);\n }\n\n gutil.log(stdout);\n gutil.log(gutil.colors.magenta(stderr));\n cb()\n });\n}","function taskMarkup() {\n logSubtask('markup');\n\n return gulp.src(`${MARKUP_SRC}/pages/**/*.html`)\n .pipe(panini({\n root: `${MARKUP_SRC}/pages/`,\n layouts: `${MARKUP_SRC}/layouts/`,\n partials: `${MARKUP_SRC}/partials/`,\n }))\n .pipe(gulp.dest(MARKUP_DIST));\n}","function createIndex(err) {\n if (err) throw err\n fs.readFile(template, 'utf8', function(err, template) {\n if (err) throw err\n fn = jade.compile(template, { pretty: true })\n results.title = (program.title) ? program.title : 'Readme Docs'\n results.github = (program.github) ? program.github : false\n // css addition\n results.css = false\n if (program.css) {\n // copy the file to the build/css folder\n var cssName = path.basename(program.css)\n fs.copy(program.css, path.join(build, 'css', cssName), function(err) {\n if (err) throw err\n // add the css file\n results.css = cssName\n finishFile()\n })\n } else {\n finishFile()\n }\n })\n }","function build() {\n //conditional statement that checks if the output directory has been created\n if(!fs.existsSync(OUTPUT_DIR)) {\n fs.mkdirSync(OUTPUT_DIR)\n\n }\n //validation of dir and path variables\nconsole.log(OUTPUT_DIR, outputPath)\n//this writes the html file\nfs.writeFileSync(outputPath, render(members), \"utf-8\")\n\n}","function pages() {\n return gulp.src('src/pages/**/*.{html,hbs,handlebars}')\n .pipe(panini({\n root: './src/pages/',\n layouts: './src/layouts/',\n partials: './src/partials/',\n helpers: './src/helpers/',\n data: './src/data',\n }))\n .pipe(gulp.dest('./dist/'))\n}","function compile() {\n sites.map(function (site) {\n stylesDev(site);\n scriptsDev(site);\n });\n}","function jekyll() {\n return child_process.spawn(\"bundle\", [\"exec\", \"jekyll\", \"build\", \"--profile\", \"--trace\"], { stdio: \"inherit\" });\n}","function pages() {\n return gulp.src(['src/pages/**/*.html','!src/pages/**/_*.html']) \n .pipe(panini({\n root: 'src/pages/',\n layouts: 'src/layouts/',\n partials: 'src/partials/',\n data: 'src/pages/**/',\n helpers: 'src/helpers/'\n }))\n .pipe(htmlImg64())\n .pipe(base64('/')) \n .pipe(htmlsplit())\n // .pipe(rename(function (path) {\n // // { dirname: 'huynhtan', basename: 'index', extname: '.xml' }\n // if ((path.extname === '.xslt' || path.extname === '.xml') && path.dirname !== ''){\n // path.basename = path.dirname;\n // }\n // }))\n .pipe(gulp.dest(PATHS.dist))\n\n}","function pagesDist() {\n return gulp.src( 'src/pages/**/*.html' )\n .pipe( panini({\n root: 'src/pages',\n layouts: 'src/layouts',\n partials: 'src/partials',\n helpers: 'src/helpers',\n data: 'src/data'\n }))\n .pipe( gulp.dest( 'dist' ) );\n}","function pages() {\n return gulp.src(`${PATHS.pageTemplates}/**/*.{html,hbs,handlebars}`)\n .pipe(panini({\n root: PATHS.pageTemplates,\n layouts: PATHS.layouts,\n partials: PATHS.partials,\n data: PATHS.data,\n helpers: PATHS.helpers\n }))\n .pipe(rename((path) => {\n path.extname = \".html\";\n }))\n .pipe(gulp.dest(PATHS.dist));\n}","function pages() {\n\n return gulp.src('src/pages/**/*.{html,hbs,handlebars}')\n .pipe(panini({\n root: 'src/pages/',\n layouts: 'src/layouts/',\n partials: 'src/partials/',\n data: 'src/data/',\n helpers: 'src/helpers/'\n }))\n .pipe(gulp.dest(PATHS.dist));\n}","async function startBuildStep() {\n rimraf(finalPagesDir)\n fs.mkdirSync(finalPagesDir)\n\n if (logBuild) {\n console.log(`Building pages | from ${currentPagesDir} to ${finalPagesDir}`)\n }\n\n readPageNamespaces() // Next step\n}","function pages() {\n return gulp.src(paths.pages.src)\n .pipe(htmlmin({\n collapseWhitespace: true,\n removeComments: true\n }))\n .pipe(gulp.dest(paths.pages.dest));\n}","function html() {\n // Gets .html and .nunjucks files in pages\n return gulp.src('src/pages/**/*.+(html|nunjucks)')\n // Renders template with nunjucks\n .pipe(nunjucksRender({\n path: ['src/templates']\n }))\n // output files in src folder\n .pipe(gulp.dest('app'));\n}","build () {}","async function createDemo() {\n if (!existsSync(deploy_dir)) await mkdir(deploy_dir, { recursive: true });\n\n const PORT = parseInt(process.env.PORT || '4000');\n let baseUrl = 'http://localhost:' + PORT;\n let url = new URL(baseUrl);\n const path = (() => {\n const path = url.pathname.replace(/.html$/, '');\n if (path.endsWith('/') || path.length < 1) return path + 'index';\n return path;\n })();\n\n const view = join(__dirname, 'src-docs');\n const view_ejs = join(view, path + '.ejs');\n const title = 'Safelinkify - External Link Anonymizer';\n if (existsSync(view_ejs)) {\n const helpers = new EJSHelper({\n root: join(view, 'layout.ejs')\n });\n const renderPage = await helpers.renderFile(view_ejs);\n helpers.add('body', renderPage);\n helpers.add('title', title);\n helpers.add('description', pkg.description);\n let renderLayout = await helpers.renderFile(join(view, 'layout.ejs'));\n\n // write to test folder\n await writeFile(join(__dirname, 'src/test/index.html'), renderLayout);\n\n /** Safelinkify */\n renderLayout = await safelinkInstance.parse(renderLayout);\n\n /** minify for github pages */\n\n let result = '';\n try {\n result = await minify(renderLayout, {\n minifyCSS: true,\n minifyJS: true,\n collapseWhitespace: true\n });\n } catch {\n result = renderLayout;\n }\n\n // save demo index.html\n const saveTo = join(deploy_dir, 'index.html');\n await writeFile(saveTo, result);\n console.log('demo saved', saveTo);\n }\n}","function buildProcess({ page, buildConfig, env }) {\n const { minify, pretty, livereload } = buildConfig\n\n const isProd = env === 'production'\n const shouldMinifyHtml = isProd && minify.enabled\n const shouldPrettifyHtml = !isProd && pretty.enabled\n const shouldLivereload = !isProd && livereload.enabled\n\n let builtPage = page\n\n if (shouldLivereload) {\n builtPage = withLivereload(builtPage, livereload.options)\n }\n\n if (shouldMinifyHtml) {\n builtPage = minifyHtml(builtPage, minify.options)\n }\n\n if (shouldPrettifyHtml) {\n builtPage = prettyHtml(builtPage, pretty.options)\n }\n\n return builtPage\n}","function createWebsite() {\n\n fs.writeFile('./dist/index.html', generateTeamHtml(allEmployees), (err) =>\n err ? console.error(err) : console.log('Team HTML File Generated!'));\n console.log('The file has been saved!')\n console.log(allEmployees[1].school);\n}","function buildContent(data, $this, template) {\n\t\tvar newURL;\n\t\tvar html;\n\t\t/* A check to see if this is a Grid SEO page */\n\t\tvar seoPage = Boolean($('#skjpsp_ops').val() === '1');\n\t\tvar hasCorrectURL = checkForCorrectURLStructure(data);\n\n\t\t// Checks to see if this is a SEO page and if the URL is correct in the JSON\n\t\t// We then push the updated SEO URL if it's a ContentView Page, if not it does nothing\n\t\tif (seoPage && !hasCorrectURL) {\n\t\t\tnewURL = data.url.split('=');\n\t\t\t// self refferencing but...\n\t\t\tdata.url = (newURL[0].split('?')[0] === 'ContentView') ? '/c/' + newURL[1] : data.url;\n\t\t}\n\n\t\t// Build out and append our template(s)\n\t\thtml = mustache.to_html(mustacheTemplates[template], data);\n\t\t$(html).appendTo($this);\n\t}","function generateHTML(fileList) {\r\n try {\r\n const blogList = []\r\n const htmlString = readTemplate('template/post.html')\r\n\r\n let prevPage = ``\r\n let nextPage = ``\r\n const fileListLength = fileList.length\r\n fileList.reverse()\r\n\r\n for (let i = 0; i < fileListLength; ++i) {\r\n const timeStart = process.hrtime()\r\n\r\n if (i > 0) {\r\n const fInfo = fileList[i - 1].split(path.sep).slice(-1)[0].split(`_`)\r\n const fileNamePath = fInfo.slice(0,1)[0].split(`-`).slice(0,2).concat(fInfo.slice(1)[0].slice(0,-3))\r\n prevPage = path.join(path.sep, ...(fileNamePath) ,`index.html`)\r\n } else {\r\n prevPage = ``\r\n }\r\n\r\n if (i < fileListLength - 1) {\r\n const fInfo = fileList[i + 1].split(path.sep).slice(-1)[0].split(`_`)\r\n const fileNamePath = fInfo.slice(0,1)[0].split(`-`).slice(0,2).concat(fInfo.slice(1)[0].slice(0,-3))\r\n nextPage = path.join(path.sep, ...(fileNamePath) ,`index.html`)\r\n } else {\r\n nextPage = ``\r\n }\r\n\r\n let statData = ``\r\n const fileData = fs.readFileSync(fileList[i], 'utf-8')\r\n const fileInfo = {}\r\n fileInfo.fileName = fileList[i]\r\n fileInfo.contents = fileData\r\n\r\n const fileContents = parseFile(fileInfo)\r\n assertCheck(fileContents)\r\n\r\n const htmlData = markdown.render(fileContents.htmlData)\r\n const dateLong = `${dateFormat(fileContents.metadata.date, \"yyyy-mm-dd\")}`\r\n const dateLongArray = dateLong.split(`-`)\r\n const dirArray = dateLongArray.slice(0,2).concat(\r\n fileList[i].split(path.sep)\r\n .slice(-1)[0]\r\n .split('_').slice(1)\r\n .join('_').slice(0, -3)\r\n )\r\n \r\n let breadCrumb = [`Home`].concat(dateLongArray.slice(0,2))\r\n let breadCrumbElem = `<ul class=\"breadcrumb\">`\r\n let blogLink = `/`\r\n for (let x = 0; x < breadCrumb.length; ++x) {\r\n if (x > 0) {\r\n blogLink += breadCrumb[x] + `/`\r\n }\r\n let singleCrumb = `<li><a href=\"${blogLink}\">${breadCrumb[x]}</a></li>`\r\n breadCrumbElem += singleCrumb\r\n \r\n }\r\n breadCrumbElem += `</ul>`\r\n\r\n let outputData = htmlString\r\n\r\n outputData = outputData.replace(`||title||`, fileContents.metadata.title)\r\n outputData = outputData.replace(`||breadcrumb||`, breadCrumbElem)\r\n outputData = outputData.replace(`||blog-title||`, fileContents.metadata.title)\r\n outputData = outputData.replace(`||blog-date||`, fileContents.metadata.blogDate)\r\n outputData = outputData.replace(`||blog-post||`, htmlData)\r\n \r\n fs.mkdirSync((path.join(__dirname, `public`, ...(dirArray))),\r\n { recursive: true }, \r\n (err) => {\r\n consoleError(err)\r\n throw (`Error in creating the directory`)\r\n }\r\n )\r\n\r\n const outputFileName = path.join(`public`, ...(dirArray) ,`index.html`)\r\n const timeEnd = process.hrtime(timeStart)\r\n\r\n if (prevPage !== ``) {\r\n statData = `<a id=\"prevPost\" href=\"${prevPage}\">Prev</a>`\r\n } else {\r\n statData = `<a id=\"prevPost\" href=\"${prevPage}\"></a>`\r\n }\r\n \r\n statData += `<p>Page generated in ${((timeEnd[0] * 1e9 + timeEnd[1]) / 1e6).toString().substr(0,5)} ms</p>`\r\n \r\n if (nextPage !== ``) {\r\n statData += `<a id=\"nextPost\" href=\"${nextPage}\">Next</a>`\r\n } else {\r\n statData += `<a id=\"nextPost\" href=\"${nextPage}\"></a>`\r\n }\r\n\r\n outputData = outputData.replace(`||page-footer||`, statData)\r\n fs.writeFileSync(outputFileName, outputData)\r\n\r\n const blogData = {}\r\n blogData.metadata = fileContents.metadata\r\n blogData.location = dirArray\r\n blogList.push(blogData)\r\n consoleAqua(`FILE WRITTEN => ${outputFileName}`)\r\n }\r\n\r\n generateBlogList(blogList)\r\n } catch (err) {\r\n consoleError(`ERROR in generateHTML`)\r\n consoleError(`ERROR => ${err.stack}`)\r\n }\r\n}","function pug() {\n // JSONファイルの読み込み。\n const locals = {\n site: JSON.parse(fs.readFileSync(`${src.data}/site.json`)),\n };\n // locals.ja = {\n // // 日本語サイト\n // site: JSON.parse(fs.readFileSync(`${src.data}ja/site.json`)),\n // };\n // locals.en = {\n // // 英語サイト\n // site: JSON.parse(fs.readFileSync(`${src.data}en/site.json`)),\n // };\n return (\n gulp\n .src(src.html)\n .pipe(\n plumber({ errorHandler: notify.onError(\"Error: <%= error.message %>\") })\n )\n // .pipe(\n // data(file => {\n // // 各ページのルート相対パスを格納します。\n // locals.pageAbsolutePath = `/${path\n // .relative(file.base, file.path.replace(/.pug$/, '.html'))\n // .replace(/index\\.html$/, '')}`;\n // return locals;\n // }),\n // )\n // .pipe(cache('html'))\n .pipe(\n gulpPug({\n // `locals`に渡したデータを各Pugファイルで取得できます。\n locals,\n // ルート相対パスでincludeが使えるようにします。\n basedir: src.pug,\n // Pugファイルの整形。\n pretty: true,\n })\n )\n .pipe(gulp.dest(dest.root))\n .pipe(browserSync.reload({ stream: true }))\n );\n}","function buildPage(file, data) {\n // Create a file called teamprofilepage.html, adding the input data transformed by generateHTML.js formatting.\n fs.writeFile(\"./dist/teampage.html\", generateHTML(data), function (error) {\n // If file created successfull, notify user of success in the command line interface. If error, notify user in the command line interface.\n if(error) {\n console.log(\"An unknown error occurred.\")\n }\n else {\n console.log(\"Your teampage.html file has been created successfully!\")\n }\n })\n}","function pages() {\n return gulp.src('src/templates/**/*.tpl.html')\n .pipe(panini({\n root: 'src/templates',\n layouts: 'src/layouts',\n partials: 'src/partials',\n helpers: 'src/helpers'\n }))\n .pipe(inky())\n .pipe($.extReplace('.php'))\n .pipe(gulp.dest('templates'))\n\n // Update compiled file timestamp.\n .pipe($.shell([\n 'touch <%= file.path %>'\n ]));\n}","function contentPrepComplete() {\n // Loop through our pages.\n siteIndex.content.forEach((file) => {\n // Index pages are special cased to allow site maps and sectional nav.\n if (file.localName.endsWith('/index.html')) {\n parsers.loadTemplate('map', {\n map: siteIndex.map,\n }).then((response) => {\n parsers.loadTemplate('index', {\n page: {\n content: file.html,\n sidebar: '',\n title: file.title,\n map: response,\n tags: siteIndex.tags,\n },\n });\n }).then((response) => {\n parsers.loadTemplate('html', {\n page: response,\n });\n }).then((fullResponse) => {\n fileHandlers.outputFile(siteConfig, file, fullResponse);\n });\n } else {\n // All other pages go on through (at least for now).\n parsers.loadTemplate('page', {\n page: {\n content: file.html,\n sidebar: '',\n title: file.title,\n },\n }).then((response) => {\n parsers.loadTemplate('html', {\n page: response,\n }).then((fullResponse) => {\n fileHandlers.outputFile(siteConfig, file, fullResponse);\n });\n });\n }\n });\n\n // Copy supporting files.\n fileHandlers.copyHandler(siteConfig);\n}","function init() {\n fse\n .readJson('./site.json')\n .then(function(site) {\n // if the destination dir exists\n if (fse.pathExistsSync(config.baseDir)) {\n // clean it out before writing files\n fse.emptyDirSync(config.baseDir);\n } else {\n // ensure the destination dir exists\n fse.ensureDirSync(config.baseDir);\n }\n\n // copy assets in `/media`\n copyDirectory(config.mediaRoot, config.baseDir);\n // builds the CSS and JS bundles\n buildBundles(site.bundles);\n // generates the pages\n buildPages(site.pages);\n // clean up\n removeJSBundles();\n })\n .catch(function(err) {\n console.error('Error thrown while loading JSON', err);\n });\n}","function pages() {\n return gulp.src(PATHS.srcPages)\n .pipe(panini({\n root: 'src/pages/',\n layouts: 'src/layouts/',\n partials: 'src/partials/',\n data: 'src/data/',\n helpers: 'src/helpers/'\n }))\n .pipe(gulp.dest(PATHS.dist));\n}","function build_site_obj(){\n\t\t\tvar nav = {};\n\t\t\tfor (var page_key in sitemap.pages) {\n\t\t\t\t//apply defaults were needed\n\t\t\t\tsitemap.pages[page_key].nav_key = page_key;\n\t\t\t\t//note extend will not work here, for some reason it'll alter the ref of defaults\n\t\t\t\t//we'll have to do it by hand for the moment\n\t\t\t\tfor (var objKey in defaults){\n\t\t\t\t\tif(typeof sitemap.pages[page_key][objKey] === \"undefined\"){\n\t\t\t\t\t\tsitemap.pages[page_key][objKey] = defaults[objKey];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t//build nav\n\t\t\t\tvar pagenav = sitemap.pages[page_key].nav!==undefined ? sitemap.pages[page_key].nav:{};\n\t\t\t\tif(pagenav!==false){\n\t\t\t\t\tvar tmpobj={};\n\t\t\t\t\tvar root = sitemap.pages[page_key].nav_root.replace(new RegExp(\"[\\/]+$\", \"g\"), \"\");\n\n\t\t\t\t\tvar linkTitle = sitemap.pages[page_key].title;\n\t\t\t\t\tif(typeof pagenav.nav_title !== \"undefined\" ){\n\t\t\t\t\t\tlinkTitle = pagenav.nav_title;\n\t\t\t\t\t}\n\t\t\t\t\tif(typeof pagenav.parent !== \"undefined\" && typeof nav[pagenav.parent] !== \"undefined\" ){\n\t\t\t\t\t\tvar pnav = nav[pagenav.parent];\n\t\t\t\t\t\tvar exnav = {};\n\t\t\t\t\t\tvar exurl = linkTitle;\n\t\t\t\t\t\tif(typeof pagenav.nav_link !== \"undefined\" ){\n\t\t\t\t\t\t\texurl=pagenav.nav_link;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\texurl=root+\"/\"+sitemap.pages[page_key].nav_key+\".html\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\texnav[linkTitle] = exurl;\n\n\t\t\t\t\t\tvar tmp = {};\n\t\t\t\t\t\tif(typeof pnav===\"object\"){\n\t\t\t\t\t\t\ttmp=extend(pnav,exnav);\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\ttmp[pagenav.parent]=pnav;\n\t\t\t\t\t\t}\n\t\t\t\t\t\texnav = extend(tmp,exnav);\n\t\t\t\t\t\tnav[pagenav.parent] = exnav;\n\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif(typeof pagenav.nav_link !== \"undefined\" ){\n\t\t\t\t\t\t\ttmpobj[linkTitle]=pagenav.nav_link;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\ttmpobj[linkTitle]=root+\"/\"+sitemap.pages[page_key].nav_key+\".html\";\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(typeof pagenav.child_nav !== \"undefined\"){\n\t\t\t\t\t\tvar r = tmpobj[linkTitle];\n\t\t\t\t\t\tvar navarray = {};\n\n\t\t\t\t\t\tvar mainlink= sitemap.pages[page_key].title;\n\t\t\t\t\t\tif(typeof pagenav.nav_title !== \"undefined\" ){\n\t\t\t\t\t\t\tmainlink = pagenav.nav_title;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tnavarray[mainlink] = r;\n\t\t\t\t\t\tfor (var link in pagenav.child_nav){\n\t\t\t\t\t\t\tvar url = link;\n\t\t\t\t\t\t\tvar title = pagenav.child_nav[link];\n\t\t\t\t\t\t\tif(link.indexOf(\"#\")===0){\n\t\t\t\t\t\t\t\turl=r+link;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tnavarray[title] = url;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttmpobj[linkTitle]=navarray;\n\t\t\t\t\t}\n\t\t\t\t\tnav = extend(nav,tmpobj);\n\t\t\t\t}\n\t\t\t}\n\t\t\tsitemap.nav = nav;\n\t\t}","function buildPage() {\n // Set the title with the location name at the first\n // Gets the title element so it can be worked with\n let pageTitle = document.querySelector('#page-title');\n // Create a text node containing the full name\n let fullNameNode = document.createTextNode(sessStore.getItem('fullName'));\n // inserts the fullName value before any other content that might exist\n pageTitle.insertBefore(fullNameNode, pageTitle.childNodes[0]);\n // When this is done the title should look like this:\n // Soda Springs, Idaho | mybetterweather.com\n }","function renderPost(post, site) {\n //take the tags plugin, filter off properties that is not functions, then return an array of functions because showdown needs an array\n var converter = new _marked.Converter({tables: true, extensions: Object.keys(_tags).filter(function (key) {\n var black_list = ['post', 'site'];\n\n return black_list.indexOf(key) === -1;\n }).map(function (key) {\n return _tags[key];\n })}),\n path;\n\n //before we convert markdown, we need to init our extensions to the current post\n _tags.post = post;\n _tags.site = site;\n\n post.body = post.content;\n\n //before templating, we need to convert the body into html\n post.body = converter.makeHtml(post.body);\n\n //check tags to ensure got plugins\n getTags(post.body).forEach(function (tag) {\n //if a tag do not have plugin we notify\n if (_tags[tag.name] === undefined) {\n console.error('Tag plugin not found: ' + tag.name + ' ' + post.slug);\n }\n });\n\n post.is_post = true;\n post.is_home = false;\n\n getRelated(site, post);\n\n //Convert markdown to html\n path = _path.join(post.folder, '/_theme/_post.ejs');\n\n //if there is a _post.ejs in site/_theme we use it, otherwise we default to octa/_theme/_post.ejs\n return _fs.pathExists(path).then(function (exists) {\n if (!exists) { path = _path.join(cwd, '/_theme/_post.ejs'); }\n\n return _ejs.renderFile(path, {data: post, site: site, helper: _helper})\n .then(function (str) { return syncFile(str, _path.join(post.output, 'index' + config.extension)); });\n });\n\n function getTags(content) {\n var str = content,\n close_regex = /\\{% (\\w+)(.*?)%\\}\\n(.*?)\\n\\{% end\\1 %\\}\\n/gs,\n tag_regex = /(?:<p>)?\\{% (\\w+) (.*?)%\\}(?:<p>)?/g,\n tags = [],\n matches;\n\n //for closing tags, we get the content\n while (matches = close_regex.exec(content)) {\n tags.push({name: matches[1]});\n\n //tags.push({name: matches[1], content: matches[3], args: getArgs(matches[2]), body: matches[0]});\n\n str = str.replace(matches[0], '');\n }\n\n //for non closing tags, we do not care about content\n while (matches = tag_regex.exec(str)) {\n tags.push({name: matches[1]});\n //tags.push({name: matches[1], args: getArgs(matches[2]), body: matches[0]});\n }\n\n return tags;\n }\n\n function getRelated(site, post) {\n var i = 0;\n\n post.related = [];\n\n //for each of the sorted post, find if they contain any tags in the current post\n for (; i < site.sorted.length; i++) {\n //do not check own self\n if (post.slug !== site.posts[site.sorted[i]].slug && exist(post.tags, site.posts[site.sorted[i]].tags)) {\n post.related.push(site.posts[site.sorted[i]]);\n if (post.related.length >= 3) { break; }\n }\n }\n\n //if after finding all the tags, and related is still not length === 3, we insert the latest post\n if (post.related.length < 3) {\n i = 0;\n do {\n if (post.slug !== site.posts[site.sorted[i]].slug) {\n post.related.push(site.posts[site.sorted[i]]);\n }\n i++;\n } while (post.related.length < 3 && i < site.sorted.length);\n }\n\n function exist(needles, haystack) {\n return (needles || []).some(function (needle) { return (haystack || []).indexOf(needle) >= 0; });\n }\n }\n }","function createIndexHTML() {\n const distPath = path.join(__dirname, '..', 'dist')\n fs.stat(distPath, (err) => {\n if (!err) {\n writeIndexContents()\n } else {\n fs.mkdir(distPath, (err) => {\n if (err) {\n console.log('ERROR: mkdir failed' + err)\n } else {\n writeIndexContents()\n }\n })\n }\n })\n}","async function createSitemap() {\n\n const response = await axios.get(\"https://blog.gibkii-kamen.kz/api/blog\");\n const posts = response.data\n console.log(posts)\n // write the sitemap.xml file\n // directory MUST be `out/`\n await fs.writeFileSync(\"out/sitemap.xml\", generateSiteMap(posts));\n}","function doBuildReadme() {\n process.stdout.write('Building README.md\\n');\n var readmeBuf = fs.readFileSync(__dirname + '/README.md.hbs');\n var readmeTemplate = Handlebars.compile(readmeBuf.toString());\n // Collect all example files as `[{ title: '', 'content: '' }, ...]`\n var examples = fs.readdirSync(__dirname + '/examples')\n // match only js files\n .filter(function (filePath) {\n return filePath.match(/\\.js$/);\n })\n // convert file paths into template objects\n .reduce(function (list, filePath) {\n var mtch = filePath.match(/^(.*)\\.js$/);\n if (mtch && mtch[1]) {\n list.push({\n // title is extracted from file name\n title: mtch[1].replace(/_/g, ' '),\n // read file contents into buffer\n content: fs.readFileSync(path.resolve(__dirname + '/examples', filePath))\n });\n }\n return list;\n }, []);\n\n var readmeBuilt = readmeTemplate({\n examples: examples\n });\n\n fs.writeFileSync(__dirname + '/../README.md', readmeBuilt);\n}","build()\n\t{\n\t\t// get the data from the GET HTTP from the URL and build the page\n\t\tvar getParms = PageRender.readGetPrams();\n\t\tvar sorter;\n\t\tif (getParms.get(\"sort\") != null)\n\t\t{\n\t\t\tthis.sorter = getParms.get(\"sort\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthis.sorter = default_sorter;\n\t\t\tconsole.log(\"AcademicPublications.build did not find sorter, using default\");\n\t\t}\n\n\t\tvar filter;\n\t\tif (getParms.get(\"filter\") != null)\n\t\t{\n\t\t\tfilter = getParms.get(\"filter\");\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfilter = default_filter;\n\t\t\tconsole.log(\"AcademicPublications.build did not find filter, using default\");\n\t\t}\n\n\t\t// build the page itself\n\t\tthis.buildHeader(this.sorter, filter);\n\t\tthis.buildBody(this.sorter, filter);\n\n\t\taddCollapseFunction();\n\t}","async onPostBuild({ constants, inputs, utils }) {\n console.log('Replacing on-page images with Cloudinary URLs...');\n\n const host = process.env.DEPLOY_PRIME_URL || process.env.NETLIFY_HOST;\n\n if ( !host ) {\n console.warn(ERROR_NETLIFY_HOST_UNKNOWN);\n console.log(EEROR_NETLIFY_HOST_CLI_SUPPORT);\n return;\n }\n\n const { PUBLISH_DIR } = constants;\n const {\n deliveryType,\n loadingStrategy,\n uploadPreset,\n folder = process.env.SITE_NAME\n } = inputs;\n\n const cloudName = process.env.CLOUDINARY_CLOUD_NAME || inputs.cloudName;\n const apiKey = process.env.CLOUDINARY_API_KEY;\n const apiSecret = process.env.CLOUDINARY_API_SECRET;\n\n if ( !cloudName ) {\n utils.build.failBuild(ERROR_CLOUD_NAME_REQUIRED);\n return;\n }\n\n configureCloudinary({\n cloudName,\n apiKey,\n apiSecret\n });\n\n // Find all HTML source files in the publish directory\n\n const pages = glob.sync(`${PUBLISH_DIR}/**/*.html`);\n\n const results = await Promise.all(pages.map(async page => {\n const sourceHtml = await fs.readFile(page, 'utf-8');\n\n const { html, errors } = await updateHtmlImagesToCloudinary(sourceHtml, {\n assets: _cloudinaryAssets,\n deliveryType,\n uploadPreset,\n folder,\n localDir: PUBLISH_DIR,\n remoteHost: host\n });\n\n await fs.writeFile(page, html);\n\n return {\n page,\n errors\n }\n }));\n\n const errors = results.filter(({ errors }) => errors.length > 0);\n\n if ( errors.length > 0) {\n console.log(`Done with ${errors.length} errors...`);\n console.log(JSON.stringify(errors, null, 2));\n } else {\n console.log('Done.');\n }\n }","function buildWebsiteOnStartup() {\n populateDropdown();\n d3.json(\"samples.json\").then(data => {\n buildCharts(data.names[0]);\n populateDemographicInfo(data.names[0]);\n })\n}","function pages() {\n\n return gulp.src('email/src/pages/**/*.html')\n .pipe(panini({\n data: 'email/src/data',\n root: 'email/src/pages',\n layouts: 'email/src/layouts',\n partials: 'email/src/partials',\n helpers: 'email/src/helpers',\n }))\n .pipe(inky())\n .pipe(gulp.dest('email/dist'));\n}","function pages(done) {\n gulp.src('./src/templates/**/*.html')\n .pipe(router({\n path: './dist/assets/js/routes.js',\n root: 'src'\n }))\n .pipe(gulp.dest(PATHS.dist + '/templates'))\n done();\n }","function buildHtml() {\n // NOTE: sri-hash expects to find asset files referenced by the source HTML files either relative\n // to the file's base Vinyl attribute (which is typically the glob base, see here:\n // https://gulpjs.com/docs/en/api/concepts#glob-base) or relative to the directory containing the\n // HTML file.\n //\n // Neither of these work if we're piping HTML files located in the src directory directly into\n // sri-hash because the assets (CSS and JS files) referenced by those HTML files aren't fully\n // realized until they have been built and written to the dist directory. No amount of config can\n // get sri-hash to load the built assets from the dist directory if the HTML file it's currently\n // processing has a Vinyl path located under the src directory.\n //\n // Instead, we pipe the HTML files directly to dest, which writes them to dist and updates their\n // path attributes. We then call sri-hash to update the HTML files with the add the integrity\n // attributes. Finally, we write the new HTML file contents to disk.\n return gulp.src('./src/index.html')\n .pipe(gulp.dest('./dist'))\n .pipe(sriHash())\n .pipe(gulp.dest('./dist'));\n}","function build_page() {\n\n\t// set font & colors\n\tvar body = document.getElementById(\"background\");\n\tbody.style.fontFamily = font;\n\tbody.style.backgroundColor = background_color;\n\tbody.style.color = foreground_color;\n\n\t// create the pages or link containers for each\n\t// array element in the pages array\n\tvar num_pages = pages.length;\n\tfor(var i = 0; i < num_pages; i++) {\n\t\t// make the first page visible, all others hidden\n\t\tvar hidden = (i == 0) ? false : true;\n\t\tbody.appendChild(generate_link_container(hidden));\n\t}\n\n\t// for each page or 'container', populate corresponding links & titles\n\tvar containers = document.getElementsByClassName(\"links-container\");\n\tfor(var i = 0; i < containers.length; i++) {\n\t\tpages[i].forEach(link => {\n\t\t\tcontainers[i].appendChild(generate_link_element(link));\n\t\t});\n\t}\n\n\t// finally create the adequate number of 'select page' buttons\n\tvar navigation_container = document.getElementById(\"navigation\");\n\tfor(var i = 1; i <= num_pages; i++) {\n\t\t// apply 'selected' css class to first nav button\n\t\tvar selected = (i == 1) ? true : false;\n\t\tnavigation_container.appendChild(generate_navigation_button(i, selected));\n\t}\n}","function html() {\n const plugins = [...pluguin_html];\n\n return gulp.src(paths.html.src)\n .pipe(panini({\n root: 'src/pages/',\n layouts: 'src/layouts/',\n partials: 'src/partials/',\n data: 'src/data'\n }))\n .pipe(posthtml(plugins))\n .pipe(gulp.dest(directory));\n}","function publish(symbolSet) {\n\tpublish.conf = {\t// trailing slash expected for dirs\n\t\tname:\t\t\t\t\"neo-jsdoctpl-bootstrap\",\n\t\tversion:\t\t \"0.0\",\n\t\text:\t\t\t\t \".html\",\n\t\toutDir:\t\t\tJSDOC.opt.d || SYS.pwd+\"../out/jsdoc/\",\n\t\ttemplatesDir: JSDOC.opt.t || SYS.pwd+\"../templates/jsdoc/\",\n\t\tsymbolsDir:\t\"symbols/\",\n\t\tsrcDir:\t\t\t\"symbols/src/\"\n\t};\n\t\n // overwrite to a better Link module\n eval(include('extends/Link.js'));\n\n\t// is source output is suppressed, just display the links to the source file\n\tif (JSDOC.opt.s && defined(Link) && Link.prototype._makeSrcLink) {\n\t\tLink.prototype._makeSrcLink = function(srcFilePath) {\n\t\t\treturn \"<\"+srcFilePath+\">\";\n\t\t}\n\t}\n\t\n\t// create the folders and subfolders to hold the output\n\tIO.mkPath((publish.conf.outDir+\"symbols/src\").split(\"/\"));\n\tIO.mkPath((publish.conf.outDir+\"js\").split(\"/\"));\n\tIO.mkPath((publish.conf.outDir+\"css\").split(\"/\"));\n\tIO.mkPath((publish.conf.outDir+\"img\").split(\"/\"));\n\t\t\n\t// used to allow Link to check the details of things being linked to\n\tLink.symbolSet = symbolSet;\n\n\t// create the required templates\n\ttry {\n\t\tvar classTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\"class.tmpl\");\n\t\tvar classesTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\"allclasses.tmpl\");\n\t\tvar sourceTemplate =\tnew JSDOC.JsPlate(publish.conf.templatesDir+\"source.tmpl\");\n\t}\n\tcatch(e) {\n\t\tprint(\"Couldn't create the required templates: \"+e);\n\t\tquit();\n\t}\n\t\n\t// some ustility filters\n\tfunction hasNoParent($) {return ($.memberOf == \"\")}\n\tfunction isaFile($) {return ($.is(\"FILE\"))}\n\tfunction isaClass($) {return ($.is(\"CONSTRUCTOR\") || $.isNamespace)}\n\t\n\t// get an array version of the symbolset, useful for filtering\n\tvar symbols = symbolSet.toArray();\n\t\n\t\t\n\t\t// get a list of all the classes in the symbolset\n\t\tvar classes = smartSort(symbols.filter(isaClass));\n\t\n\t// create a filemap in which outfiles must be to be named uniquely, ignoring case\n\tif (JSDOC.opt.u) {\n\t\tvar filemapCounts = {};\n\t\tLink.filemap = {};\n\t\tfor (var i = 0, l = classes.length; i < l; i++) {\n\t\t\tvar lcAlias = classes[i].alias.toLowerCase();\n\t\t\t\n\t\t\tif (!filemapCounts[lcAlias]) filemapCounts[lcAlias] = 1;\n\t\t\telse filemapCounts[lcAlias]++;\n\t\t\t\n\t\t\tLink.filemap[classes[i].alias] = \n\t\t\t\t(filemapCounts[lcAlias] > 1)?\n\t\t\t\tlcAlias+\"_\"+filemapCounts[lcAlias] : lcAlias;\n\t\t}\n\t}\n\t\n\t// create a class index, displayed in the left-hand column of every class page\n\tLink.base = \"../\";\n\t\tpublish.classesIndex = classesTemplate.process(classes); // kept in memory\n\t\n\t// create each of the class pages\n\tfor (var i = 0, l = classes.length; i < l; i++) {\n\t\tvar symbol = classes[i];\n\t\t\n\t\tsymbol.events = symbol.getEvents();\t // 1 order matters\n\t\tsymbol.methods = symbol.getMethods(); // 2\n\t\t\n\t\tLink.currentSymbol= symbol;\n\t\tvar output = \"\";\n\t\toutput = classTemplate.process(symbol);\n\t\t\n\t\tIO.saveFile(publish.conf.outDir+\"symbols/\", ((JSDOC.opt.u)? Link.filemap[symbol.alias] : symbol.alias) + publish.conf.ext, output);\n\t}\n\n\t// create the source code files\n\tLink.base = \"../../\";\n\tpublish.classesIndex = classesTemplate.process(classes); // kept in memory\n\tvar files = JSDOC.opt.srcFiles;\n\t\tfor (var i = 0, l = files.length; i < l; i++) {\n\t\t\tvar file = files[i];\n\t\t\tvar srcDir = publish.conf.outDir + \"symbols/src/\";\n\t\t\tvar name = file.replace(/\\.\\.?[\\\\\\/]/g, \"\").replace(/[\\\\\\/]/g, \"_\");\n\t\t\tname = name.replace(/\\:/g, \"_\");\n\t\t\tvar output = \"\";\n\t\t\toutput = sourceTemplate.process({ file: file, source: escapeHTML(IO.readFile(file)) });\n\t\t\t\n\t\t\tIO.saveFile(srcDir, name + publish.conf.ext, output);\n\t\t}\n\t\n\t// regenerate the index with different relative links, used in the index pages\n\tLink.base = \"\";\n\tpublish.classesIndex = classesTemplate.process(classes);\n\t\n\t// create the class index page\n\ttry {\n\t\tvar classesindexTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\"index.tmpl\");\n\t}\n\tcatch(e) { print(e.message); quit(); }\n\t\n\tvar classesIndex = classesindexTemplate.process(classes);\n\tIO.saveFile(publish.conf.outDir, \"index\"+publish.conf.ext, classesIndex);\n\tclassesindexTemplate = classesIndex = classes = null;\n\t\n\t// create the file index page\n\ttry {\n\t\tvar fileindexTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\"allfiles.tmpl\");\n\t}\n\tcatch(e) { print(e.message); quit(); }\n\t\n\tvar documentedFiles = symbols.filter(isaFile); // files that have file-level docs\n\tvar allFiles = []; // not all files have file-level docs, but we need to list every one\n\t\n\tfor (var i = 0; i < files.length; i++) {\n\t\tallFiles.push(new JSDOC.Symbol(files[i], [], \"FILE\", new JSDOC.DocComment(\"/** */\")));\n\t}\n\t\n\tfor (var i = 0; i < documentedFiles.length; i++) {\n\t\tvar offset = files.indexOf(documentedFiles[i].alias);\n\t\tallFiles[offset] = documentedFiles[i];\n\t}\n\t\t\n\tallFiles = allFiles.sort(makeSortby(\"name\"));\n\n\t// output the file index page\n\tvar filesIndex = fileindexTemplate.process(allFiles);\n\tIO.saveFile(publish.conf.outDir, \"files\"+publish.conf.ext, filesIndex);\n\tfileindexTemplate = filesIndex = files = null;\n\n\t// Twitter Bootstrap\n\tvar dstDir;\n\n\tvar jsPaths = [\n 'jquery-1.7.2.min.js',\n 'accordion.js',\n 'bootstrap/js/bootstrap.min.js',\n 'google-code-prettify/prettify.js'\n\t\t];\n\tvar numOfJsPaths = jsPaths.length;\n\tvar jsPath;\n\n\tdstDir = publish.conf.outDir + 'js/';\n\tfor (var i = 0; i < numOfJsPaths; i++) {\n\t\tjsPath = jsPaths[i];\n\t\tIO.copyFile(publish.conf.templatesDir + 'static/' + jsPath, dstDir);\n\t}\n\n\tvar cssPaths = [\n\t\t\t'common.css',\n\t\t\t'bootstrap/css/bootstrap.min.css',\n\t\t\t'bootstrap/css/bootstrap-responsive.min.css',\n\t\t\t'google-code-prettify/prettify.css',\n\t\t\t'print.css'\n\t\t];\n\tvar numOfCssPaths = cssPaths.length;\n\tvar cssPath;\n\t\n\tdstDir = publish.conf.outDir + 'css/';\n\tfor (var i = 0; i < numOfCssPaths; i++) {\n\t\tcssPath = cssPaths[i];\n\t\tIO.copyFile(publish.conf.templatesDir + 'static/' + cssPath, dstDir);\n\t}\n\n\tvar imgPaths = [\n\t\t\t'bootstrap/img/glyphicons-halflings-white.png',\n\t\t\t'bootstrap/img/glyphicons-halflings.png',\n\t\t\t'img/classicons.png',\n\t\t\t'img/class.png',\n\t\t\t'img/interface.png',\n\t\t\t'img/namespace.png'\n\t\t];\n\tvar numOfImgPaths = imgPaths.length;\n\tvar imgPath;\n\t\n\tdstDir = publish.conf.outDir + 'img/';\n\tfor (var i = 0; i < numOfImgPaths; i++) {\n\t\timgPath = imgPaths[i];\n\t\tIO.copyFile(publish.conf.templatesDir + 'static/' + imgPath, dstDir);\n\t}\n}","function buildTemplate() {\n\t\tpageTitle = new C_PageTitle();\n\n //Add classes for page layouts - updatable in css\n $('#stage').append('<div id=\"content\" class=\"lessonCon\"></div>');\n\n $(\"#content\").append(myContent);\n\t\t\n\t\taudioHolder = new C_AudioHolder();\n\t\t \n if(transition == true){\n\t\t\t// fade stage in\n\t\t\t$('#stage').velocity({\n\t\t\t\topacity: 1\n\t\t\t}, {\n\t\t\t\tduration: transitionLength,\n\t\t\t\tcomplete: checkMode\n\t\t\t});\n }else{\n \tcheckMode();\n }\n }","function createSite(refInfo) {\n let url = parseUrl(refInfo.referer);\n let site = {\n 'domain': url.hostname,\n 'page': url.protocol + '://' + url.hostname + url.pathname\n };\n if (self === top && document.referrer) {\n site.ref = document.referrer;\n }\n let keywords = document.getElementsByTagName('meta')['keywords'];\n if (keywords && keywords.content) {\n site.keywords = keywords.content;\n }\n return site;\n}","async function template() {\n\tlet assets_location = isWatch ? '' : MY_CDN;\n\tlet html = await read(TEMPLATE, 'utf8');\n\n\t// Always remove _INJECT_ vars\n\thtml = html.replace(/_INJECT_(HEAD|BODY)_/g, '');\n\t// local development uses \"/\" else CDN\n\thtml = html.replace(/_CDN_BUCKET_/g, assets_location);\n\n\t// the \"public\" dir already exists\n\tlet file = join(__dirname, '..', 'public', 'index.html');\n\tawait write(file, html, 'utf8');\n\tconsole.log('~> wrote \"public/index.html\" with values');\n}","function setup() {\n Object.keys(options).forEach(function(key) {\n context[key] = options[key];\n });\n if(!context.username || !context.repo) {\n return console.error(\"No username/repo provided for gh-weblog.\");\n }\n window.nunjucksEnv = new nunjucks.Environment(new nunjucks.WebLoader(context.path + 'views'));\n nunjucksEnv.addFilter(\"cleanHTML\", function(data) {\n return data.replace(/</g, '<').replace(/>/g, '>');\n });\n nunjucksEnv.addFilter(\"readableDate\", function(data) {\n return (new Date(data)).toLocaleString();\n });\n nunjucksEnv.addFilter(\"shortDate\", function(data) {\n return (new Date(data)).toLocaleDateString();\n });\n nunjucksEnv.render(\"container.html\", {}, function(err, result) {\n if(err) { return console.error(\"Nunjucks render error\", err); }\n var container = document.querySelector(\"#gh-weblog-container\");\n container.innerHTML = result;\n cue(buildPage);\n });\n }","prepareForDocSite() {\n if (this.prepared_) {\n return;\n }\n\n let { stringContents: contents } = this;\n\n contents = this.uncommentMetadata_(contents);\n contents = this.uncommentJekyllSpecifics_(contents);\n contents = this.transformListItemStyles_(contents);\n contents = this.transformWithoutCodeBlocks_(contents, (c) => this.templatizeLocalLinks_(c));\n this.stringContents = contents;\n\n this.prepareMetadata_();\n this.prepared_ = true;\n }","function build () {\n var env = new nunjucks.Environment(new nunjucks.FileSystemLoader(), {\n noCache: true\n });\n /***\n * Nunjucks Filters\n *\n * Additional filters built into Nunjucks to help generate the styleguide.\n */\n require('./nunjucksFilters/dump')(env);\n require('./nunjucksFilters/split')(env);\n require('./nunjucksFilters/join')(env);\n require('./nunjucksFilters/markdown')(env);\n require('./nunjucksFilters/luminance')(env);\n require('./nunjucksFilters/addModifier')(env);\n require('./nunjucksFilters/contains')(env);\n require('./nunjucksFilters/wrap')(env);\n require('./nunjucksFilters/colors')(env);\n require('./nunjucksFilters/highlightSyntax')(env);\n\n return env;\n}","function pugHtml() {\n return src('src/pug/pages/*.pug')\n .pipe(\n pug({\n pretty: true,\n })\n )\n .pipe(dest('dist'));\n}","function buildTemplatesRuntime() {\n esbuild.build({\n ...commonOptions,\n outdir: htmlOutDir,\n entryPoints: ['node_modules/handlebars/dist/handlebars.runtime.js'],\n bundle: false,\n }).catch(() => process.exit(1))\n}","function buildSiteCSS() {\n\treturn gulp.src('site/src/less/site.less')\n\t\t.pipe(less())\n\t\t.pipe(gulp.dest('site/public/build/css'))\n\t\t.pipe(connect.reload());\n}","function generateCategoryPostsIndex(graphql, createPage){\n\n let prArray = [] //the promise array\n BC.forEach((blog) =>{\n let blogPath = `${__dirname}/src/pages/${blog.path}/`\n let filePath = `${blogPath}categories/index.md`\n\n let task = graphql(`\n {\n allMarkdownRemark(\n filter: {\n fileAbsolutePath: {regex: \"${blogPath}/\"}\n frontmatter:{\n published: {eq : true}\n type: {ne: \"page\"}\n categories: {ne: null}\n }\n }\n ){\n group(field:frontmatter___categories){\n totalCount\n fieldValue\n }\n }\n }\n `)\n .then(result => {\n // if no posts with categories\n if(!result.data.allMarkdownRemark){\n return \"\"\n }\n let categories = result.data.allMarkdownRemark.group\n let layout = \"category-posts-index.js\"\n let postsPerPage = 3\n\n categories.forEach(category => { //paginate each category\n let slug = `/${blog.path}/categories/${slugify(category.fieldValue)}/`\n let numPages = Math.ceil(category.totalCount/ postsPerPage)\n Array.from({ length: numPages }).forEach((_, i) => {\n createPage({\n path: i === 0 ? slug : `${slug}${i + 1}`,\n component: path.resolve(`./src/templates/${layout}`),\n context: {\n limit: postsPerPage,\n skip: i * postsPerPage,\n blogPath: blogPath+'/',\n category: category.fieldValue,\n totalPages: numPages\n },\n })\n })\n })\n\n })\n\n prArray.push(task)\n })\n\n return Promise.all(prArray)\n\n//Query the siteMetadata for the blogs, and for each blog -\n\n // query all the markdown files in the sub folders\n // with render!=false, publish=true, type=post\n // sort the post by date\n // output : list of categories in the current blog with their children.\n // similar to categories/index.js (?)\n\n // query for the blog/categories/cname/index.md - get it's content, frontmatter\n // Shoud this even EXIST?\n\n // For each series of the current sub-blog\n // Figure out how many pages there should be, generate the pages in a loop\n // using (frontmatter.layout || \"template/categories-posts-index.js\")\n // \n\n}","async function main () {\n const files = await fse.readdir(path.resolve(__dirname, 'source/_posts'))\n\n let posts = files.filter((file) =>\n fse.lstatSync(path.resolve(__dirname, 'source/_posts', file)).isFile() &&\n path.extname(file) === '.md'\n )\n\n posts = await Promise.all(\n posts.map((post) =>\n MarkedPost.fromFile(path.resolve(__dirname, 'source/_posts', post))\n )\n )\n\n posts.sort((p1, p2) => p1.date.getTime() < p2.date.getTime() ? 1 : -1)\n\n const dir = path.resolve(__dirname, '../dist/api')\n await fse.ensureDir(dir)\n await Promise.all(\n posts.map(async (post) => {\n return post.save(path.resolve(dir, `articles/${post.filename}.json`))\n })\n )\n\n let tags = new Tags(posts)\n await fse.writeFile(\n path.resolve(dir, 'tags.json'),\n tags.toJSON()\n )\n\n await Promise.all(\n tags.map((tag) => {\n return tag.save(\n path.resolve(dir, `tags/${tag.slug}.json`)\n )\n })\n )\n\n let pages = chunk(posts, config.perPage)\n\n await fse.writeFile(\n path.resolve(dir, 'posts.json'),\n JSON.stringify({\n pages: pages.length,\n perPage: config.perPage,\n posts: pages[0].map((post) => post.lean(false))\n }\n )\n )\n\n await fse.ensureDir(path.resolve(dir, 'pages'))\n await Promise.all(\n pages.map((page, index) => {\n fse.writeFile(\n path.resolve(dir, 'pages', `${index + 1}.json`),\n JSON.stringify({\n page: index,\n posts: page.map((post) => post.lean(false))\n })\n )\n })\n )\n\n // Other files (not _posts but also markdown files)\n await walk(\n path.resolve(__dirname, 'source'),\n dir\n )\n\n // atom\n let rss = new Rss(posts, {\n title: 'lazzzis',\n id: URI,\n link: URI,\n author: {\n name: 'lazzzis',\n email: 'shenlijin@outlook.com',\n link: URI\n }\n })\n await rss.save(path.resolve(dir, '../atom.xml'))\n}","async function createBlogPostPages (graphql, actions, reporter) {\n const { createPage } = actions\n const result = await graphql(`\n {\n allSanityPost(filter: { slug: { current: { ne: null } } }) {\n edges {\n node {\n id\n publishedAt\n slug {\n current\n }\n }\n }\n }\n }\n `)\n\n if (result.errors) throw result.errors\n\n const postEdges = (result.data.allSanityPost || {}).edges || []\n\n postEdges.forEach((edge, index) => {\n const { id, slug = {}, publishedAt } = edge.node\n const dateSegment = format(legacyParse(publishedAt), convertTokens('yyyy/MM'))\n const path = `/blog/${dateSegment}/${slug.current}/`\n\n reporter.info(`Creating blog post page: ${path}`)\n\n createPage({\n path,\n component: require.resolve('./src/templates/blog-post.js'),\n context: { id }\n })\n })\n}","async function sitemap() {\n if (!config.OPTIONS.sitemap) return;\n\n let publicUrl;\n if (typeof config.OPTIONS.sitemap === \"string\")\n publicUrl = config.OPTIONS.sitemap;\n else if (env.raw.PUBLIC_URL) {\n publicUrl = env.raw.PUBLIC_URL;\n\n // removes forward slash at the end\n if (publicUrl.charAt(publicUrl.length - 1) === \"/\")\n publicUrl = publicUrl.substring(0, publicUrl.length - 1);\n }\n\n if (!publicUrl) {\n logger.error(\n `Failed to generate sitemap.xml, missing ${chalk.bold(\n \"public url\"\n )}.\\nhttps://github.com/wethegit/sweet-potato/tree/main/cooker#sitemap`\n );\n\n return;\n }\n\n // Get all html files\n const htmlFiles = await getFiles(\n path.join(config.BUILD_DIRECTORY, \"**\", \"*.html\")\n );\n\n if (htmlFiles.length <= 0) {\n logger.announce(\n \"No html files found to generate sitemap, maybe this command was ran too early or you forgot to generate a build.\\nnpx sweet-potato-cooker build\"\n );\n return;\n }\n\n logger.start(\"Generating sitemap\");\n\n // Creates a sitemap object given the input configuration with URLs\n const sitemap = new SitemapStream({ hostname: publicUrl });\n const lastmod = new Date().toISOString();\n\n // go throught all of them\n for (const file of htmlFiles) {\n const fileInfo = path.parse(file);\n let dir = fileInfo.dir.replace(config.BUILD_DIRECTORY, \"\");\n\n if (dir === \"\") dir += \"/\";\n\n sitemap.write({ url: `${publicUrl}${dir}`, lastmod });\n }\n\n sitemap.end();\n\n let sitemapData;\n let finalSitemap;\n\n try {\n sitemapData = await streamToPromise(sitemap);\n finalSitemap = sitemapData.toString();\n } catch (err) {\n logger.error(\"Failed generating sitemap\", err);\n }\n\n const dest = path.join(config.BUILD_DIRECTORY, \"sitemap.xml\");\n const prettyPath = path.relative(config.CWD, dest);\n\n return fse\n .outputFile(dest, finalSitemap)\n .then(() => {\n // done 🎉\n logger.success([\"Compiled\", prettyPath]);\n logger.finish(\"Generating sitemap\");\n\n return { destination: dest, sitemap: finalSitemap };\n })\n .catch((err) => {\n logger.error([\"Failed saving sitemap file\", prettyPath], err);\n });\n}","function buildPages() {\n const queue = [];\n for (const [path, page] of Object.entries(Pages)) {\n queue.push(publish(page.el, {\n pagePath: path,\n pageHeading: page.el.defaultProps.pageHeading\n }));\n }\n return Promise.all(queue);\n}","function IndexPage(props) {\n // const siteTitle = \"Gatsby Starter Personal Website\"\n return (\n <>\n <CustomLayout>\n <div>\n <div className=\"banner\">\n <h1>Maanas Organisation </h1>\n <h2>-A Psychospiritual Initiative- </h2>\n </div>\n\n <div className=\"content-wrapper\">\n <h3 className=\"title\">The Rendition of Human Mind.</h3>\n\n <p>\n Hello fellow traveler. \n Human mind is the most misunderstood and at the same time equally inquisitive phenomena, yet it is of great potential If it’s nature is correctly identified and applied to our daily life. \n Our purpose is to creatively pursue this astonishing phenomenon and to enrich our lives and give it its deserved meaning. \n We intend to combine the concepts of Science & Spirituality to get a better perspective of the understanding of human mind and use it in elevating our potential and consciousness.\n </p>\n </div>\n </div>\n </CustomLayout>\n </>\n )\n}","function index(req, res, next) {\n res.render('home/home.index.pug', { \n title: 'Template Project'\n });\n}","function html() {\n return src(['./src/views/*'])\n .pipe(nunjucks.compile({\n env: new njk.Environment(new njk.FileSystemLoader('./src/views'))\n }))\n .pipe(dest('dist/'))\n}","function _buildPage( opt ){\r\nconsole.log(\"_buildPage()\");\r\n\r\n\tvar p = {\r\n\t\t//\"nid\": null,\r\n\t\t//\"templateID\" : \"tpl-page\"\r\n\t\t//\"title\" : \"\",\r\n\t\t//content : \"\"\r\n\t\t\"callback\": null\r\n\t};\r\n\t//extend options object\r\n\tfor(var key in opt ){\r\n\t\tp[key] = opt[key];\r\n\t}\r\n//console.log(p);\r\n\r\n//--------------------- BLOCK #sitename-block\r\n\tdraw.buildBlock({\r\n\t\t\"locationID\" : \"sitename-block\",\r\n\t\t\"templateID\" : \"tpl-block--sitename\"//,\r\n\t\t//\"content\" : \"<h1><a class='title' href='./'>my lib</a></h1>\" \r\n\t});\r\n//---------------------\r\n\r\n//--------------------- BLOCK\r\n\t\t\t//view alphabetical\r\n\r\n\t\t\tvar html = lib.taxonomy.view_termin({\r\n\t\t\t\t\"termins\": lib.vars[\"taxonomy\"][\"alphabetical_voc\"][\"termins\"],\r\n\t\t\t\t\"vid\": \"4\",\r\n\t\t\t\t\"tid\": \"116\",\r\n\t\t\t\t\"recourse\": true,\r\n\t\t\t\t\"show_only_children\": true,\r\n\t\t\t\t\"item_tpl\": lib.vars[\"templates\"][\"tpl-block--taxonomy_alpha_list\"],\r\n\t\t\t\t\"list_tpl\": lib.vars[\"templates\"][\"tpl-block--taxonomy_alpha\"]//,\r\n\t\t\t\t//\"url_tpl\": _vars[\"templates\"][\"taxonomy_url_tpl\"]\r\n\t\t\t});\r\nconsole.log(html);\r\n\t\t\t\r\n//---------------------\r\n\r\n}","function build(done) {\n runSequence('clean', ['html', 'htmlTemplate', 'static', 'styles', 'transpile'], done);\n}","_buildPageData() {\n const parsedFilePath = path.parse(this.filePath);\n\n const { data, content } = matter.read(`${this.filePath}`);\n\n const pageData = {\n ...data,\n content,\n };\n\n pageData.path = `/${parsedFilePath.name}.html`;\n\n return pageData;\n }","async processContent(o) {\n let theme = await this.fs.promises.readFile(this.config.settings.THEME.POST, \"utf8\")\n let template = Handlebars.compile(theme)\n let rendered = template({\n name: this.config.settings.NAME,\n content: o.html,\n updated: o.data.updated,\n filename: `${this.config.settings.SRC}/${o.filename}`,\n title: o.data.title\n }).trim()\n await this.fs.promises.mkdir(`${this.config.settings.DEST}/post`).catch((e) => { })\n await this.fs.promises.mkdir(`${this.config.settings.DEST}/post/${o.filename}`).catch((e) => { })\n await this.fs.promises.writeFile(`${this.config.settings.DEST}/post/${o.filename}/index.html`, rendered)\n }","function buildApp() {\n const date = new Date();\n let hh = date.getHours();\n let mm = date.getMinutes();\n let month = date.getMonth() + 1;\n hh = hh < 10 ? '0' + hh : hh;\n mm = mm < 10 ? '0' + mm : mm;\n month = month < 10 ? '0' + month : month;\n const day = `${date.getDate()}.${month}.${date.getFullYear()}`;\n const hour = `${hh}:${mm}`;\n $('.alert').fadeOut('slow');\n clearInterval(addInterval);\n $('body').empty().append(navbar).append($pageContent);\n $pageContent.empty().append(addnew(day, hour)).css(('margin-top'), $('.navbar').outerHeight());\n }","async function createArticlePostPages(graphql, actions) {\n // Get Gatsby‘s method for creating new pages\n const { createPage } = actions\n const PostTemplate = require.resolve('./src/templates/Post/Article/index.tsx')\n\n // Query Gatsby‘s GraphAPI for all the categories that come from Sanity\n // You can query this API on http://localhost:8000/___graphql\n const result = await graphql(`\n {\n allSanityPost(sort: { order: DESC, fields: publishedAt }) {\n nodes {\n title\n _rawExcerpt\n _rawBody\n _id\n publishedAt(formatString: \"MMM. DD, YYYY\")\n slug {\n current\n }\n tags {\n tag\n }\n figure {\n alt\n asset {\n fluid(maxWidth: 800) {\n srcWebp\n srcSetWebp\n srcSet\n src\n sizes\n base64\n aspectRatio\n }\n }\n caption\n }\n categories {\n title\n }\n authors {\n name\n role\n avatar {\n asset {\n fluid(maxWidth: 300) {\n srcWebp\n srcSetWebp\n srcSet\n src\n sizes\n base64\n aspectRatio\n }\n }\n }\n }\n sources {\n title\n url\n }\n }\n }\n }\n `)\n // If there are any errors in the query, cancel the build and tell us\n if (result.errors) throw result.errors\n // Let‘s gracefully handle if allSanityCatgogy is null\n const postNodes = (result.data.allSanityPost || {}).nodes || []\n\n postNodes\n // Loop through the category nodes, but don't return anything\n .forEach(node => {\n // Desctructure the id and slug fields for each category\n const { id, slug = {} } = node\n // If there isn't a slug, we want to do nothing\n if (!slug) return\n // Make the URL with the current slug\n const path = `/articles/${slug.current}`\n // Create the page using the URL path and the template file, and pass down the id\n // that we can use to query for the right category in the template file\n createPage({\n path,\n component: PostTemplate,\n context: {\n post: node\n }\n })\n })\n}"],"string":"[\n \"build(source){\\n const paths = Helpers.files(source);\\n const view = Helpers.includes(paths.includes);\\n\\n //build _site directory, unless it already exists\\n const sitePath = paths.site;\\n fs.mkdir(sitePath, (err) => {\\n if (err) {\\n if (err.code === 'EEXIST') console.log('the _site folder already exists, building some new children...');\\n else console.log(err);\\n } else console.log('_site directory initialized')\\n });\\n\\n //get array of all posts in _posts directory using glob module\\n //then create a new set of directories according to the post title\\n const index = module.exports.index(source);\\n\\n //run down the directory structure rabbit hole for each post\\n index.forEach(post => {\\n postDir(sitePath, post, 'year');\\n postDir(sitePath, post, 'month');\\n postDir(sitePath, post, 'day');\\n postDir(sitePath, post, 'title');\\n\\n //move markdown and template (view) data to index.html file at root of post directories\\n const path = post.year + '-' + post.month + '-' + post.day + '-' + post.title + '.' + post.ext;\\n const postPath = paths.posts + '/' + path;\\n\\n Helpers.reader(postPath, (data) => {\\n const html = marked(data);\\n const newPath = sitePath + '/' + post.year + '/' + post.month + '/' + post.day + '/' + post.title;\\n Helpers.writer(paths.layouts, view, newPath, html, 'posts');\\n });\\n });\\n\\n //build landing page (index.html) using same writer function as for posts, without needing to read markdown\\n Helpers.writer(paths.layouts, view, sitePath, '', 'landing');\\n }\",\n \"function build_page(){\\n\\t\\t\\tfor ( var key in sitemap.pages ) {\\n\\t\\t\\t\\tvar site_obj = sitemap;\\n\\t\\t\\t\\tvar page_obj = site_obj.pages[ key ];\\n\\n\\t\\t\\t\\tif ( page_obj.file !== false ) {\\n\\t\\t\\t\\t\\tvar sourceFile = \\\"test/preprocess/\\\" + page_obj.template + \\\".tmpl\\\";\\n\\t\\t\\t\\t\\tvar root = page_obj.file_root.replace( new RegExp( \\\"[\\\\/]+$\\\", \\\"g\\\" ), \\\"\\\" );\\n\\t\\t\\t\\t\\tvar page = page_obj.file || page_obj.nav_key + \\\".html\\\";\\n\\t\\t\\t\\t\\tvar targetFile = root + \\\"/\\\" + page;\\n\\t\\t\\t\\t\\tvar content = fs.readFileSync( sourceFile, \\\"utf8\\\" );\\n\\n\\t\\t\\t\\t\\tsite_obj.current_page = page;\\n\\t\\t\\t\\t\\tsite_obj.current_build = page_obj.nav_key;\\n\\n\\t\\t\\t\\t\\tvar tmpl = new nunjucks.Template( content, env );\\n\\t\\t\\t\\t\\tvar res = tmpl.render( site_obj );\\n\\n\\t\\t\\t\\t\\tgrunt.log.writeln( \\\"building \\\" + targetFile );\\n\\t\\t\\t\\t\\tfs.writeFile( targetFile, res );\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function build() {\\n // Tidy directory first\\n // to ensure all files\\n // are in the right place\\n tidy();\\n\\n mmark.parseDirectory(process.cwd() + \\\"/posts\\\", function(err, posts){\\n if (err) {\\n console.log(err.red);\\n }\\n\\n var feed_html = \\\"\\\";\\n for (post in posts) {\\n var post = posts[post];\\n\\n // Fetch post data\\n var title = post['meta']['title'];\\n var date = post['meta']['date'];\\n var markd = post['content'];\\n\\n // Produce HTML\\n var html = [\\n '<div class=\\\"post\\\">',\\n '<h2 class=\\\"post-title\\\">',\\n title,\\n '</h2>',\\n '<h4 class=\\\"post-date\\\">',\\n date,\\n '</h4>',\\n markd,\\n '</div>'\\n ].join();\\n\\n feed_html += html;\\n }\\n var out = tinyt.renderFile(template_source, {feed: feed_html});\\n fs.writeFile(html_source, out, function(data, err){\\n if (err) {\\n console.log(err);\\n }\\n console.log(\\\"All posts succesfully rendered ✔\\\".green);\\n });\\n });\\n\\n}\",\n \"function buildSite( cb, options, environment = \\\"development\\\" ) {\\n const args = options ? hugoArgsDefault.concat( options ) : hugoArgsDefault;\\n\\n process.env.NODE_ENV = environment;\\n\\n return spawn( hugoBin, args, { stdio: \\\"inherit\\\" } ).on( \\\"close\\\", ( code ) => {\\n if ( code === 0 ) {\\n browserSync.reload();\\n cb();\\n } else {\\n browserSync.notify( \\\"Hugo build failed :(\\\" );\\n cb( \\\"Hugo build failed\\\" );\\n }\\n } );\\n}\",\n \"function buildSite(cb, options, environment = \\\"development\\\") {\\n const args = options ? hugoArgsDefault.concat(options) : hugoArgsDefault;\\n\\n process.env.NODE_ENV = environment;\\n\\n return spawn(hugoBin, args, {stdio: \\\"inherit\\\"}).on(\\\"close\\\", (code) => {\\n if (code === 0) {\\n browserSync.reload();\\n cb();\\n } else {\\n browserSync.notify(\\\"Hugo build failed :(\\\");\\n cb(\\\"Hugo build failed\\\");\\n }\\n });\\n}\",\n \"function buildSite(unusedFileEntities, options) {\\n if (options === void 0) { options = defaultOptions; }\\n var outputPath = options.outputPath;\\n console.log(\\\"Writing documentation to \\\" + outputPath);\\n // delete everything in the outputPath\\n if (fs.existsSync(outputPath)) {\\n try {\\n rimraf.sync(outputPath);\\n }\\n catch (e) {\\n console.error('Error Deleting output path', e);\\n }\\n }\\n // Generate the html and dump into the output path\\n var html = site_builder_1.generateHtmlPage(unusedFileEntities);\\n try {\\n if (!fs.existsSync(outputPath)) {\\n fs.mkdirSync(outputPath);\\n }\\n var docsPath = path.join(outputPath, 'index.html');\\n fs.writeFileSync(docsPath, html);\\n }\\n catch (e) {\\n console.error('Error creating output path', e);\\n }\\n // Copy the asset folders to the output path\\n try {\\n for (var _i = 0, _a = options.copyFolders; _i < _a.length; _i++) {\\n var folder = _a[_i];\\n var assetFolderPath = path.join(path.dirname(require.main.filename), folder);\\n var destFolderPath = path.join(outputPath, folder);\\n if (fs.existsSync(assetFolderPath)) {\\n fs.copySync(assetFolderPath, destFolderPath);\\n }\\n }\\n }\\n catch (e) {\\n console.error('Error copying asset directories', e);\\n }\\n}\",\n \"function jekyll() {\\r\\n return cp.spawn(jekyllCommand,\\r\\n ['exec', 'jekyll', 'build'],\\r\\n {stdio : 'inherit'}\\r\\n );\\r\\n}\",\n \"function buildJekyll(done) {\\n browser.notify(messages.jekyllBuild);\\n return cp.spawn( jekyll , ['build'], {stdio: 'inherit'})\\n .on('close', done);\\n}\",\n \"function pages(cb) {\\n // Gets .html files. see file layout at bottom\\n var env = new $.nunjucks.Environment(\\n new $.nunjucks.FileSystemLoader(templates)\\n );\\n // all fo the follwing is optional and this will all work just find if you don't include any of it. included it here just in case you need to configure it.\\n $.marked.setOptions({\\n renderer: new $.marked.Renderer(),\\n gfm: true,\\n tables: true,\\n breaks: false,\\n pedantic: false,\\n sanitize: true,\\n smartLists: true,\\n smartypants: false\\n });\\n\\n // This takes the freshley created nunjucks envroment object (env) and passes it to nunjucks-markdown to have the custom tag regestered to the env object.\\n // The second is the marked library. anything that can be called to render markdown can be passed here.\\n $.markdown.register(env, $.marked);\\n\\n // let data = JSON.parse({ files: getData('markup') });\\n let data = { files: getData('markup') };\\n let cData = { cFiles: getData('markup-c') };\\n\\n // get styles data\\n src([templates + '/*.html'])\\n // Renders template with nunjucks and marked\\n .pipe($.data(data))\\n .pipe($.gulpnunjucks.compile('', { env: env }))\\n // Uncomment the following if your source pages are something other than *.html.\\n // .pipe(rename(function (path) { path.extname=\\\".html\\\" }))\\n // output files in dist folder\\n .pipe(dest(dist));\\n\\n // get components data\\n src([templates + '/*.html'])\\n // Renders template with nunjucks and marked\\n .pipe($.data(cData))\\n .pipe($.gulpnunjucks.compile('', { env: env }))\\n .pipe(dest(dist));\\n\\n cb();\\n}\",\n \"function compileTemplates(){\\n\\tvar siteMap = config();//JSON.parse( fs.readFileSync( config() ) );\\n\\n\\t//generate paths to the example sources\\n\\tvar sources = [];\\n\\tsiteMap.examples.forEach(function( example ){\\n\\t\\tsources.push( source( example.src ) );\\n\\t});\\n\\t//pass to docco, then jade, then clean up\\n\\tdocco.document(sources, { language: \\\"javascript\\\", template: view(\\\"docco-template.jst\\\") }, function( err ){\\n\\t\\tif( err ) throw err;\\n\\t\\tasync.forEach( siteMap.examples, generateExample, function exit( err ) {\\n\\t\\t\\tif( err ) throw err;\\n\\t\\t\\tsetTimeout(function(){\\n\\t\\t\\t\\t//clean();\\n\\t\\t\\t}, 500);\\n\\t\\t});\\n\\t});\\n\\n\\t//handle pages\\n\\tsiteMap.pages.forEach(function( page ){\\n\\t\\tgeneratePage( page );\\n\\t});\\n\\n\\n\\t//remove the docs folder\\n\\tfunction clean(){\\n\\t\\twrench.rmdirRecursive( __dirname + '/docs/', function(){\\n\\t\\t\\tmsg('docs deleted');\\n\\t\\t});\\n\\t}\\n}\",\n \"function jekyllBuild(done) {\\n exec(\\\"bundle exec jekyll serve\\\", function (err, stdout, stderr) {\\n console.log(stdout);\\n console.error(stderr);\\n });\\n done();\\n}\",\n \"static get tag(){return\\\"haxcms-site-builder\\\"}\",\n \"async build () {\\n let src = await this.fs.promises.readdir(this.config.settings.SRC)\\n let items = await Promise.all(src.filter((key) => { return key !== \\\"assets\\\" }).map((key) => {\\n return new Promise(async (resolve, reject) => {\\n let md = await this.fs.promises.readFile(`${this.config.settings.SRC}/${key}`, \\\"utf8\\\")\\n let { content, data } = matter(md)\\n resolve({ key, data, content })\\n })\\n }))\\n let publicItems = []\\n let privateItems = []\\n for(let item of items) {\\n if (item.data.draft) privateItems.push(item)\\n else publicItems.push(item)\\n }\\n for(let item of privateItems) {\\n await this.fs.promises.unlink(`${this.config.settings.DEST}/post/${item.key}/index.html`)\\n }\\n publicItems.sort((a, b) => {\\n return parseInt(b.data.updated) - parseInt(a.data.updated);\\n })\\n for(let item of publicItems) {\\n await this.buildPost(item.key)\\n }\\n await this.plugins(\\\"onpublish\\\", publicItems)\\n }\",\n \"async compile(filepath) {\\n const siteData = await helper.siteData();\\n const currentUrl = path.relative(\\n './src',\\n _.replace(filepath, '.md', '.html')\\n );\\n const destination = `./docs/${currentUrl}`;\\n\\n // Read file, and extract front-matter from raw text\\n const rawContent = await helper.readFile(filepath);\\n const parsed = frontMatter(rawContent);\\n const fileData = parsed.attributes;\\n const pageData = _.merge({}, siteData, fileData);\\n\\n // Update {{config}} placeholders\\n let markdownBody = parsed.body;\\n _.each(pageData.config, (value, key) => {\\n markdownBody = _.replace(\\n markdownBody,\\n new RegExp(`{{${key}}}`, 'g'),\\n value\\n );\\n });\\n\\n // Convert markdown to html\\n const htmlBody = markdown.render(markdownBody);\\n\\n // Add the hierarchy of headings to the matching link in the sidebar\\n const headings = this.getHeadings(htmlBody);\\n const sidebar = _.clone(pageData.sidebar);\\n _.each(sidebar, category => {\\n _.each(category.pages, page => {\\n const linkBasename = path.basename(page.url, '.html');\\n if (linkBasename === currentUrl) {\\n page.headings = headings; // eslint-disable-line no-param-reassign\\n }\\n });\\n });\\n\\n // Init layout\\n const layoutName = fileData.layout;\\n const layoutFile = `./src/_layouts/${layoutName}.pug`;\\n const layoutContent = await helper.readFile(layoutFile);\\n const pugCompile = pug.compile(layoutContent, { filename: layoutFile });\\n\\n // Compile layout\\n const compileData = {\\n ...pageData,\\n sidebar,\\n current: {\\n url: currentUrl,\\n content: htmlBody,\\n ...fileData,\\n },\\n };\\n const htmlContent = pugCompile(compileData);\\n\\n // Save to disk\\n await helper.writeFile(destination, htmlContent);\\n }\",\n \"function jekyll_production() {\\n return child_process.spawn(\\\"bundle\\\", [\\\"exec\\\", \\\"jekyll\\\", \\\"build\\\", \\\"--config\\\", \\\"_config-production.yml\\\"], { stdio: \\\"inherit\\\" });\\n}\",\n \"function buildPage(file, { srcPath, outputPath, site }) {\\n return new Promise((resolve, reject) => {\\n const fileData = path.parse(file);\\n let destPath = path.join(outputPath, fileData.dir);\\n\\n // create extra dir if filename is not index\\n if (fileData.name !== 'index') {\\n destPath = path.join(destPath, fileData.name);\\n }\\n\\n // create destination directory\\n fse.mkdirsSync(destPath);\\n\\n // read page file\\n const data = fse.readFileSync(`${srcPath}/pages/${file}`, 'utf-8');\\n\\n // render page\\n const pageData = frontMatter(data);\\n\\n const templateConfig = {\\n site,\\n page: Object.assign({}, pageData.attributes, { url: `/${fileData.dir}` })\\n };\\n\\n let pageContent;\\n const pageSlug = file.split(path.sep).join('-');\\n\\n // generate page content according to file type\\n switch (fileData.ext) {\\n case '.md':\\n pageContent = marked(pageData.body);\\n break;\\n case '.ejs':\\n pageContent = ejs.render(pageData.body, templateConfig, {\\n filename: `${srcPath}/page-${pageSlug}`\\n });\\n break;\\n default:\\n pageContent = pageData.body;\\n }\\n\\n // render layout with page contents\\n const layoutName = pageData.attributes.layout || 'default';\\n const layout = loadLayout(layoutName, {\\n srcPath\\n });\\n\\n const completePage = ejs.render(\\n layout.data,\\n Object.assign({}, templateConfig, {\\n body: pageContent,\\n filename: `${srcPath}/layout-${layoutName}`\\n })\\n );\\n\\n fse.writeFile(`${destPath}/index.html`, completePage, error => {\\n if (error) {\\n log.error(`Error building page '${file}'`);\\n reject();\\n } else {\\n resolve();\\n }\\n });\\n\\n fse.writeFileSync(`${destPath}/index.html`, completePage);\\n });\\n}\",\n \"function build() {\\n\\tconst markdown = fs\\n\\t\\t// Load markdown.\\n\\t\\t.readFileSync(readmePath, 'utf8')\\n\\t\\t// Uncomment docdash HTML hints.\\n\\t\\t.replace(/(<)!--\\\\s*|\\\\s*--(>)/g, '$1$2')\\n\\t\\t// Convert source and npm package links to anchors.\\n\\t\\t.replace(\\n\\t\\t\\t/\\\\[source\\\\]\\\\(([^)]+)\\\\) \\\\[npm package\\\\]\\\\(([^)]+)\\\\)/g,\\n\\t\\t\\t(match, href1, href2) =>\\n\\t\\t\\t\\t`<p class=\\\"pee-balls\\\"><a class=\\\"a-balls\\\" href=\\\"${href1}\\\">source</a><a href=\\\"${href2}\\\">npm package</a></p>`\\n\\t\\t)\\n\\n\\tconst $ = cheerio.load(\\n\\t\\tmarky(markdown, {\\n\\t\\t\\tenableHeadingLinkIcons: false,\\n\\t\\t\\tsanitize: false\\n\\t\\t})\\n\\t)\\n\\n\\tconst $header = $('h1')\\n\\t\\t.first()\\n\\t\\t.remove()\\n\\n\\tconst version = $header\\n\\t\\t.find('span')\\n\\t\\t.first()\\n\\t\\t.text()\\n\\t\\t.trim()\\n\\t\\t.slice(1)\\n\\n\\t// Auto-link flodash method references.\\n\\tautoLink($)\\n\\t// Rename \\\"_\\\" id references to \\\"flodash\\\".\\n\\trenameflodashId($)\\n\\t// Remove docdash horizontal rules.\\n\\tremoveHorizontalRules($)\\n\\t// Remove marky-markdown attribute additions.\\n\\tremoveMarkyAttributes($)\\n\\t// Repair marky-markdown wrapping around headers.\\n\\trepairMarkyHeaders($)\\n\\t// Cleanup highlights.\\n\\ttidyHighlights($)\\n\\n\\tconst _html = () => {\\n\\t\\treturn /* html */ `\\n\\t\\t\\t<!DOCTYPE html>\\n\\t\\t\\t<html class=\\\"docs gr__flodash_com\\\" style=\\\"overflow: auto;\\\">\\n\\t\\t\\t\\t<head>\\n\\t\\t\\t\\t\\t<meta charset=\\\"utf-8\\\">\\n\\t\\t\\t\\t\\t<meta content=\\\"IE=edge\\\" http-equiv=\\\"X-UA-Compatible\\\">\\n\\t\\t\\t\\t\\t<title>flodash Docs</title>\\n\\t\\t\\t\\t\\t<meta content=\\\"width=device-width, initial-scale=1\\\" name=\\\"viewport\\\">\\n\\t\\t\\t\\t\\t<link href=\\\"assets/css/doc.css\\\" rel=\\\"stylesheet\\\" type=\\\"text/css\\\">\\n\\t\\t\\t\\t\\t<script src=\\\"../vendor/lodash/lodash.min.js\\\"></script>\\n\\t\\t\\t\\t\\t<script src=\\\"../vendor/g/fuse@2.6.1,react@15.4.0(react.min.js+react-dom.min.js\\\"></script>\\n\\t\\t\\t\\t\\t<script async src=\\\"../assets/js/docs.js\\\"></script>\\n\\t\\t\\t\\t\\t<link href=\\\"https://cdn.jsdelivr.net/fontawesome/4.7.0/css/font-awesome.min.css\\\" rel=\\\"stylesheet\\\">\\n\\t\\t\\t\\t\\t<script async src=\\\"../assets/js/boot.js\\\"></script>\\n\\t\\t\\t\\t\\t<script async src=\\\"https://embed.runkit.com\\\" async></script>\\n\\t\\t\\t\\t</head>\\n\\t\\t\\t\\t<body class=\\\"layout-docs\\\">\\n\\t\\t\\t\\t\\t<header>\\n\\t\\t\\t\\t\\t\\t<div class=\\\"container\\\">\\n\\t\\t\\t\\t\\t\\t\\t\\t<div class=\\\"header-section logo-section\\\">\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t<div class=\\\"logo\\\">\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t<a href=\\\"../index.html\\\" title=\\\"flodash\\\">flodash</a>\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t</div>\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t<div class=\\\"header-group\\\">\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t<h1>flodash</h1>\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t</div>\\n\\t\\t\\t\\t\\t\\t\\t\\t</div>\\n\\t\\t\\t\\t\\t\\t\\t\\t<div class=\\\"header-section mobile-menu\\\">\\n \\t\\t\\t\\t\\t\\t\\t<a href=\\\"#\\\"><i class=\\\"fa fa-bars\\\" aria-hidden=\\\"true\\\"></i>Menu</a>\\n \\t\\t\\t\\t\\t\\t</div>\\n\\t\\t\\t\\t\\t\\t</div>\\n\\t\\t\\t\\t\\t</header>\\n\\t\\t\\t\\t\\t<div class=\\\"doc-main\\\">\\n\\t\\t\\t\\t\\t\\t${$.html().trim()}\\n\\t\\t\\t\\t\\t</div>\\n\\t\\t\\t\\t</body>\\n\\t\\t\\t</html>\\n\\t\\t`\\n\\t}\\n\\n\\tconst __html = /* html */ `${_html()}`\\n\\n\\tfs.writeFile(path.join(docPath, 'balls' + '.html'), __html, util.pitch)\\n\\t// fs.writeFile(path.join(docPath, 'doc' + '.html'), __html, util.pitch)\\n\\n}\",\n \"function deploy() {\\n return gulp.src('./public/**/*')\\n .pipe($.ghPages());\\n}\",\n \"function jekyllProd() {\\n return gulp.src('.').pipe(run('bundle exec jekyll build'));\\n}\",\n \"async function generate() {\\n const prettierConfig = await prettier.resolveConfig('./.prettierrc.js')\\n const pages = await globby([\\n 'pages/*.js',\\n 'pages/*.tsx',\\n 'pages/*/*.tsx',\\n 'data/**/*.mdx',\\n '_blog/*.mdx',\\n '!pages/index.tsx',\\n '!data/*.mdx',\\n '!pages/_*.js',\\n '!pages/*/index.tsx',\\n '!pages/api',\\n '!pages/404.js',\\n ])\\n\\n const sitemap = `\\n <?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n <urlset xmlns=\\\"http://www.sitemaps.org/schemas/sitemap/0.9\\\">\\n ${pages\\n .filter((page) => !page.includes('_document.tsx'))\\n .map((page) => {\\n const path = page\\n .replace('pages', '')\\n // add a `/` for blog posts\\n .replace('_blog', '/blog')\\n .replace('.tsx', '')\\n .replace('.mdx', '')\\n // replace the paths for nested 'index' based routes\\n .replace('/auth/Auth', '/auth')\\n .replace('/database/Database', '/database')\\n .replace('/storage/Storage', '/storage')\\n\\n let route = path === '/index' ? '' : path\\n\\n //\\n // blog specific urls\\n //\\n if (route.includes('/blog/')) {\\n // clean blog post route from string\\n const _route = route.replace('/blog/', '')\\n // splut the url\\n let split = _route.split('')\\n // target and replace the `-` between dates\\n split[4] = '/'\\n split[7] = '/'\\n split[10] = '/'\\n // reconstruct the url\\n route = '/blog/' + split.join('')\\n }\\n\\n return `\\n <url>\\n <loc>${`https://supabase.com${route}`}</loc>\\n <changefreq>weekly</changefreq>\\n <changefreq>0.5</changefreq>\\n </url>\\n `\\n })\\n .join('')}\\n </urlset>\\n `\\n\\n const formatted = prettier.format(sitemap, {\\n ...prettierConfig,\\n parser: 'html',\\n })\\n\\n // eslint-disable-next-line no-sync\\n writeFileSync('public/sitemap_www.xml', formatted)\\n}\",\n \"function generatestatic() {\\n console.log(\\\"Generating unique pages...\\\");\\n const scams = JSON.parse(fs.readFileSync('./_site/data/scams.json'));\\n const addresses = JSON.parse(fs.readFileSync('./_site/data/addresses.json'));\\n const ips = JSON.parse(fs.readFileSync('./_site/data/ips.json'));\\n const layout_scams = fs.readFileSync('./_layouts/scam.html', 'utf8');\\n const layout_addresses = fs.readFileSync('./_layouts/address.html', 'utf8');\\n const layout_ips = fs.readFileSync('./_layouts/ip.html', 'utf8');\\n if (!fs.existsSync(\\\"./_site\\\")) {\\n fs.mkdirSync(\\\"./_site/\\\");\\n }\\n if (!fs.existsSync(\\\"./_site/scam/\\\")) {\\n fs.mkdirSync(\\\"./_site/scam/\\\");\\n }\\n for (var key = 0, len = scams.length; key < len; key++) {\\n var layout = template.replace(\\\"{{ content }}\\\", layout_scams);\\n var sc_nameservers = \\\"\\\";\\n var sc_addresses = \\\"\\\";\\n var history = \\\"\\\";\\n var actions = \\\"<button id='share' class='ui icon secondary button'><i class='share alternate icon'></i> Share</button>\\\";\\n if (\\\"nameservers\\\" in scams[key]) {\\n scams[key]['nameservers'].forEach(function(nameindex) {\\n sc_nameservers += \\\"<div class='item'>\\\" + nameindex + '</div>';\\n });\\n if (sc_nameservers) {\\n layout = layout.replace(/{{ scam.nameservers }}/ig, '<b>Nameservers</b>: <div class=\\\"ui bulleted list\\\">' + sc_nameservers + '</div>');\\n }\\n } else {\\n layout = layout.replace(/{{ scam.nameservers }}/ig, \\\"\\\");\\n }\\n if (\\\"addresses\\\" in scams[key]) {\\n scams[key]['addresses'].forEach(function(nameindex) {\\n sc_addresses += \\\"<div class='item'><a href='/address/\\\" + nameindex + \\\"'>\\\" + nameindex + \\\"</a></div>\\\";\\n });\\n if (sc_addresses) {\\n layout = layout.replace(/{{ scam.addresses }}/ig, '<b>Related addresses</b>: <div class=\\\"ui bulleted list\\\">' + sc_addresses + '</div>');\\n }\\n } else {\\n layout = layout.replace(/{{ scam.addresses }}/ig, \\\"\\\");\\n }\\n if (\\\"status\\\" in scams[key]) {\\n if (scams[key]['status'][0]['status'] != \\\"Unknown\\\") {\\n scams[key]['status'].forEach(function(nameindex) {\\n var st = nameindex['status'];\\n if (st == \\\"Active\\\") {\\n st = '<i class=\\\"checkmark icon\\\"></i> Active';\\n } else if (st == \\\"Offline\\\") {\\n st = '<i class=\\\"remove icon\\\"></i> Offline';\\n } else if (st == \\\"Suspended\\\") {\\n st = '<i class=\\\"warning sign icon\\\"></i> Suspended';\\n }\\n history += \\\"<tr><td class='\\\" + nameindex['status'].toLowerCase().replace('active', 'activ') + \\\"'>\\\" + st + \\\"</td><td>\\\" + dateFormat(nameindex['time'], \\\"mmmm dS, yyyy, HH:MM:ss Z\\\", true) + \\\"</td></tr>\\\"\\n });\\n actions = '<button id=\\\"history\\\" class=\\\"ui icon secondary button\\\"><i class=\\\"history icon\\\"></i> History</button>' + actions\\n layout = layout.replace(/{{ scam.history }}/ig, '<table class=\\\"ui celled table\\\"><thead><tr><th>Status</th><th>Date</th></tr></thead><tbody>' + history + '</tbody></table>');\\n layout = layout.replace(/{{ scam.status }}/ig, \\\"<b>Status</b>: <span class='\\\" + scams[key]['status'][0]['status'].toLowerCase().replace('active', 'activ') + \\\"'>\\\" + scams[key]['status'][0]['status'] + \\\"</span> (\\\" + dateFormat(scams[key]['status'][0]['time'], \\\"mmmm dS, yyyy, HH:MM:ss Z\\\", true) + \\\")<BR>\\\");\\n } else {\\n layout = layout.replace(/{{ scam.history }}/ig, \\\"\\\");\\n layout = layout.replace(/{{ scam.status }}/ig, \\\"\\\");\\n }\\n } else {\\n layout = layout.replace(/{{ scam.history }}/ig, \\\"\\\");\\n layout = layout.replace(/{{ scam.status }}/ig, \\\"\\\");\\n }\\n if (\\\"description\\\" in scams[key]) {\\n layout = layout.replace(/{{ scam.description }}/ig, \\\"<b>Description</b>: \\\" + scams[key]['description'] + \\\"<BR>\\\");\\n } else {\\n layout = layout.replace(/{{ scam.description }}/ig, \\\"\\\");\\n }\\n if (\\\"ip\\\" in scams[key]) {\\n layout = layout.replace(/{{ scam.ip }}/ig, '<b>IP</b>: <a href=\\\"/ip/' + scams[key]['ip'] + '\\\">' + scams[key]['ip'] + '</a><BR>');\\n } else {\\n layout = layout.replace(/{{ scam.ip }}/ig, \\\"\\\");\\n }\\n if (\\\"category\\\" in scams[key]) {\\n if (\\\"subcategory\\\" in scams[key]) {\\n layout = layout.replace(/{{ scam.category }}/ig, \\\"<b>Category</b>: \\\" + scams[key]['category'] + \\\" - \\\" + scams[key]['subcategory'] + \\\"<BR>\\\");\\n } else {\\n layout = layout.replace(/{{ scam.category }}/ig, \\\"<b>Category</b>: \\\" + scams[key]['category'] + \\\"<BR>\\\");\\n }\\n } else {\\n layout = layout.replace(/{{ scam.category }}/ig, \\\"\\\");\\n }\\n if (\\\"url\\\" in scams[key]) {\\n actions = '<a target=\\\"_blank\\\" href=\\\"http://web.archive.org/web/*/' + encodeURIComponent(url.parse(scams[key]['url']).hostname) + '\\\" class=\\\"ui icon secondary button\\\"><i class=\\\"archive icon\\\"></i> Archive</a>' + actions\\n layout = layout.replace(/{{ scam.url }}/ig, '<b>URL</b>: <a id=\\\"url\\\" target=\\\"_blank\\\" href=\\\"/redirect/?url=' + encodeURIComponent(scams[key]['url']) + '\\\">' + scams[key]['url'] + '</a><BR>');\\n layout = layout.replace(/{{ scam.ethaddresslookup }}/ig, \\\"<b>EtherAddressLookup</b>: <span id='blocked'>loading...</span><BR>\\\");\\n layout = layout.replace(/{{ scam.googlethreat }}/ig, \\\"<b>Google Safe Browsing</b>: <span id='googleblocked'>loading...</span><BR>\\\");\\n\\n if (\\\"status\\\" in scams[key] && scams[key]['status'][0]['status'] == \\\"Active\\\") {\\n actions = '<button id=\\\"gen\\\" class=\\\"ui icon secondary button\\\"><i class=\\\"setting icon\\\"></i> Abuse Report</button>' + actions\\n layout = layout.replace(/{{ scam.abusereport }}/ig, generateAbuseReport(scams[key]));\\n } else {\\n layout = layout.replace(/{{ scam.abusereport }}/ig, \\\"\\\");\\n }\\n } else {\\n layout = layout.replace(/{{ scam.url }}/ig, \\\"\\\");\\n layout = layout.replace(/{{ scam.abusereport }}/ig, \\\"\\\");\\n layout = layout.replace(/{{ scam.ethaddresslookup }}/ig, \\\"\\\");\\n layout = layout.replace(/{{ scam.googlethreat }}/ig, \\\"\\\");\\n }\\n layout = layout.replace(/{{ scam.id }}/ig, scams[key]['id']);\\n layout = layout.replace(/{{ scam.history }}/ig, history);\\n layout = layout.replace(/{{ scam.actions }}/ig, actions);\\n layout = layout.replace(/{{ scam.name }}/ig, scams[key]['name']);\\n if (!fs.existsSync(\\\"./_site/scam/\\\" + scams[key]['id'] + \\\"/\\\")) {\\n fs.mkdirSync(\\\"./_site/scam/\\\" + scams[key]['id'] + \\\"/\\\");\\n }\\n if (minify) {\\n layout = htmlmin(layout);\\n }\\n fs.writeFile(\\\"./_site/scam/\\\" + scams[key]['id'] + \\\"/index.html\\\", layout, function(err) {\\n if (err) {\\n return console.log(err);\\n }\\n });\\n }\\n if (!fs.existsSync(\\\"./_site/address/\\\")) {\\n fs.mkdirSync(\\\"./_site/address/\\\");\\n }\\n Object.keys(addresses).forEach(function(key) {\\n var layout = template.replace(\\\"{{ content }}\\\", layout_addresses);\\n var related = \\\"\\\";\\n for (var i = 0, len = addresses[key].length; i < len; i++) {\\n related += \\\"<div class='item'><a href='/scam/\\\" + addresses[key][i] + \\\"'>\\\" + data.find(o => o['id'] === addresses[key][i])['name'] + \\\"</a></div>\\\";\\n }\\n if (related) {\\n related = '<div class=\\\"ui bulleted list\\\">' + related + '</div>';\\n } else {\\n related = \\\"None\\\";\\n }\\n layout = layout.replace(/{{ address.address }}/ig, key);\\n layout = layout.replace(/{{ address.scams }}/ig, related);\\n if (!fs.existsSync(\\\"./_site/address/\\\" + key + \\\"/\\\")) {\\n fs.mkdirSync(\\\"./_site/address/\\\" + key + \\\"/\\\");\\n }\\n if (minify) {\\n layout = htmlmin(layout);\\n }\\n fs.writeFile(\\\"./_site/address/\\\" + key + \\\"/index.html\\\", layout, function(err) {\\n if (err) {\\n return console.log(err);\\n }\\n });\\n });\\n if (!fs.existsSync(\\\"./_site/ip/\\\")) {\\n fs.mkdirSync(\\\"./_site/ip/\\\");\\n }\\n Object.keys(ips).forEach(function(key) {\\n var layout = template.replace(\\\"{{ content }}\\\", layout_ips);\\n var related = \\\"\\\";\\n for (var i = 0, len = ips[key].length; i < len; i++) {\\n related += \\\"<div class='item'><a href='/scam/\\\" + ips[key][i] + \\\"'>\\\" + data.find(o => o['id'] === ips[key][i])['name'] + \\\"</a></div>\\\"\\n }\\n if (related) {\\n related = '<div class=\\\"ui bulleted list\\\">' + related + '</div>'\\n } else {\\n related = \\\"None\\\"\\n }\\n layout = layout.replace(/{{ ip.ip }}/ig, key);\\n layout = layout.replace(/{{ ip.scams }}/ig, related);\\n if (!fs.existsSync(\\\"./_site/ip/\\\" + key + \\\"/\\\")) {\\n fs.mkdirSync(\\\"./_site/ip/\\\" + key + \\\"/\\\");\\n }\\n if (minify) {\\n layout = htmlmin(layout);\\n }\\n fs.writeFile(\\\"./_site/ip/\\\" + key + \\\"/index.html\\\", layout, function(err) {\\n if (err) {\\n return console.log(err);\\n }\\n });\\n });\\n console.log(\\\"Done generating unique scam pages\\\");\\n if (job == \\\"build\\\" || job == false) {\\n copyStatic();\\n } else {\\n finish();\\n }\\n}\",\n \"function documentationPages() {\\n return gulp.src(Config.paths.srcDocsPages + \\\"/**/index.html\\\")\\n .pipe(Plugins.plumber(ErrorHandling.oneErrorInPipe))\\n .pipe(Plugins.debug({\\n title: \\\"Building Documentation Page File to \\\" + Config.paths.distDocumentation\\n }))\\n .pipe(Plugins.handlebars(templateData, hbsoptions))\\n .pipe(Plugins.fileinclude({\\n context: {\\n filePath: filePath,\\n build: build\\n }\\n }))\\n .pipe(gulp.dest(Config.paths.distDocumentation));\\n}\",\n \"function buildPage(contents)\\n{\\n\\tvar pageContents = \\\"\\\";\\n\\tfor(var i = 0; i < contents.length; i++)\\n\\t{\\n\\t\\t//build a page.\\n\\t\\tpageContents += \\\"<div class= 'post'><h2>\\\" + contents[i].gsx$posttitle.$t + \\\" Made on \\\" + contents[i].gsx$timestamp.$t + \\\"</h2><p>\\\" + contents[i].gsx$postbody.$t + \\\"</p></div>\\\";\\n\\t}\\n\\t//now load it.\\n\\t$(\\\".mainContent\\\").html(pageContents);\\n}\",\n \"function pages() {\\n return gulp.src( 'src/pages/**/*.html' )\\n .pipe( panini({\\n root: 'src/pages',\\n layouts: 'src/layouts',\\n partials: 'src/partials',\\n helpers: 'src/helpers',\\n data: 'src/data'\\n }))\\n .pipe( gulp.dest( 'build' ) );\\n}\",\n \"async build(write = true) {\\n for(let g in this.items) {\\n if(this.items[g].hasConfig && this.items[g].config.build != false) {\\n // render out this page\\n let dirs = this.items[g].href.split('/');\\n dirs.pop();\\n let page = {\\n data: this.items[g].render({ pages: this.items }),\\n config: this.items[g].config,\\n name: g };\\n await this.emitMiddleware('after', page);\\n if(write) {\\n console.log(' [build] Writing file ' + this.config.base + '/' + this.items[g].href + '...');\\n fs.mkdir(this.config.base + '/' + dirs.join('/'), { recursive: true }, (err) => {\\n if (err) throw err;\\n fs.writeFileSync(this.config.base + '/' + this.items[g].href, page.data);\\n });\\n } else {\\n this.output[g] = page.data;\\n }\\n }\\n }\\n this.emitMiddleware('finish');\\n }\",\n \"function jekyll_staging() {\\n return child_process.spawn(\\\"bundle\\\", [\\\"exec\\\", \\\"jekyll\\\", \\\"build\\\", \\\"--config\\\", \\\"_config-staging.yml\\\"], { stdio: \\\"inherit\\\" });\\n}\",\n \"async buildPost (filename) {\\n let md = await this.fs.promises.readFile(`${this.config.settings.SRC}/${filename}`, \\\"utf8\\\")\\n let { content, data } = matter(md)\\n data.permalink = filename\\n let html = marked(content, { baseUrl: \\\"../../\\\" }) \\n //await this.processContent( { content, html, data, filename } )\\n //await this.processImages({ content })\\n await this.plugins(\\\"onsave\\\", { content, html, data, filename })\\n return { html, data }\\n }\",\n \"function BlogIndex(conf) {\\n\\n var self = this;\\n\\n this.conf = conf;\\n\\n this.genBlogIndex = function() {\\n\\n /* write some HTML to format the data */\\n var mdBodyObj = document.getElementById(gs_body_id);\\n var ul = document.createElement('ul');\\n appendAttribute(ul, 'class', 'list-group');\\n mdBodyObj.appendChild(ul);\\n\\n var firstPost = 1;\\n var reqPage = self.conf.requested_blog_index_page;\\n var itemMax = self.conf.blog_items.length;\\n\\n if (self.conf.paginationIsActive()) {\\n itemMax = self.conf.pagination;\\n firstPost = (reqPage-1) * itemMax + 1;\\n var gsPagination = new PageNav(gsConfig);\\n gsPagination.genNavListTags();\\n }\\n\\n var itemCnt = 0;\\n for (index = firstPost; index < self.conf.blog_items.length; index++) {\\n if (itemCnt >= itemMax) { break; }\\n\\n var item = self.conf.blog_items[index];\\n var li = document.createElement('li');\\n li.setAttribute('id', item);\\n appendAttribute(li, 'class', 'list-group-item');\\n ul.appendChild(li);\\n\\n self.PostPreviewToHTML(gs_post_path+'/'+item, item);\\n itemCnt++;\\n }\\n };\\n\\n /* Download a post file (yaml + markdown), parse YAML, convert to HTML,\\n * then post to given div-id. */\\n this.PostPreviewToHTML = function(relpath, markdown_div) {\\n var callback = function (text) {\\n\\n /* circumvent github's auto-meta parsing */\\n text = text.replace(\\\"(((\\\",'---');\\n text = text.replace(\\\")))\\\",'---');\\n\\n if ((isBlank(text)) || (text == null) || (text == 'null') ||\\n (typeof text === 'undefined')) {\\n var li = document.getElementById(markdown_div);\\n li.innerHTML = 'Unable to load text for: '+relpath;\\n return;\\n }\\n\\n /* parse YAML header */\\n var obj = jsyaml.loadFront(text)\\n\\n /* check for post meta data */\\n var date = typeof obj.Date !== 'undefined' ? obj.Date.toDateString() : '';\\n var author = typeof obj.Author !== 'undefined' ? obj.Author : '';\\n var summary = typeof obj.Summary !== 'undefined' ? obj.Summary : '';\\n var title = typeof obj.Title !== 'undefined' ? obj.Title : '';\\n\\n /* write some HTML to format the data */\\n var li = document.getElementById(markdown_div);\\n li.innerHTML = '<a href=?post='+markdown_div+'><b>'+title+\\n '</b><br></a> ' + author + ' | <small>' + \\n date + '</small><br><i>' + summary +\\n '</i>';\\n\\n };\\n getFile(relpath, callback);\\n };\\n\\n this.genBlogIndex();\\n}\",\n \"function generateGemini() {\\n\\tprint(\\\"\\\\x1b[90m->\\\\x1b[0m generating gemini site...\\\");\\n\\t// sanity\\n\\tlet files = {};\\n\\n\\t// generate index\\n\\tlet _books = [\\\"📕\\\", \\\"📗\\\", \\\"📘\\\", \\\"📙\\\", \\\"📓\\\"].sort(() => Math.random() - .5); // random book emojis\\n\\tlet _wikiRecent = pages\\n\\t\\t// remove stubs\\n\\t\\t.filter(page => !page.category.includes(\\\"stub\\\"))\\n\\t\\t// first five\\n\\t\\t.slice(0, 5)\\n\\t\\t// render\\n\\t\\t.map((p, i) => {\\n\\t\\t\\tlet book = _books[i]; // get random book emoji\\n\\t\\t\\tlet category = prependRelevantEmoji(p.category[0]);\\n\\t\\t\\treturn `=> /wiki/${p.page}.xyz ${book} wiki/${p.title}`\\n\\t\\t\\t\\t+ \\\"\\\\n```\\\\n \\\" + `[${p.modified}] [${category}]` + \\\"\\\\n```\\\";\\n\\t\\t})\\n\\t\\t// stringify\\n\\t\\t.join(\\\"\\\\n\\\");\\n\\tfiles[\\\"index\\\"] = templates[\\\"index.gmi\\\"].replace(\\\"{wiki_recent}\\\", _wikiRecent);\\n\\n\\t// generate wiki index\\n\\tlet _wikiAll = pages\\n\\t\\t// remove stubs\\n\\t\\t.filter(page => !page.category.includes(\\\"stub\\\"))\\n\\t\\t// render\\n\\t\\t.map(p => {\\n\\t\\t\\tlet category = p.category.map(prependRelevantEmoji).join(\\\", \\\");\\n\\t\\t\\treturn `=> /wiki/${p.page}.xyz ${p.title}` +\\n\\t\\t\\t\\t\\\"\\\\n```\\\\n \\\" + `[${p.modified}] [${category}]` + \\\"\\\\n```\\\";\\n\\t\\t})\\n\\t\\t// stringify\\n\\t\\t.join(\\\"\\\\n\\\");\\n\\tfiles[\\\"wiki/index\\\"] = templates[\\\"wiki-index.gmi\\\"].replace(\\\"{wiki_all}\\\", _wikiAll);\\n\\n\\tfiles[\\\"stats\\\"] = templates[\\\"stats.gmi\\\"];\\n\\n\\t// generate wiki pages\\n\\tpages.forEach(p => {\\n\\t\\tfiles[\\\"wiki/\\\" + p.page] = templates[\\\"wiki-page.gmi\\\"].replace(\\\"{content}\\\", p.content);\\n\\t});\\n\\n\\t// write pages\\n\\tlet x = 0;\\n\\tlet _files = Object.keys(files);\\n\\t_files.forEach((f) => new Promise((resolve, reject) => {\\n\\t\\tlet content = files[f]\\n\\t\\t\\t// remove html-only templates\\n\\t\\t\\t.replace(/{html[a-z_]*}\\\\n/g, \\\"\\\")\\n\\t\\t\\t// add filenames to thumbnails\\n\\t\\t\\t.replace(/(\\\\w*)\\\\.(png|jpg) (thumbnail|cover|image)/gi, \\\"$1.$2 $3 ($1.$2)\\\")\\n\\t\\t\\t// replace ambiguous links\\n\\t\\t\\t.replace(/\\\\.xyz/g, \\\".gmi\\\");\\n\\n\\t\\tlet _f = std.open(\\\"out/gemini/\\\" + f + \\\".gmi\\\", \\\"w\\\");\\n\\t\\tif (_f.error()) return reject(_f.error());\\n\\t\\t_f.puts(content);\\n\\n\\t\\t// update terminal readout\\n\\t\\tstd.printf(`\\\\r\\\\x1b[32m-->\\\\x1b[0m wrote gemini page ${x + 1}/${_files.length}`);\\n\\t\\t// if all pages have been written\\n\\t\\tif (++x == _files.length) {\\n\\t\\t\\tstd.printf(\\\"\\\\n\\\");\\n\\t\\t\\tgenerateHTML(files);\\n\\t\\t}\\n\\t\\tresolve();\\n\\t}).catch(print));\\n}\",\n \"function buildPage(){\\n addItems('make', make);\\n addItems('model', model);\\n addItems('keywords', keywords);\\n checkAll();\\n}\",\n \"function buildPortfolio() {\\n const queue = [];\\n queue.push(publish(Portfolio, {\\n pagePath: '/showcase/',\\n pageHeading: Portfolio.defaultProps.pageHeading\\n }));\\n global.DBUSHELL.__pConfig.pages.forEach(props => queue.push(\\n publish(Page, {\\n ...props,\\n pageHeading: props.pageHeading,\\n pagePath: `/showcase/${props.slug}/`,\\n innerHTML: Page.getHTML(path.join(global.DBUSHELL.__pSrc, `${props.slug}.md`))\\n })\\n ));\\n return Promise.all(queue);\\n}\",\n \"function generateBlogPostsIndex(graphql, createPage){\\n\\n //Query the siteMetadata for the blogs, For each blog -\\n let prArray = [] //the promise array\\n BC.forEach((blog) =>{\\n // query all the markdown in it's children folder with -\\n // render!=false, publish=true, type=post\\n\\n //RegEx cant end without '/', it interprets \\\"blog\\\" as a flag. like \\\\foo.bar/g\\\\ \\n // where 'g' is the flag. Never mind, it needs 2 \\\"/\\\" at the end. Sigh. :'(\\n // This regex processing is WEIRD - (some even need to start with '/')\\n // NEED to figure out whats happening, gatsby's handling mostly\\n // Even though it's a string, needs to start and end with \\\"/\\\"\\n let blogPath = `${__dirname}/src/pages/${blog.path}/`\\n let filePath = `${blogPath}posts/index.md`\\n\\n let task = graphql(`\\n {\\n allMarkdownRemark(\\n filter: {\\n fileAbsolutePath: {regex: \\\"${blogPath}/\\\"}\\n frontmatter:{\\n published: {eq : true}\\n type: {ne: \\\"page\\\"}\\n }\\n }\\n ){\\n totalCount\\n }\\n\\n markdownRemark(\\n fileAbsolutePath :{eq:\\\"${filePath}\\\"}\\n ){\\n id\\n frontmatter {\\n layout\\n postsPerPage\\n }\\n fields{\\n slug\\n }\\n }\\n }\\n `)\\n .then(result => {\\n let {allMarkdownRemark, markdownRemark} = result.data\\n let layout = markdownRemark.frontmatter.layout || \\\"blog-posts-index.js\\\"\\n let postsPerPage = markdownRemark.frontmatter.postsPerPage || 5\\n let numPages = Math.ceil(allMarkdownRemark.totalCount/ postsPerPage)\\n let slug = markdownRemark.fields.slug\\n\\n Array.from({ length: numPages }).forEach((_, i) => {\\n createPage({\\n path: i === 0 ? slug : `${slug}${i + 1}`,\\n component: path.resolve(`./src/templates/${layout}`),\\n context: {\\n limit: postsPerPage,\\n skip: i * postsPerPage,\\n blogPath: blogPath+'/', //apparently you need this :( or it matches 'blog' and 'blog2'\\n filePath,\\n totalPages: numPages\\n },\\n })\\n })\\n })\\n\\n prArray.push(task)\\n })\\n\\n return Promise.all(prArray)\\n\\n}\",\n \"function build(options) {\\n\\n options = extend(true, defaultOptions, options);\\n\\n return function() {\\n\\n return gulp.src(options.src.css)\\n .pipe(extract())\\n .pipe(rename({ extname: '.html' }))\\n .pipe(ssg({ sort: 'order' }))\\n .pipe(render(options.site, compiledTemplates))\\n .pipe(gulp.dest(options.dest.html));\\n };\\n}\",\n \"function renderPageForBots() {\\n\\n /* Fill the body content with either a blog-index, post or page. */\\n if (gsConfig.blogIndexIsActive()) {\\n\\n /* use the sitemap instead of the blog index */\\n var gsSitemap = new Sitemap(gsConfig);\\n PrettyMarkdownTextToHTML(gsSitemap.links(), gs_body_id);\\n\\n } else if (gsConfig.postIsActive()) {\\n /* If a post was found in the url query. */\\n MarkdownFileToBody(gs_post_path+'/'+gsConfig.requested_page);\\n\\n /* render previous and next links */\\n var gsPagination = new PageNav(gsConfig);\\n gsPagination.genPostNavListTags();\\n\\n } else {\\n /* The active page needs to correspond to a file at this point so \\n * that the getter can download it. The getter should be post aware.*/\\n MarkdownFileToBody(gsConfig.requested_page); \\n }\\n\\n /* render the simple sitemap */\\n if (gsConfig.sitemapIsActive()) {\\n var gsSitemap = new Sitemap(gsConfig);\\n PrettyMarkdownTextToHTML(gsSitemap.links(), gs_body_id);\\n }\\n\\n /* Fill the body content with either a blog-index, post or page. */\\n /* fill in the navbar */\\n var gsNav = new Nav(gsConfig);\\n \\n}\",\n \"function build_content(path) {\\r\\n var _con = content,\\r\\n // package.json\\r\\n json = '{' + eol, ce = program.css, dir_arr = build_path(path), engine = program.template;\\r\\n json += ' \\\"name\\\": \\\"' + program.name + '\\\" \\\\'' + eol;\\r\\n json += '+\\\\' , \\\"version\\\": \\\"0.0.1-alpha\\\" \\\\'' + eol;\\r\\n json += '+\\\\' , \\\"private\\\": true \\\\'' + eol;\\r\\n json += '+\\\\' , \\\"dependencies\\\": { \\\\'' + eol;\\r\\n if(program.css)\\r\\n json += '+\\\\' \\\"' + program.css + '\\\": \\\">= 0.0.1\\\" \\\\'' + eol;\\r\\n if(program.template)\\r\\n json += ' +\\\\' , \\\"' + program.template + '\\\": \\\">= 0.0.1\\\" \\\\'' + eol;\\r\\n json += '+\\\\' } \\\\'' + eol;\\r\\n json += '+\\\\'}';\\r\\n var css_content = 'var ' + engine + 'Layout=' + config.template[engine + 'Layout'] + eol + 'var ' + engine + 'Index=' + config.template[engine + 'Index'] + eol;\\r\\n _con = _con.replace(\\\"{name}\\\", program.name).replace(\\\"{json}\\\", json.replace(/\\\\r\\\\n/,''));\\r\\n _con = _con.replace(\\\"{css_template}\\\", css_content);\\r\\n _con = _con.replace(\\\"{create_css}\\\", ' write(path + \\\"' + config.custum_dir.css[ce] + '/style.css\\\", \\\"/*please write your '+ program.css +' code here!*/\\\");' + eol);\\r\\n _con = _con.replace(\\\"{create_js}\\\", '//todo: choose some lib to use ' + program.architec + ' by yourself!'+eol);\\r\\n _con = _con.replace(\\\"{create_template}\\\", '//todo: load template to use ' + program.css + ' by yourself!' + eol);\\r\\n _con = _con.replace(\\\"{create_html}\\\", 'write(path +\\\"/index.html\\\",index_html);'+eol);\\r\\n _con = _con.replace(\\\"{dir}\\\",\\\"'\\\"+ dir_arr+\\\"'.split(',').join(' '+path).split(' ').slice(1)\\\"+eol);\\r\\n return _con;\\r\\n}\",\n \"static build()\\n\\t{\\n\\t\\tIndex.buildeNotifications();\\n\\t\\tIndex.buildePersonalPanel();\\n\\t\\tIndex.buildePageContent();\\n\\t\\t\\n\\t\\taddCollapseFunction();\\n\\t}\",\n \"function build(cb) {\\n const buildCommand = 'JEKYLL_ENV=production bundle exec jekyll build';\\n exec(buildCommand, (error, stdout, stderr) => {\\n if (error) {\\n gutil.log(gutil.colors.magenta(`exec error: ${error}`));\\n return cb(error);\\n }\\n\\n gutil.log(stdout);\\n gutil.log(gutil.colors.magenta(stderr));\\n cb()\\n });\\n}\",\n \"function taskMarkup() {\\n logSubtask('markup');\\n\\n return gulp.src(`${MARKUP_SRC}/pages/**/*.html`)\\n .pipe(panini({\\n root: `${MARKUP_SRC}/pages/`,\\n layouts: `${MARKUP_SRC}/layouts/`,\\n partials: `${MARKUP_SRC}/partials/`,\\n }))\\n .pipe(gulp.dest(MARKUP_DIST));\\n}\",\n \"function createIndex(err) {\\n if (err) throw err\\n fs.readFile(template, 'utf8', function(err, template) {\\n if (err) throw err\\n fn = jade.compile(template, { pretty: true })\\n results.title = (program.title) ? program.title : 'Readme Docs'\\n results.github = (program.github) ? program.github : false\\n // css addition\\n results.css = false\\n if (program.css) {\\n // copy the file to the build/css folder\\n var cssName = path.basename(program.css)\\n fs.copy(program.css, path.join(build, 'css', cssName), function(err) {\\n if (err) throw err\\n // add the css file\\n results.css = cssName\\n finishFile()\\n })\\n } else {\\n finishFile()\\n }\\n })\\n }\",\n \"function build() {\\n //conditional statement that checks if the output directory has been created\\n if(!fs.existsSync(OUTPUT_DIR)) {\\n fs.mkdirSync(OUTPUT_DIR)\\n\\n }\\n //validation of dir and path variables\\nconsole.log(OUTPUT_DIR, outputPath)\\n//this writes the html file\\nfs.writeFileSync(outputPath, render(members), \\\"utf-8\\\")\\n\\n}\",\n \"function pages() {\\n return gulp.src('src/pages/**/*.{html,hbs,handlebars}')\\n .pipe(panini({\\n root: './src/pages/',\\n layouts: './src/layouts/',\\n partials: './src/partials/',\\n helpers: './src/helpers/',\\n data: './src/data',\\n }))\\n .pipe(gulp.dest('./dist/'))\\n}\",\n \"function compile() {\\n sites.map(function (site) {\\n stylesDev(site);\\n scriptsDev(site);\\n });\\n}\",\n \"function jekyll() {\\n return child_process.spawn(\\\"bundle\\\", [\\\"exec\\\", \\\"jekyll\\\", \\\"build\\\", \\\"--profile\\\", \\\"--trace\\\"], { stdio: \\\"inherit\\\" });\\n}\",\n \"function pages() {\\n return gulp.src(['src/pages/**/*.html','!src/pages/**/_*.html']) \\n .pipe(panini({\\n root: 'src/pages/',\\n layouts: 'src/layouts/',\\n partials: 'src/partials/',\\n data: 'src/pages/**/',\\n helpers: 'src/helpers/'\\n }))\\n .pipe(htmlImg64())\\n .pipe(base64('/')) \\n .pipe(htmlsplit())\\n // .pipe(rename(function (path) {\\n // // { dirname: 'huynhtan', basename: 'index', extname: '.xml' }\\n // if ((path.extname === '.xslt' || path.extname === '.xml') && path.dirname !== ''){\\n // path.basename = path.dirname;\\n // }\\n // }))\\n .pipe(gulp.dest(PATHS.dist))\\n\\n}\",\n \"function pagesDist() {\\n return gulp.src( 'src/pages/**/*.html' )\\n .pipe( panini({\\n root: 'src/pages',\\n layouts: 'src/layouts',\\n partials: 'src/partials',\\n helpers: 'src/helpers',\\n data: 'src/data'\\n }))\\n .pipe( gulp.dest( 'dist' ) );\\n}\",\n \"function pages() {\\n return gulp.src(`${PATHS.pageTemplates}/**/*.{html,hbs,handlebars}`)\\n .pipe(panini({\\n root: PATHS.pageTemplates,\\n layouts: PATHS.layouts,\\n partials: PATHS.partials,\\n data: PATHS.data,\\n helpers: PATHS.helpers\\n }))\\n .pipe(rename((path) => {\\n path.extname = \\\".html\\\";\\n }))\\n .pipe(gulp.dest(PATHS.dist));\\n}\",\n \"function pages() {\\n\\n return gulp.src('src/pages/**/*.{html,hbs,handlebars}')\\n .pipe(panini({\\n root: 'src/pages/',\\n layouts: 'src/layouts/',\\n partials: 'src/partials/',\\n data: 'src/data/',\\n helpers: 'src/helpers/'\\n }))\\n .pipe(gulp.dest(PATHS.dist));\\n}\",\n \"async function startBuildStep() {\\n rimraf(finalPagesDir)\\n fs.mkdirSync(finalPagesDir)\\n\\n if (logBuild) {\\n console.log(`Building pages | from ${currentPagesDir} to ${finalPagesDir}`)\\n }\\n\\n readPageNamespaces() // Next step\\n}\",\n \"function pages() {\\n return gulp.src(paths.pages.src)\\n .pipe(htmlmin({\\n collapseWhitespace: true,\\n removeComments: true\\n }))\\n .pipe(gulp.dest(paths.pages.dest));\\n}\",\n \"function html() {\\n // Gets .html and .nunjucks files in pages\\n return gulp.src('src/pages/**/*.+(html|nunjucks)')\\n // Renders template with nunjucks\\n .pipe(nunjucksRender({\\n path: ['src/templates']\\n }))\\n // output files in src folder\\n .pipe(gulp.dest('app'));\\n}\",\n \"build () {}\",\n \"async function createDemo() {\\n if (!existsSync(deploy_dir)) await mkdir(deploy_dir, { recursive: true });\\n\\n const PORT = parseInt(process.env.PORT || '4000');\\n let baseUrl = 'http://localhost:' + PORT;\\n let url = new URL(baseUrl);\\n const path = (() => {\\n const path = url.pathname.replace(/.html$/, '');\\n if (path.endsWith('/') || path.length < 1) return path + 'index';\\n return path;\\n })();\\n\\n const view = join(__dirname, 'src-docs');\\n const view_ejs = join(view, path + '.ejs');\\n const title = 'Safelinkify - External Link Anonymizer';\\n if (existsSync(view_ejs)) {\\n const helpers = new EJSHelper({\\n root: join(view, 'layout.ejs')\\n });\\n const renderPage = await helpers.renderFile(view_ejs);\\n helpers.add('body', renderPage);\\n helpers.add('title', title);\\n helpers.add('description', pkg.description);\\n let renderLayout = await helpers.renderFile(join(view, 'layout.ejs'));\\n\\n // write to test folder\\n await writeFile(join(__dirname, 'src/test/index.html'), renderLayout);\\n\\n /** Safelinkify */\\n renderLayout = await safelinkInstance.parse(renderLayout);\\n\\n /** minify for github pages */\\n\\n let result = '';\\n try {\\n result = await minify(renderLayout, {\\n minifyCSS: true,\\n minifyJS: true,\\n collapseWhitespace: true\\n });\\n } catch {\\n result = renderLayout;\\n }\\n\\n // save demo index.html\\n const saveTo = join(deploy_dir, 'index.html');\\n await writeFile(saveTo, result);\\n console.log('demo saved', saveTo);\\n }\\n}\",\n \"function buildProcess({ page, buildConfig, env }) {\\n const { minify, pretty, livereload } = buildConfig\\n\\n const isProd = env === 'production'\\n const shouldMinifyHtml = isProd && minify.enabled\\n const shouldPrettifyHtml = !isProd && pretty.enabled\\n const shouldLivereload = !isProd && livereload.enabled\\n\\n let builtPage = page\\n\\n if (shouldLivereload) {\\n builtPage = withLivereload(builtPage, livereload.options)\\n }\\n\\n if (shouldMinifyHtml) {\\n builtPage = minifyHtml(builtPage, minify.options)\\n }\\n\\n if (shouldPrettifyHtml) {\\n builtPage = prettyHtml(builtPage, pretty.options)\\n }\\n\\n return builtPage\\n}\",\n \"function createWebsite() {\\n\\n fs.writeFile('./dist/index.html', generateTeamHtml(allEmployees), (err) =>\\n err ? console.error(err) : console.log('Team HTML File Generated!'));\\n console.log('The file has been saved!')\\n console.log(allEmployees[1].school);\\n}\",\n \"function buildContent(data, $this, template) {\\n\\t\\tvar newURL;\\n\\t\\tvar html;\\n\\t\\t/* A check to see if this is a Grid SEO page */\\n\\t\\tvar seoPage = Boolean($('#skjpsp_ops').val() === '1');\\n\\t\\tvar hasCorrectURL = checkForCorrectURLStructure(data);\\n\\n\\t\\t// Checks to see if this is a SEO page and if the URL is correct in the JSON\\n\\t\\t// We then push the updated SEO URL if it's a ContentView Page, if not it does nothing\\n\\t\\tif (seoPage && !hasCorrectURL) {\\n\\t\\t\\tnewURL = data.url.split('=');\\n\\t\\t\\t// self refferencing but...\\n\\t\\t\\tdata.url = (newURL[0].split('?')[0] === 'ContentView') ? '/c/' + newURL[1] : data.url;\\n\\t\\t}\\n\\n\\t\\t// Build out and append our template(s)\\n\\t\\thtml = mustache.to_html(mustacheTemplates[template], data);\\n\\t\\t$(html).appendTo($this);\\n\\t}\",\n \"function generateHTML(fileList) {\\r\\n try {\\r\\n const blogList = []\\r\\n const htmlString = readTemplate('template/post.html')\\r\\n\\r\\n let prevPage = ``\\r\\n let nextPage = ``\\r\\n const fileListLength = fileList.length\\r\\n fileList.reverse()\\r\\n\\r\\n for (let i = 0; i < fileListLength; ++i) {\\r\\n const timeStart = process.hrtime()\\r\\n\\r\\n if (i > 0) {\\r\\n const fInfo = fileList[i - 1].split(path.sep).slice(-1)[0].split(`_`)\\r\\n const fileNamePath = fInfo.slice(0,1)[0].split(`-`).slice(0,2).concat(fInfo.slice(1)[0].slice(0,-3))\\r\\n prevPage = path.join(path.sep, ...(fileNamePath) ,`index.html`)\\r\\n } else {\\r\\n prevPage = ``\\r\\n }\\r\\n\\r\\n if (i < fileListLength - 1) {\\r\\n const fInfo = fileList[i + 1].split(path.sep).slice(-1)[0].split(`_`)\\r\\n const fileNamePath = fInfo.slice(0,1)[0].split(`-`).slice(0,2).concat(fInfo.slice(1)[0].slice(0,-3))\\r\\n nextPage = path.join(path.sep, ...(fileNamePath) ,`index.html`)\\r\\n } else {\\r\\n nextPage = ``\\r\\n }\\r\\n\\r\\n let statData = ``\\r\\n const fileData = fs.readFileSync(fileList[i], 'utf-8')\\r\\n const fileInfo = {}\\r\\n fileInfo.fileName = fileList[i]\\r\\n fileInfo.contents = fileData\\r\\n\\r\\n const fileContents = parseFile(fileInfo)\\r\\n assertCheck(fileContents)\\r\\n\\r\\n const htmlData = markdown.render(fileContents.htmlData)\\r\\n const dateLong = `${dateFormat(fileContents.metadata.date, \\\"yyyy-mm-dd\\\")}`\\r\\n const dateLongArray = dateLong.split(`-`)\\r\\n const dirArray = dateLongArray.slice(0,2).concat(\\r\\n fileList[i].split(path.sep)\\r\\n .slice(-1)[0]\\r\\n .split('_').slice(1)\\r\\n .join('_').slice(0, -3)\\r\\n )\\r\\n \\r\\n let breadCrumb = [`Home`].concat(dateLongArray.slice(0,2))\\r\\n let breadCrumbElem = `<ul class=\\\"breadcrumb\\\">`\\r\\n let blogLink = `/`\\r\\n for (let x = 0; x < breadCrumb.length; ++x) {\\r\\n if (x > 0) {\\r\\n blogLink += breadCrumb[x] + `/`\\r\\n }\\r\\n let singleCrumb = `<li><a href=\\\"${blogLink}\\\">${breadCrumb[x]}</a></li>`\\r\\n breadCrumbElem += singleCrumb\\r\\n \\r\\n }\\r\\n breadCrumbElem += `</ul>`\\r\\n\\r\\n let outputData = htmlString\\r\\n\\r\\n outputData = outputData.replace(`||title||`, fileContents.metadata.title)\\r\\n outputData = outputData.replace(`||breadcrumb||`, breadCrumbElem)\\r\\n outputData = outputData.replace(`||blog-title||`, fileContents.metadata.title)\\r\\n outputData = outputData.replace(`||blog-date||`, fileContents.metadata.blogDate)\\r\\n outputData = outputData.replace(`||blog-post||`, htmlData)\\r\\n \\r\\n fs.mkdirSync((path.join(__dirname, `public`, ...(dirArray))),\\r\\n { recursive: true }, \\r\\n (err) => {\\r\\n consoleError(err)\\r\\n throw (`Error in creating the directory`)\\r\\n }\\r\\n )\\r\\n\\r\\n const outputFileName = path.join(`public`, ...(dirArray) ,`index.html`)\\r\\n const timeEnd = process.hrtime(timeStart)\\r\\n\\r\\n if (prevPage !== ``) {\\r\\n statData = `<a id=\\\"prevPost\\\" href=\\\"${prevPage}\\\">Prev</a>`\\r\\n } else {\\r\\n statData = `<a id=\\\"prevPost\\\" href=\\\"${prevPage}\\\"></a>`\\r\\n }\\r\\n \\r\\n statData += `<p>Page generated in ${((timeEnd[0] * 1e9 + timeEnd[1]) / 1e6).toString().substr(0,5)} ms</p>`\\r\\n \\r\\n if (nextPage !== ``) {\\r\\n statData += `<a id=\\\"nextPost\\\" href=\\\"${nextPage}\\\">Next</a>`\\r\\n } else {\\r\\n statData += `<a id=\\\"nextPost\\\" href=\\\"${nextPage}\\\"></a>`\\r\\n }\\r\\n\\r\\n outputData = outputData.replace(`||page-footer||`, statData)\\r\\n fs.writeFileSync(outputFileName, outputData)\\r\\n\\r\\n const blogData = {}\\r\\n blogData.metadata = fileContents.metadata\\r\\n blogData.location = dirArray\\r\\n blogList.push(blogData)\\r\\n consoleAqua(`FILE WRITTEN => ${outputFileName}`)\\r\\n }\\r\\n\\r\\n generateBlogList(blogList)\\r\\n } catch (err) {\\r\\n consoleError(`ERROR in generateHTML`)\\r\\n consoleError(`ERROR => ${err.stack}`)\\r\\n }\\r\\n}\",\n \"function pug() {\\n // JSONファイルの読み込み。\\n const locals = {\\n site: JSON.parse(fs.readFileSync(`${src.data}/site.json`)),\\n };\\n // locals.ja = {\\n // // 日本語サイト\\n // site: JSON.parse(fs.readFileSync(`${src.data}ja/site.json`)),\\n // };\\n // locals.en = {\\n // // 英語サイト\\n // site: JSON.parse(fs.readFileSync(`${src.data}en/site.json`)),\\n // };\\n return (\\n gulp\\n .src(src.html)\\n .pipe(\\n plumber({ errorHandler: notify.onError(\\\"Error: <%= error.message %>\\\") })\\n )\\n // .pipe(\\n // data(file => {\\n // // 各ページのルート相対パスを格納します。\\n // locals.pageAbsolutePath = `/${path\\n // .relative(file.base, file.path.replace(/.pug$/, '.html'))\\n // .replace(/index\\\\.html$/, '')}`;\\n // return locals;\\n // }),\\n // )\\n // .pipe(cache('html'))\\n .pipe(\\n gulpPug({\\n // `locals`に渡したデータを各Pugファイルで取得できます。\\n locals,\\n // ルート相対パスでincludeが使えるようにします。\\n basedir: src.pug,\\n // Pugファイルの整形。\\n pretty: true,\\n })\\n )\\n .pipe(gulp.dest(dest.root))\\n .pipe(browserSync.reload({ stream: true }))\\n );\\n}\",\n \"function buildPage(file, data) {\\n // Create a file called teamprofilepage.html, adding the input data transformed by generateHTML.js formatting.\\n fs.writeFile(\\\"./dist/teampage.html\\\", generateHTML(data), function (error) {\\n // If file created successfull, notify user of success in the command line interface. If error, notify user in the command line interface.\\n if(error) {\\n console.log(\\\"An unknown error occurred.\\\")\\n }\\n else {\\n console.log(\\\"Your teampage.html file has been created successfully!\\\")\\n }\\n })\\n}\",\n \"function pages() {\\n return gulp.src('src/templates/**/*.tpl.html')\\n .pipe(panini({\\n root: 'src/templates',\\n layouts: 'src/layouts',\\n partials: 'src/partials',\\n helpers: 'src/helpers'\\n }))\\n .pipe(inky())\\n .pipe($.extReplace('.php'))\\n .pipe(gulp.dest('templates'))\\n\\n // Update compiled file timestamp.\\n .pipe($.shell([\\n 'touch <%= file.path %>'\\n ]));\\n}\",\n \"function contentPrepComplete() {\\n // Loop through our pages.\\n siteIndex.content.forEach((file) => {\\n // Index pages are special cased to allow site maps and sectional nav.\\n if (file.localName.endsWith('/index.html')) {\\n parsers.loadTemplate('map', {\\n map: siteIndex.map,\\n }).then((response) => {\\n parsers.loadTemplate('index', {\\n page: {\\n content: file.html,\\n sidebar: '',\\n title: file.title,\\n map: response,\\n tags: siteIndex.tags,\\n },\\n });\\n }).then((response) => {\\n parsers.loadTemplate('html', {\\n page: response,\\n });\\n }).then((fullResponse) => {\\n fileHandlers.outputFile(siteConfig, file, fullResponse);\\n });\\n } else {\\n // All other pages go on through (at least for now).\\n parsers.loadTemplate('page', {\\n page: {\\n content: file.html,\\n sidebar: '',\\n title: file.title,\\n },\\n }).then((response) => {\\n parsers.loadTemplate('html', {\\n page: response,\\n }).then((fullResponse) => {\\n fileHandlers.outputFile(siteConfig, file, fullResponse);\\n });\\n });\\n }\\n });\\n\\n // Copy supporting files.\\n fileHandlers.copyHandler(siteConfig);\\n}\",\n \"function init() {\\n fse\\n .readJson('./site.json')\\n .then(function(site) {\\n // if the destination dir exists\\n if (fse.pathExistsSync(config.baseDir)) {\\n // clean it out before writing files\\n fse.emptyDirSync(config.baseDir);\\n } else {\\n // ensure the destination dir exists\\n fse.ensureDirSync(config.baseDir);\\n }\\n\\n // copy assets in `/media`\\n copyDirectory(config.mediaRoot, config.baseDir);\\n // builds the CSS and JS bundles\\n buildBundles(site.bundles);\\n // generates the pages\\n buildPages(site.pages);\\n // clean up\\n removeJSBundles();\\n })\\n .catch(function(err) {\\n console.error('Error thrown while loading JSON', err);\\n });\\n}\",\n \"function pages() {\\n return gulp.src(PATHS.srcPages)\\n .pipe(panini({\\n root: 'src/pages/',\\n layouts: 'src/layouts/',\\n partials: 'src/partials/',\\n data: 'src/data/',\\n helpers: 'src/helpers/'\\n }))\\n .pipe(gulp.dest(PATHS.dist));\\n}\",\n \"function build_site_obj(){\\n\\t\\t\\tvar nav = {};\\n\\t\\t\\tfor (var page_key in sitemap.pages) {\\n\\t\\t\\t\\t//apply defaults were needed\\n\\t\\t\\t\\tsitemap.pages[page_key].nav_key = page_key;\\n\\t\\t\\t\\t//note extend will not work here, for some reason it'll alter the ref of defaults\\n\\t\\t\\t\\t//we'll have to do it by hand for the moment\\n\\t\\t\\t\\tfor (var objKey in defaults){\\n\\t\\t\\t\\t\\tif(typeof sitemap.pages[page_key][objKey] === \\\"undefined\\\"){\\n\\t\\t\\t\\t\\t\\tsitemap.pages[page_key][objKey] = defaults[objKey];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//build nav\\n\\t\\t\\t\\tvar pagenav = sitemap.pages[page_key].nav!==undefined ? sitemap.pages[page_key].nav:{};\\n\\t\\t\\t\\tif(pagenav!==false){\\n\\t\\t\\t\\t\\tvar tmpobj={};\\n\\t\\t\\t\\t\\tvar root = sitemap.pages[page_key].nav_root.replace(new RegExp(\\\"[\\\\/]+$\\\", \\\"g\\\"), \\\"\\\");\\n\\n\\t\\t\\t\\t\\tvar linkTitle = sitemap.pages[page_key].title;\\n\\t\\t\\t\\t\\tif(typeof pagenav.nav_title !== \\\"undefined\\\" ){\\n\\t\\t\\t\\t\\t\\tlinkTitle = pagenav.nav_title;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(typeof pagenav.parent !== \\\"undefined\\\" && typeof nav[pagenav.parent] !== \\\"undefined\\\" ){\\n\\t\\t\\t\\t\\t\\tvar pnav = nav[pagenav.parent];\\n\\t\\t\\t\\t\\t\\tvar exnav = {};\\n\\t\\t\\t\\t\\t\\tvar exurl = linkTitle;\\n\\t\\t\\t\\t\\t\\tif(typeof pagenav.nav_link !== \\\"undefined\\\" ){\\n\\t\\t\\t\\t\\t\\t\\texurl=pagenav.nav_link;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\texurl=root+\\\"/\\\"+sitemap.pages[page_key].nav_key+\\\".html\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\texnav[linkTitle] = exurl;\\n\\n\\t\\t\\t\\t\\t\\tvar tmp = {};\\n\\t\\t\\t\\t\\t\\tif(typeof pnav===\\\"object\\\"){\\n\\t\\t\\t\\t\\t\\t\\ttmp=extend(pnav,exnav);\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\ttmp[pagenav.parent]=pnav;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\texnav = extend(tmp,exnav);\\n\\t\\t\\t\\t\\t\\tnav[pagenav.parent] = exnav;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tif(typeof pagenav.nav_link !== \\\"undefined\\\" ){\\n\\t\\t\\t\\t\\t\\t\\ttmpobj[linkTitle]=pagenav.nav_link;\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\ttmpobj[linkTitle]=root+\\\"/\\\"+sitemap.pages[page_key].nav_key+\\\".html\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(typeof pagenav.child_nav !== \\\"undefined\\\"){\\n\\t\\t\\t\\t\\t\\tvar r = tmpobj[linkTitle];\\n\\t\\t\\t\\t\\t\\tvar navarray = {};\\n\\n\\t\\t\\t\\t\\t\\tvar mainlink= sitemap.pages[page_key].title;\\n\\t\\t\\t\\t\\t\\tif(typeof pagenav.nav_title !== \\\"undefined\\\" ){\\n\\t\\t\\t\\t\\t\\t\\tmainlink = pagenav.nav_title;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnavarray[mainlink] = r;\\n\\t\\t\\t\\t\\t\\tfor (var link in pagenav.child_nav){\\n\\t\\t\\t\\t\\t\\t\\tvar url = link;\\n\\t\\t\\t\\t\\t\\t\\tvar title = pagenav.child_nav[link];\\n\\t\\t\\t\\t\\t\\t\\tif(link.indexOf(\\\"#\\\")===0){\\n\\t\\t\\t\\t\\t\\t\\t\\turl=r+link;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tnavarray[title] = url;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\ttmpobj[linkTitle]=navarray;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnav = extend(nav,tmpobj);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsitemap.nav = nav;\\n\\t\\t}\",\n \"function buildPage() {\\n // Set the title with the location name at the first\\n // Gets the title element so it can be worked with\\n let pageTitle = document.querySelector('#page-title');\\n // Create a text node containing the full name\\n let fullNameNode = document.createTextNode(sessStore.getItem('fullName'));\\n // inserts the fullName value before any other content that might exist\\n pageTitle.insertBefore(fullNameNode, pageTitle.childNodes[0]);\\n // When this is done the title should look like this:\\n // Soda Springs, Idaho | mybetterweather.com\\n }\",\n \"function renderPost(post, site) {\\n //take the tags plugin, filter off properties that is not functions, then return an array of functions because showdown needs an array\\n var converter = new _marked.Converter({tables: true, extensions: Object.keys(_tags).filter(function (key) {\\n var black_list = ['post', 'site'];\\n\\n return black_list.indexOf(key) === -1;\\n }).map(function (key) {\\n return _tags[key];\\n })}),\\n path;\\n\\n //before we convert markdown, we need to init our extensions to the current post\\n _tags.post = post;\\n _tags.site = site;\\n\\n post.body = post.content;\\n\\n //before templating, we need to convert the body into html\\n post.body = converter.makeHtml(post.body);\\n\\n //check tags to ensure got plugins\\n getTags(post.body).forEach(function (tag) {\\n //if a tag do not have plugin we notify\\n if (_tags[tag.name] === undefined) {\\n console.error('Tag plugin not found: ' + tag.name + ' ' + post.slug);\\n }\\n });\\n\\n post.is_post = true;\\n post.is_home = false;\\n\\n getRelated(site, post);\\n\\n //Convert markdown to html\\n path = _path.join(post.folder, '/_theme/_post.ejs');\\n\\n //if there is a _post.ejs in site/_theme we use it, otherwise we default to octa/_theme/_post.ejs\\n return _fs.pathExists(path).then(function (exists) {\\n if (!exists) { path = _path.join(cwd, '/_theme/_post.ejs'); }\\n\\n return _ejs.renderFile(path, {data: post, site: site, helper: _helper})\\n .then(function (str) { return syncFile(str, _path.join(post.output, 'index' + config.extension)); });\\n });\\n\\n function getTags(content) {\\n var str = content,\\n close_regex = /\\\\{% (\\\\w+)(.*?)%\\\\}\\\\n(.*?)\\\\n\\\\{% end\\\\1 %\\\\}\\\\n/gs,\\n tag_regex = /(?:<p>)?\\\\{% (\\\\w+) (.*?)%\\\\}(?:<p>)?/g,\\n tags = [],\\n matches;\\n\\n //for closing tags, we get the content\\n while (matches = close_regex.exec(content)) {\\n tags.push({name: matches[1]});\\n\\n //tags.push({name: matches[1], content: matches[3], args: getArgs(matches[2]), body: matches[0]});\\n\\n str = str.replace(matches[0], '');\\n }\\n\\n //for non closing tags, we do not care about content\\n while (matches = tag_regex.exec(str)) {\\n tags.push({name: matches[1]});\\n //tags.push({name: matches[1], args: getArgs(matches[2]), body: matches[0]});\\n }\\n\\n return tags;\\n }\\n\\n function getRelated(site, post) {\\n var i = 0;\\n\\n post.related = [];\\n\\n //for each of the sorted post, find if they contain any tags in the current post\\n for (; i < site.sorted.length; i++) {\\n //do not check own self\\n if (post.slug !== site.posts[site.sorted[i]].slug && exist(post.tags, site.posts[site.sorted[i]].tags)) {\\n post.related.push(site.posts[site.sorted[i]]);\\n if (post.related.length >= 3) { break; }\\n }\\n }\\n\\n //if after finding all the tags, and related is still not length === 3, we insert the latest post\\n if (post.related.length < 3) {\\n i = 0;\\n do {\\n if (post.slug !== site.posts[site.sorted[i]].slug) {\\n post.related.push(site.posts[site.sorted[i]]);\\n }\\n i++;\\n } while (post.related.length < 3 && i < site.sorted.length);\\n }\\n\\n function exist(needles, haystack) {\\n return (needles || []).some(function (needle) { return (haystack || []).indexOf(needle) >= 0; });\\n }\\n }\\n }\",\n \"function createIndexHTML() {\\n const distPath = path.join(__dirname, '..', 'dist')\\n fs.stat(distPath, (err) => {\\n if (!err) {\\n writeIndexContents()\\n } else {\\n fs.mkdir(distPath, (err) => {\\n if (err) {\\n console.log('ERROR: mkdir failed' + err)\\n } else {\\n writeIndexContents()\\n }\\n })\\n }\\n })\\n}\",\n \"async function createSitemap() {\\n\\n const response = await axios.get(\\\"https://blog.gibkii-kamen.kz/api/blog\\\");\\n const posts = response.data\\n console.log(posts)\\n // write the sitemap.xml file\\n // directory MUST be `out/`\\n await fs.writeFileSync(\\\"out/sitemap.xml\\\", generateSiteMap(posts));\\n}\",\n \"function doBuildReadme() {\\n process.stdout.write('Building README.md\\\\n');\\n var readmeBuf = fs.readFileSync(__dirname + '/README.md.hbs');\\n var readmeTemplate = Handlebars.compile(readmeBuf.toString());\\n // Collect all example files as `[{ title: '', 'content: '' }, ...]`\\n var examples = fs.readdirSync(__dirname + '/examples')\\n // match only js files\\n .filter(function (filePath) {\\n return filePath.match(/\\\\.js$/);\\n })\\n // convert file paths into template objects\\n .reduce(function (list, filePath) {\\n var mtch = filePath.match(/^(.*)\\\\.js$/);\\n if (mtch && mtch[1]) {\\n list.push({\\n // title is extracted from file name\\n title: mtch[1].replace(/_/g, ' '),\\n // read file contents into buffer\\n content: fs.readFileSync(path.resolve(__dirname + '/examples', filePath))\\n });\\n }\\n return list;\\n }, []);\\n\\n var readmeBuilt = readmeTemplate({\\n examples: examples\\n });\\n\\n fs.writeFileSync(__dirname + '/../README.md', readmeBuilt);\\n}\",\n \"build()\\n\\t{\\n\\t\\t// get the data from the GET HTTP from the URL and build the page\\n\\t\\tvar getParms = PageRender.readGetPrams();\\n\\t\\tvar sorter;\\n\\t\\tif (getParms.get(\\\"sort\\\") != null)\\n\\t\\t{\\n\\t\\t\\tthis.sorter = getParms.get(\\\"sort\\\");\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tthis.sorter = default_sorter;\\n\\t\\t\\tconsole.log(\\\"AcademicPublications.build did not find sorter, using default\\\");\\n\\t\\t}\\n\\n\\t\\tvar filter;\\n\\t\\tif (getParms.get(\\\"filter\\\") != null)\\n\\t\\t{\\n\\t\\t\\tfilter = getParms.get(\\\"filter\\\");\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tfilter = default_filter;\\n\\t\\t\\tconsole.log(\\\"AcademicPublications.build did not find filter, using default\\\");\\n\\t\\t}\\n\\n\\t\\t// build the page itself\\n\\t\\tthis.buildHeader(this.sorter, filter);\\n\\t\\tthis.buildBody(this.sorter, filter);\\n\\n\\t\\taddCollapseFunction();\\n\\t}\",\n \"async onPostBuild({ constants, inputs, utils }) {\\n console.log('Replacing on-page images with Cloudinary URLs...');\\n\\n const host = process.env.DEPLOY_PRIME_URL || process.env.NETLIFY_HOST;\\n\\n if ( !host ) {\\n console.warn(ERROR_NETLIFY_HOST_UNKNOWN);\\n console.log(EEROR_NETLIFY_HOST_CLI_SUPPORT);\\n return;\\n }\\n\\n const { PUBLISH_DIR } = constants;\\n const {\\n deliveryType,\\n loadingStrategy,\\n uploadPreset,\\n folder = process.env.SITE_NAME\\n } = inputs;\\n\\n const cloudName = process.env.CLOUDINARY_CLOUD_NAME || inputs.cloudName;\\n const apiKey = process.env.CLOUDINARY_API_KEY;\\n const apiSecret = process.env.CLOUDINARY_API_SECRET;\\n\\n if ( !cloudName ) {\\n utils.build.failBuild(ERROR_CLOUD_NAME_REQUIRED);\\n return;\\n }\\n\\n configureCloudinary({\\n cloudName,\\n apiKey,\\n apiSecret\\n });\\n\\n // Find all HTML source files in the publish directory\\n\\n const pages = glob.sync(`${PUBLISH_DIR}/**/*.html`);\\n\\n const results = await Promise.all(pages.map(async page => {\\n const sourceHtml = await fs.readFile(page, 'utf-8');\\n\\n const { html, errors } = await updateHtmlImagesToCloudinary(sourceHtml, {\\n assets: _cloudinaryAssets,\\n deliveryType,\\n uploadPreset,\\n folder,\\n localDir: PUBLISH_DIR,\\n remoteHost: host\\n });\\n\\n await fs.writeFile(page, html);\\n\\n return {\\n page,\\n errors\\n }\\n }));\\n\\n const errors = results.filter(({ errors }) => errors.length > 0);\\n\\n if ( errors.length > 0) {\\n console.log(`Done with ${errors.length} errors...`);\\n console.log(JSON.stringify(errors, null, 2));\\n } else {\\n console.log('Done.');\\n }\\n }\",\n \"function buildWebsiteOnStartup() {\\n populateDropdown();\\n d3.json(\\\"samples.json\\\").then(data => {\\n buildCharts(data.names[0]);\\n populateDemographicInfo(data.names[0]);\\n })\\n}\",\n \"function pages() {\\n\\n return gulp.src('email/src/pages/**/*.html')\\n .pipe(panini({\\n data: 'email/src/data',\\n root: 'email/src/pages',\\n layouts: 'email/src/layouts',\\n partials: 'email/src/partials',\\n helpers: 'email/src/helpers',\\n }))\\n .pipe(inky())\\n .pipe(gulp.dest('email/dist'));\\n}\",\n \"function pages(done) {\\n gulp.src('./src/templates/**/*.html')\\n .pipe(router({\\n path: './dist/assets/js/routes.js',\\n root: 'src'\\n }))\\n .pipe(gulp.dest(PATHS.dist + '/templates'))\\n done();\\n }\",\n \"function buildHtml() {\\n // NOTE: sri-hash expects to find asset files referenced by the source HTML files either relative\\n // to the file's base Vinyl attribute (which is typically the glob base, see here:\\n // https://gulpjs.com/docs/en/api/concepts#glob-base) or relative to the directory containing the\\n // HTML file.\\n //\\n // Neither of these work if we're piping HTML files located in the src directory directly into\\n // sri-hash because the assets (CSS and JS files) referenced by those HTML files aren't fully\\n // realized until they have been built and written to the dist directory. No amount of config can\\n // get sri-hash to load the built assets from the dist directory if the HTML file it's currently\\n // processing has a Vinyl path located under the src directory.\\n //\\n // Instead, we pipe the HTML files directly to dest, which writes them to dist and updates their\\n // path attributes. We then call sri-hash to update the HTML files with the add the integrity\\n // attributes. Finally, we write the new HTML file contents to disk.\\n return gulp.src('./src/index.html')\\n .pipe(gulp.dest('./dist'))\\n .pipe(sriHash())\\n .pipe(gulp.dest('./dist'));\\n}\",\n \"function build_page() {\\n\\n\\t// set font & colors\\n\\tvar body = document.getElementById(\\\"background\\\");\\n\\tbody.style.fontFamily = font;\\n\\tbody.style.backgroundColor = background_color;\\n\\tbody.style.color = foreground_color;\\n\\n\\t// create the pages or link containers for each\\n\\t// array element in the pages array\\n\\tvar num_pages = pages.length;\\n\\tfor(var i = 0; i < num_pages; i++) {\\n\\t\\t// make the first page visible, all others hidden\\n\\t\\tvar hidden = (i == 0) ? false : true;\\n\\t\\tbody.appendChild(generate_link_container(hidden));\\n\\t}\\n\\n\\t// for each page or 'container', populate corresponding links & titles\\n\\tvar containers = document.getElementsByClassName(\\\"links-container\\\");\\n\\tfor(var i = 0; i < containers.length; i++) {\\n\\t\\tpages[i].forEach(link => {\\n\\t\\t\\tcontainers[i].appendChild(generate_link_element(link));\\n\\t\\t});\\n\\t}\\n\\n\\t// finally create the adequate number of 'select page' buttons\\n\\tvar navigation_container = document.getElementById(\\\"navigation\\\");\\n\\tfor(var i = 1; i <= num_pages; i++) {\\n\\t\\t// apply 'selected' css class to first nav button\\n\\t\\tvar selected = (i == 1) ? true : false;\\n\\t\\tnavigation_container.appendChild(generate_navigation_button(i, selected));\\n\\t}\\n}\",\n \"function html() {\\n const plugins = [...pluguin_html];\\n\\n return gulp.src(paths.html.src)\\n .pipe(panini({\\n root: 'src/pages/',\\n layouts: 'src/layouts/',\\n partials: 'src/partials/',\\n data: 'src/data'\\n }))\\n .pipe(posthtml(plugins))\\n .pipe(gulp.dest(directory));\\n}\",\n \"function publish(symbolSet) {\\n\\tpublish.conf = {\\t// trailing slash expected for dirs\\n\\t\\tname:\\t\\t\\t\\t\\\"neo-jsdoctpl-bootstrap\\\",\\n\\t\\tversion:\\t\\t \\\"0.0\\\",\\n\\t\\text:\\t\\t\\t\\t \\\".html\\\",\\n\\t\\toutDir:\\t\\t\\tJSDOC.opt.d || SYS.pwd+\\\"../out/jsdoc/\\\",\\n\\t\\ttemplatesDir: JSDOC.opt.t || SYS.pwd+\\\"../templates/jsdoc/\\\",\\n\\t\\tsymbolsDir:\\t\\\"symbols/\\\",\\n\\t\\tsrcDir:\\t\\t\\t\\\"symbols/src/\\\"\\n\\t};\\n\\t\\n // overwrite to a better Link module\\n eval(include('extends/Link.js'));\\n\\n\\t// is source output is suppressed, just display the links to the source file\\n\\tif (JSDOC.opt.s && defined(Link) && Link.prototype._makeSrcLink) {\\n\\t\\tLink.prototype._makeSrcLink = function(srcFilePath) {\\n\\t\\t\\treturn \\\"<\\\"+srcFilePath+\\\">\\\";\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// create the folders and subfolders to hold the output\\n\\tIO.mkPath((publish.conf.outDir+\\\"symbols/src\\\").split(\\\"/\\\"));\\n\\tIO.mkPath((publish.conf.outDir+\\\"js\\\").split(\\\"/\\\"));\\n\\tIO.mkPath((publish.conf.outDir+\\\"css\\\").split(\\\"/\\\"));\\n\\tIO.mkPath((publish.conf.outDir+\\\"img\\\").split(\\\"/\\\"));\\n\\t\\t\\n\\t// used to allow Link to check the details of things being linked to\\n\\tLink.symbolSet = symbolSet;\\n\\n\\t// create the required templates\\n\\ttry {\\n\\t\\tvar classTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\\\"class.tmpl\\\");\\n\\t\\tvar classesTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\\\"allclasses.tmpl\\\");\\n\\t\\tvar sourceTemplate =\\tnew JSDOC.JsPlate(publish.conf.templatesDir+\\\"source.tmpl\\\");\\n\\t}\\n\\tcatch(e) {\\n\\t\\tprint(\\\"Couldn't create the required templates: \\\"+e);\\n\\t\\tquit();\\n\\t}\\n\\t\\n\\t// some ustility filters\\n\\tfunction hasNoParent($) {return ($.memberOf == \\\"\\\")}\\n\\tfunction isaFile($) {return ($.is(\\\"FILE\\\"))}\\n\\tfunction isaClass($) {return ($.is(\\\"CONSTRUCTOR\\\") || $.isNamespace)}\\n\\t\\n\\t// get an array version of the symbolset, useful for filtering\\n\\tvar symbols = symbolSet.toArray();\\n\\t\\n\\t\\t\\n\\t\\t// get a list of all the classes in the symbolset\\n\\t\\tvar classes = smartSort(symbols.filter(isaClass));\\n\\t\\n\\t// create a filemap in which outfiles must be to be named uniquely, ignoring case\\n\\tif (JSDOC.opt.u) {\\n\\t\\tvar filemapCounts = {};\\n\\t\\tLink.filemap = {};\\n\\t\\tfor (var i = 0, l = classes.length; i < l; i++) {\\n\\t\\t\\tvar lcAlias = classes[i].alias.toLowerCase();\\n\\t\\t\\t\\n\\t\\t\\tif (!filemapCounts[lcAlias]) filemapCounts[lcAlias] = 1;\\n\\t\\t\\telse filemapCounts[lcAlias]++;\\n\\t\\t\\t\\n\\t\\t\\tLink.filemap[classes[i].alias] = \\n\\t\\t\\t\\t(filemapCounts[lcAlias] > 1)?\\n\\t\\t\\t\\tlcAlias+\\\"_\\\"+filemapCounts[lcAlias] : lcAlias;\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// create a class index, displayed in the left-hand column of every class page\\n\\tLink.base = \\\"../\\\";\\n\\t\\tpublish.classesIndex = classesTemplate.process(classes); // kept in memory\\n\\t\\n\\t// create each of the class pages\\n\\tfor (var i = 0, l = classes.length; i < l; i++) {\\n\\t\\tvar symbol = classes[i];\\n\\t\\t\\n\\t\\tsymbol.events = symbol.getEvents();\\t // 1 order matters\\n\\t\\tsymbol.methods = symbol.getMethods(); // 2\\n\\t\\t\\n\\t\\tLink.currentSymbol= symbol;\\n\\t\\tvar output = \\\"\\\";\\n\\t\\toutput = classTemplate.process(symbol);\\n\\t\\t\\n\\t\\tIO.saveFile(publish.conf.outDir+\\\"symbols/\\\", ((JSDOC.opt.u)? Link.filemap[symbol.alias] : symbol.alias) + publish.conf.ext, output);\\n\\t}\\n\\n\\t// create the source code files\\n\\tLink.base = \\\"../../\\\";\\n\\tpublish.classesIndex = classesTemplate.process(classes); // kept in memory\\n\\tvar files = JSDOC.opt.srcFiles;\\n\\t\\tfor (var i = 0, l = files.length; i < l; i++) {\\n\\t\\t\\tvar file = files[i];\\n\\t\\t\\tvar srcDir = publish.conf.outDir + \\\"symbols/src/\\\";\\n\\t\\t\\tvar name = file.replace(/\\\\.\\\\.?[\\\\\\\\\\\\/]/g, \\\"\\\").replace(/[\\\\\\\\\\\\/]/g, \\\"_\\\");\\n\\t\\t\\tname = name.replace(/\\\\:/g, \\\"_\\\");\\n\\t\\t\\tvar output = \\\"\\\";\\n\\t\\t\\toutput = sourceTemplate.process({ file: file, source: escapeHTML(IO.readFile(file)) });\\n\\t\\t\\t\\n\\t\\t\\tIO.saveFile(srcDir, name + publish.conf.ext, output);\\n\\t\\t}\\n\\t\\n\\t// regenerate the index with different relative links, used in the index pages\\n\\tLink.base = \\\"\\\";\\n\\tpublish.classesIndex = classesTemplate.process(classes);\\n\\t\\n\\t// create the class index page\\n\\ttry {\\n\\t\\tvar classesindexTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\\\"index.tmpl\\\");\\n\\t}\\n\\tcatch(e) { print(e.message); quit(); }\\n\\t\\n\\tvar classesIndex = classesindexTemplate.process(classes);\\n\\tIO.saveFile(publish.conf.outDir, \\\"index\\\"+publish.conf.ext, classesIndex);\\n\\tclassesindexTemplate = classesIndex = classes = null;\\n\\t\\n\\t// create the file index page\\n\\ttry {\\n\\t\\tvar fileindexTemplate = new JSDOC.JsPlate(publish.conf.templatesDir+\\\"allfiles.tmpl\\\");\\n\\t}\\n\\tcatch(e) { print(e.message); quit(); }\\n\\t\\n\\tvar documentedFiles = symbols.filter(isaFile); // files that have file-level docs\\n\\tvar allFiles = []; // not all files have file-level docs, but we need to list every one\\n\\t\\n\\tfor (var i = 0; i < files.length; i++) {\\n\\t\\tallFiles.push(new JSDOC.Symbol(files[i], [], \\\"FILE\\\", new JSDOC.DocComment(\\\"/** */\\\")));\\n\\t}\\n\\t\\n\\tfor (var i = 0; i < documentedFiles.length; i++) {\\n\\t\\tvar offset = files.indexOf(documentedFiles[i].alias);\\n\\t\\tallFiles[offset] = documentedFiles[i];\\n\\t}\\n\\t\\t\\n\\tallFiles = allFiles.sort(makeSortby(\\\"name\\\"));\\n\\n\\t// output the file index page\\n\\tvar filesIndex = fileindexTemplate.process(allFiles);\\n\\tIO.saveFile(publish.conf.outDir, \\\"files\\\"+publish.conf.ext, filesIndex);\\n\\tfileindexTemplate = filesIndex = files = null;\\n\\n\\t// Twitter Bootstrap\\n\\tvar dstDir;\\n\\n\\tvar jsPaths = [\\n 'jquery-1.7.2.min.js',\\n 'accordion.js',\\n 'bootstrap/js/bootstrap.min.js',\\n 'google-code-prettify/prettify.js'\\n\\t\\t];\\n\\tvar numOfJsPaths = jsPaths.length;\\n\\tvar jsPath;\\n\\n\\tdstDir = publish.conf.outDir + 'js/';\\n\\tfor (var i = 0; i < numOfJsPaths; i++) {\\n\\t\\tjsPath = jsPaths[i];\\n\\t\\tIO.copyFile(publish.conf.templatesDir + 'static/' + jsPath, dstDir);\\n\\t}\\n\\n\\tvar cssPaths = [\\n\\t\\t\\t'common.css',\\n\\t\\t\\t'bootstrap/css/bootstrap.min.css',\\n\\t\\t\\t'bootstrap/css/bootstrap-responsive.min.css',\\n\\t\\t\\t'google-code-prettify/prettify.css',\\n\\t\\t\\t'print.css'\\n\\t\\t];\\n\\tvar numOfCssPaths = cssPaths.length;\\n\\tvar cssPath;\\n\\t\\n\\tdstDir = publish.conf.outDir + 'css/';\\n\\tfor (var i = 0; i < numOfCssPaths; i++) {\\n\\t\\tcssPath = cssPaths[i];\\n\\t\\tIO.copyFile(publish.conf.templatesDir + 'static/' + cssPath, dstDir);\\n\\t}\\n\\n\\tvar imgPaths = [\\n\\t\\t\\t'bootstrap/img/glyphicons-halflings-white.png',\\n\\t\\t\\t'bootstrap/img/glyphicons-halflings.png',\\n\\t\\t\\t'img/classicons.png',\\n\\t\\t\\t'img/class.png',\\n\\t\\t\\t'img/interface.png',\\n\\t\\t\\t'img/namespace.png'\\n\\t\\t];\\n\\tvar numOfImgPaths = imgPaths.length;\\n\\tvar imgPath;\\n\\t\\n\\tdstDir = publish.conf.outDir + 'img/';\\n\\tfor (var i = 0; i < numOfImgPaths; i++) {\\n\\t\\timgPath = imgPaths[i];\\n\\t\\tIO.copyFile(publish.conf.templatesDir + 'static/' + imgPath, dstDir);\\n\\t}\\n}\",\n \"function buildTemplate() {\\n\\t\\tpageTitle = new C_PageTitle();\\n\\n //Add classes for page layouts - updatable in css\\n $('#stage').append('<div id=\\\"content\\\" class=\\\"lessonCon\\\"></div>');\\n\\n $(\\\"#content\\\").append(myContent);\\n\\t\\t\\n\\t\\taudioHolder = new C_AudioHolder();\\n\\t\\t \\n if(transition == true){\\n\\t\\t\\t// fade stage in\\n\\t\\t\\t$('#stage').velocity({\\n\\t\\t\\t\\topacity: 1\\n\\t\\t\\t}, {\\n\\t\\t\\t\\tduration: transitionLength,\\n\\t\\t\\t\\tcomplete: checkMode\\n\\t\\t\\t});\\n }else{\\n \\tcheckMode();\\n }\\n }\",\n \"function createSite(refInfo) {\\n let url = parseUrl(refInfo.referer);\\n let site = {\\n 'domain': url.hostname,\\n 'page': url.protocol + '://' + url.hostname + url.pathname\\n };\\n if (self === top && document.referrer) {\\n site.ref = document.referrer;\\n }\\n let keywords = document.getElementsByTagName('meta')['keywords'];\\n if (keywords && keywords.content) {\\n site.keywords = keywords.content;\\n }\\n return site;\\n}\",\n \"async function template() {\\n\\tlet assets_location = isWatch ? '' : MY_CDN;\\n\\tlet html = await read(TEMPLATE, 'utf8');\\n\\n\\t// Always remove _INJECT_ vars\\n\\thtml = html.replace(/_INJECT_(HEAD|BODY)_/g, '');\\n\\t// local development uses \\\"/\\\" else CDN\\n\\thtml = html.replace(/_CDN_BUCKET_/g, assets_location);\\n\\n\\t// the \\\"public\\\" dir already exists\\n\\tlet file = join(__dirname, '..', 'public', 'index.html');\\n\\tawait write(file, html, 'utf8');\\n\\tconsole.log('~> wrote \\\"public/index.html\\\" with values');\\n}\",\n \"function setup() {\\n Object.keys(options).forEach(function(key) {\\n context[key] = options[key];\\n });\\n if(!context.username || !context.repo) {\\n return console.error(\\\"No username/repo provided for gh-weblog.\\\");\\n }\\n window.nunjucksEnv = new nunjucks.Environment(new nunjucks.WebLoader(context.path + 'views'));\\n nunjucksEnv.addFilter(\\\"cleanHTML\\\", function(data) {\\n return data.replace(/</g, '<').replace(/>/g, '>');\\n });\\n nunjucksEnv.addFilter(\\\"readableDate\\\", function(data) {\\n return (new Date(data)).toLocaleString();\\n });\\n nunjucksEnv.addFilter(\\\"shortDate\\\", function(data) {\\n return (new Date(data)).toLocaleDateString();\\n });\\n nunjucksEnv.render(\\\"container.html\\\", {}, function(err, result) {\\n if(err) { return console.error(\\\"Nunjucks render error\\\", err); }\\n var container = document.querySelector(\\\"#gh-weblog-container\\\");\\n container.innerHTML = result;\\n cue(buildPage);\\n });\\n }\",\n \"prepareForDocSite() {\\n if (this.prepared_) {\\n return;\\n }\\n\\n let { stringContents: contents } = this;\\n\\n contents = this.uncommentMetadata_(contents);\\n contents = this.uncommentJekyllSpecifics_(contents);\\n contents = this.transformListItemStyles_(contents);\\n contents = this.transformWithoutCodeBlocks_(contents, (c) => this.templatizeLocalLinks_(c));\\n this.stringContents = contents;\\n\\n this.prepareMetadata_();\\n this.prepared_ = true;\\n }\",\n \"function build () {\\n var env = new nunjucks.Environment(new nunjucks.FileSystemLoader(), {\\n noCache: true\\n });\\n /***\\n * Nunjucks Filters\\n *\\n * Additional filters built into Nunjucks to help generate the styleguide.\\n */\\n require('./nunjucksFilters/dump')(env);\\n require('./nunjucksFilters/split')(env);\\n require('./nunjucksFilters/join')(env);\\n require('./nunjucksFilters/markdown')(env);\\n require('./nunjucksFilters/luminance')(env);\\n require('./nunjucksFilters/addModifier')(env);\\n require('./nunjucksFilters/contains')(env);\\n require('./nunjucksFilters/wrap')(env);\\n require('./nunjucksFilters/colors')(env);\\n require('./nunjucksFilters/highlightSyntax')(env);\\n\\n return env;\\n}\",\n \"function pugHtml() {\\n return src('src/pug/pages/*.pug')\\n .pipe(\\n pug({\\n pretty: true,\\n })\\n )\\n .pipe(dest('dist'));\\n}\",\n \"function buildTemplatesRuntime() {\\n esbuild.build({\\n ...commonOptions,\\n outdir: htmlOutDir,\\n entryPoints: ['node_modules/handlebars/dist/handlebars.runtime.js'],\\n bundle: false,\\n }).catch(() => process.exit(1))\\n}\",\n \"function buildSiteCSS() {\\n\\treturn gulp.src('site/src/less/site.less')\\n\\t\\t.pipe(less())\\n\\t\\t.pipe(gulp.dest('site/public/build/css'))\\n\\t\\t.pipe(connect.reload());\\n}\",\n \"function generateCategoryPostsIndex(graphql, createPage){\\n\\n let prArray = [] //the promise array\\n BC.forEach((blog) =>{\\n let blogPath = `${__dirname}/src/pages/${blog.path}/`\\n let filePath = `${blogPath}categories/index.md`\\n\\n let task = graphql(`\\n {\\n allMarkdownRemark(\\n filter: {\\n fileAbsolutePath: {regex: \\\"${blogPath}/\\\"}\\n frontmatter:{\\n published: {eq : true}\\n type: {ne: \\\"page\\\"}\\n categories: {ne: null}\\n }\\n }\\n ){\\n group(field:frontmatter___categories){\\n totalCount\\n fieldValue\\n }\\n }\\n }\\n `)\\n .then(result => {\\n // if no posts with categories\\n if(!result.data.allMarkdownRemark){\\n return \\\"\\\"\\n }\\n let categories = result.data.allMarkdownRemark.group\\n let layout = \\\"category-posts-index.js\\\"\\n let postsPerPage = 3\\n\\n categories.forEach(category => { //paginate each category\\n let slug = `/${blog.path}/categories/${slugify(category.fieldValue)}/`\\n let numPages = Math.ceil(category.totalCount/ postsPerPage)\\n Array.from({ length: numPages }).forEach((_, i) => {\\n createPage({\\n path: i === 0 ? slug : `${slug}${i + 1}`,\\n component: path.resolve(`./src/templates/${layout}`),\\n context: {\\n limit: postsPerPage,\\n skip: i * postsPerPage,\\n blogPath: blogPath+'/',\\n category: category.fieldValue,\\n totalPages: numPages\\n },\\n })\\n })\\n })\\n\\n })\\n\\n prArray.push(task)\\n })\\n\\n return Promise.all(prArray)\\n\\n//Query the siteMetadata for the blogs, and for each blog -\\n\\n // query all the markdown files in the sub folders\\n // with render!=false, publish=true, type=post\\n // sort the post by date\\n // output : list of categories in the current blog with their children.\\n // similar to categories/index.js (?)\\n\\n // query for the blog/categories/cname/index.md - get it's content, frontmatter\\n // Shoud this even EXIST?\\n\\n // For each series of the current sub-blog\\n // Figure out how many pages there should be, generate the pages in a loop\\n // using (frontmatter.layout || \\\"template/categories-posts-index.js\\\")\\n // \\n\\n}\",\n \"async function main () {\\n const files = await fse.readdir(path.resolve(__dirname, 'source/_posts'))\\n\\n let posts = files.filter((file) =>\\n fse.lstatSync(path.resolve(__dirname, 'source/_posts', file)).isFile() &&\\n path.extname(file) === '.md'\\n )\\n\\n posts = await Promise.all(\\n posts.map((post) =>\\n MarkedPost.fromFile(path.resolve(__dirname, 'source/_posts', post))\\n )\\n )\\n\\n posts.sort((p1, p2) => p1.date.getTime() < p2.date.getTime() ? 1 : -1)\\n\\n const dir = path.resolve(__dirname, '../dist/api')\\n await fse.ensureDir(dir)\\n await Promise.all(\\n posts.map(async (post) => {\\n return post.save(path.resolve(dir, `articles/${post.filename}.json`))\\n })\\n )\\n\\n let tags = new Tags(posts)\\n await fse.writeFile(\\n path.resolve(dir, 'tags.json'),\\n tags.toJSON()\\n )\\n\\n await Promise.all(\\n tags.map((tag) => {\\n return tag.save(\\n path.resolve(dir, `tags/${tag.slug}.json`)\\n )\\n })\\n )\\n\\n let pages = chunk(posts, config.perPage)\\n\\n await fse.writeFile(\\n path.resolve(dir, 'posts.json'),\\n JSON.stringify({\\n pages: pages.length,\\n perPage: config.perPage,\\n posts: pages[0].map((post) => post.lean(false))\\n }\\n )\\n )\\n\\n await fse.ensureDir(path.resolve(dir, 'pages'))\\n await Promise.all(\\n pages.map((page, index) => {\\n fse.writeFile(\\n path.resolve(dir, 'pages', `${index + 1}.json`),\\n JSON.stringify({\\n page: index,\\n posts: page.map((post) => post.lean(false))\\n })\\n )\\n })\\n )\\n\\n // Other files (not _posts but also markdown files)\\n await walk(\\n path.resolve(__dirname, 'source'),\\n dir\\n )\\n\\n // atom\\n let rss = new Rss(posts, {\\n title: 'lazzzis',\\n id: URI,\\n link: URI,\\n author: {\\n name: 'lazzzis',\\n email: 'shenlijin@outlook.com',\\n link: URI\\n }\\n })\\n await rss.save(path.resolve(dir, '../atom.xml'))\\n}\",\n \"async function createBlogPostPages (graphql, actions, reporter) {\\n const { createPage } = actions\\n const result = await graphql(`\\n {\\n allSanityPost(filter: { slug: { current: { ne: null } } }) {\\n edges {\\n node {\\n id\\n publishedAt\\n slug {\\n current\\n }\\n }\\n }\\n }\\n }\\n `)\\n\\n if (result.errors) throw result.errors\\n\\n const postEdges = (result.data.allSanityPost || {}).edges || []\\n\\n postEdges.forEach((edge, index) => {\\n const { id, slug = {}, publishedAt } = edge.node\\n const dateSegment = format(legacyParse(publishedAt), convertTokens('yyyy/MM'))\\n const path = `/blog/${dateSegment}/${slug.current}/`\\n\\n reporter.info(`Creating blog post page: ${path}`)\\n\\n createPage({\\n path,\\n component: require.resolve('./src/templates/blog-post.js'),\\n context: { id }\\n })\\n })\\n}\",\n \"async function sitemap() {\\n if (!config.OPTIONS.sitemap) return;\\n\\n let publicUrl;\\n if (typeof config.OPTIONS.sitemap === \\\"string\\\")\\n publicUrl = config.OPTIONS.sitemap;\\n else if (env.raw.PUBLIC_URL) {\\n publicUrl = env.raw.PUBLIC_URL;\\n\\n // removes forward slash at the end\\n if (publicUrl.charAt(publicUrl.length - 1) === \\\"/\\\")\\n publicUrl = publicUrl.substring(0, publicUrl.length - 1);\\n }\\n\\n if (!publicUrl) {\\n logger.error(\\n `Failed to generate sitemap.xml, missing ${chalk.bold(\\n \\\"public url\\\"\\n )}.\\\\nhttps://github.com/wethegit/sweet-potato/tree/main/cooker#sitemap`\\n );\\n\\n return;\\n }\\n\\n // Get all html files\\n const htmlFiles = await getFiles(\\n path.join(config.BUILD_DIRECTORY, \\\"**\\\", \\\"*.html\\\")\\n );\\n\\n if (htmlFiles.length <= 0) {\\n logger.announce(\\n \\\"No html files found to generate sitemap, maybe this command was ran too early or you forgot to generate a build.\\\\nnpx sweet-potato-cooker build\\\"\\n );\\n return;\\n }\\n\\n logger.start(\\\"Generating sitemap\\\");\\n\\n // Creates a sitemap object given the input configuration with URLs\\n const sitemap = new SitemapStream({ hostname: publicUrl });\\n const lastmod = new Date().toISOString();\\n\\n // go throught all of them\\n for (const file of htmlFiles) {\\n const fileInfo = path.parse(file);\\n let dir = fileInfo.dir.replace(config.BUILD_DIRECTORY, \\\"\\\");\\n\\n if (dir === \\\"\\\") dir += \\\"/\\\";\\n\\n sitemap.write({ url: `${publicUrl}${dir}`, lastmod });\\n }\\n\\n sitemap.end();\\n\\n let sitemapData;\\n let finalSitemap;\\n\\n try {\\n sitemapData = await streamToPromise(sitemap);\\n finalSitemap = sitemapData.toString();\\n } catch (err) {\\n logger.error(\\\"Failed generating sitemap\\\", err);\\n }\\n\\n const dest = path.join(config.BUILD_DIRECTORY, \\\"sitemap.xml\\\");\\n const prettyPath = path.relative(config.CWD, dest);\\n\\n return fse\\n .outputFile(dest, finalSitemap)\\n .then(() => {\\n // done 🎉\\n logger.success([\\\"Compiled\\\", prettyPath]);\\n logger.finish(\\\"Generating sitemap\\\");\\n\\n return { destination: dest, sitemap: finalSitemap };\\n })\\n .catch((err) => {\\n logger.error([\\\"Failed saving sitemap file\\\", prettyPath], err);\\n });\\n}\",\n \"function buildPages() {\\n const queue = [];\\n for (const [path, page] of Object.entries(Pages)) {\\n queue.push(publish(page.el, {\\n pagePath: path,\\n pageHeading: page.el.defaultProps.pageHeading\\n }));\\n }\\n return Promise.all(queue);\\n}\",\n \"function IndexPage(props) {\\n // const siteTitle = \\\"Gatsby Starter Personal Website\\\"\\n return (\\n <>\\n <CustomLayout>\\n <div>\\n <div className=\\\"banner\\\">\\n <h1>Maanas Organisation </h1>\\n <h2>-A Psychospiritual Initiative- </h2>\\n </div>\\n\\n <div className=\\\"content-wrapper\\\">\\n <h3 className=\\\"title\\\">The Rendition of Human Mind.</h3>\\n\\n <p>\\n Hello fellow traveler. \\n Human mind is the most misunderstood and at the same time equally inquisitive phenomena, yet it is of great potential If it’s nature is correctly identified and applied to our daily life. \\n Our purpose is to creatively pursue this astonishing phenomenon and to enrich our lives and give it its deserved meaning. \\n We intend to combine the concepts of Science & Spirituality to get a better perspective of the understanding of human mind and use it in elevating our potential and consciousness.\\n </p>\\n </div>\\n </div>\\n </CustomLayout>\\n </>\\n )\\n}\",\n \"function index(req, res, next) {\\n res.render('home/home.index.pug', { \\n title: 'Template Project'\\n });\\n}\",\n \"function html() {\\n return src(['./src/views/*'])\\n .pipe(nunjucks.compile({\\n env: new njk.Environment(new njk.FileSystemLoader('./src/views'))\\n }))\\n .pipe(dest('dist/'))\\n}\",\n \"function _buildPage( opt ){\\r\\nconsole.log(\\\"_buildPage()\\\");\\r\\n\\r\\n\\tvar p = {\\r\\n\\t\\t//\\\"nid\\\": null,\\r\\n\\t\\t//\\\"templateID\\\" : \\\"tpl-page\\\"\\r\\n\\t\\t//\\\"title\\\" : \\\"\\\",\\r\\n\\t\\t//content : \\\"\\\"\\r\\n\\t\\t\\\"callback\\\": null\\r\\n\\t};\\r\\n\\t//extend options object\\r\\n\\tfor(var key in opt ){\\r\\n\\t\\tp[key] = opt[key];\\r\\n\\t}\\r\\n//console.log(p);\\r\\n\\r\\n//--------------------- BLOCK #sitename-block\\r\\n\\tdraw.buildBlock({\\r\\n\\t\\t\\\"locationID\\\" : \\\"sitename-block\\\",\\r\\n\\t\\t\\\"templateID\\\" : \\\"tpl-block--sitename\\\"//,\\r\\n\\t\\t//\\\"content\\\" : \\\"<h1><a class='title' href='./'>my lib</a></h1>\\\" \\r\\n\\t});\\r\\n//---------------------\\r\\n\\r\\n//--------------------- BLOCK\\r\\n\\t\\t\\t//view alphabetical\\r\\n\\r\\n\\t\\t\\tvar html = lib.taxonomy.view_termin({\\r\\n\\t\\t\\t\\t\\\"termins\\\": lib.vars[\\\"taxonomy\\\"][\\\"alphabetical_voc\\\"][\\\"termins\\\"],\\r\\n\\t\\t\\t\\t\\\"vid\\\": \\\"4\\\",\\r\\n\\t\\t\\t\\t\\\"tid\\\": \\\"116\\\",\\r\\n\\t\\t\\t\\t\\\"recourse\\\": true,\\r\\n\\t\\t\\t\\t\\\"show_only_children\\\": true,\\r\\n\\t\\t\\t\\t\\\"item_tpl\\\": lib.vars[\\\"templates\\\"][\\\"tpl-block--taxonomy_alpha_list\\\"],\\r\\n\\t\\t\\t\\t\\\"list_tpl\\\": lib.vars[\\\"templates\\\"][\\\"tpl-block--taxonomy_alpha\\\"]//,\\r\\n\\t\\t\\t\\t//\\\"url_tpl\\\": _vars[\\\"templates\\\"][\\\"taxonomy_url_tpl\\\"]\\r\\n\\t\\t\\t});\\r\\nconsole.log(html);\\r\\n\\t\\t\\t\\r\\n//---------------------\\r\\n\\r\\n}\",\n \"function build(done) {\\n runSequence('clean', ['html', 'htmlTemplate', 'static', 'styles', 'transpile'], done);\\n}\",\n \"_buildPageData() {\\n const parsedFilePath = path.parse(this.filePath);\\n\\n const { data, content } = matter.read(`${this.filePath}`);\\n\\n const pageData = {\\n ...data,\\n content,\\n };\\n\\n pageData.path = `/${parsedFilePath.name}.html`;\\n\\n return pageData;\\n }\",\n \"async processContent(o) {\\n let theme = await this.fs.promises.readFile(this.config.settings.THEME.POST, \\\"utf8\\\")\\n let template = Handlebars.compile(theme)\\n let rendered = template({\\n name: this.config.settings.NAME,\\n content: o.html,\\n updated: o.data.updated,\\n filename: `${this.config.settings.SRC}/${o.filename}`,\\n title: o.data.title\\n }).trim()\\n await this.fs.promises.mkdir(`${this.config.settings.DEST}/post`).catch((e) => { })\\n await this.fs.promises.mkdir(`${this.config.settings.DEST}/post/${o.filename}`).catch((e) => { })\\n await this.fs.promises.writeFile(`${this.config.settings.DEST}/post/${o.filename}/index.html`, rendered)\\n }\",\n \"function buildApp() {\\n const date = new Date();\\n let hh = date.getHours();\\n let mm = date.getMinutes();\\n let month = date.getMonth() + 1;\\n hh = hh < 10 ? '0' + hh : hh;\\n mm = mm < 10 ? '0' + mm : mm;\\n month = month < 10 ? '0' + month : month;\\n const day = `${date.getDate()}.${month}.${date.getFullYear()}`;\\n const hour = `${hh}:${mm}`;\\n $('.alert').fadeOut('slow');\\n clearInterval(addInterval);\\n $('body').empty().append(navbar).append($pageContent);\\n $pageContent.empty().append(addnew(day, hour)).css(('margin-top'), $('.navbar').outerHeight());\\n }\",\n \"async function createArticlePostPages(graphql, actions) {\\n // Get Gatsby‘s method for creating new pages\\n const { createPage } = actions\\n const PostTemplate = require.resolve('./src/templates/Post/Article/index.tsx')\\n\\n // Query Gatsby‘s GraphAPI for all the categories that come from Sanity\\n // You can query this API on http://localhost:8000/___graphql\\n const result = await graphql(`\\n {\\n allSanityPost(sort: { order: DESC, fields: publishedAt }) {\\n nodes {\\n title\\n _rawExcerpt\\n _rawBody\\n _id\\n publishedAt(formatString: \\\"MMM. DD, YYYY\\\")\\n slug {\\n current\\n }\\n tags {\\n tag\\n }\\n figure {\\n alt\\n asset {\\n fluid(maxWidth: 800) {\\n srcWebp\\n srcSetWebp\\n srcSet\\n src\\n sizes\\n base64\\n aspectRatio\\n }\\n }\\n caption\\n }\\n categories {\\n title\\n }\\n authors {\\n name\\n role\\n avatar {\\n asset {\\n fluid(maxWidth: 300) {\\n srcWebp\\n srcSetWebp\\n srcSet\\n src\\n sizes\\n base64\\n aspectRatio\\n }\\n }\\n }\\n }\\n sources {\\n title\\n url\\n }\\n }\\n }\\n }\\n `)\\n // If there are any errors in the query, cancel the build and tell us\\n if (result.errors) throw result.errors\\n // Let‘s gracefully handle if allSanityCatgogy is null\\n const postNodes = (result.data.allSanityPost || {}).nodes || []\\n\\n postNodes\\n // Loop through the category nodes, but don't return anything\\n .forEach(node => {\\n // Desctructure the id and slug fields for each category\\n const { id, slug = {} } = node\\n // If there isn't a slug, we want to do nothing\\n if (!slug) return\\n // Make the URL with the current slug\\n const path = `/articles/${slug.current}`\\n // Create the page using the URL path and the template file, and pass down the id\\n // that we can use to query for the right category in the template file\\n createPage({\\n path,\\n component: PostTemplate,\\n context: {\\n post: node\\n }\\n })\\n })\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7367393","0.6933835","0.6828492","0.66889805","0.65909195","0.64345425","0.6205691","0.61614203","0.61429024","0.60682553","0.6061803","0.6045798","0.60446155","0.60264015","0.5986318","0.59101593","0.5895866","0.58575934","0.58570063","0.580719","0.5769315","0.5719066","0.56948984","0.56781536","0.5670978","0.5648903","0.56003284","0.5595187","0.55951256","0.5577118","0.55685645","0.5540157","0.5529881","0.55256736","0.5511831","0.54756546","0.5469714","0.5468761","0.54282165","0.5416485","0.53973305","0.5388993","0.5383183","0.53828907","0.5364517","0.5347838","0.5344804","0.5341158","0.5332335","0.5320457","0.53137624","0.5299597","0.5286624","0.528581","0.52678025","0.52601373","0.5243053","0.5229221","0.52178055","0.5217099","0.52055335","0.5202901","0.5193666","0.51927936","0.5188188","0.5187794","0.5157166","0.51557255","0.51541126","0.51516485","0.51216716","0.5121405","0.5119334","0.5113991","0.50904804","0.50876373","0.507534","0.5072584","0.50710744","0.506991","0.5060521","0.5053957","0.5049969","0.50400424","0.5029955","0.50176895","0.50065374","0.500538","0.49985114","0.49959415","0.49902907","0.4986542","0.4985831","0.49837995","0.49762258","0.4964562","0.49542204","0.4950504","0.49408484","0.49149516"],"string":"[\n \"0.7367393\",\n \"0.6933835\",\n \"0.6828492\",\n \"0.66889805\",\n \"0.65909195\",\n \"0.64345425\",\n \"0.6205691\",\n \"0.61614203\",\n \"0.61429024\",\n \"0.60682553\",\n \"0.6061803\",\n \"0.6045798\",\n \"0.60446155\",\n \"0.60264015\",\n \"0.5986318\",\n \"0.59101593\",\n \"0.5895866\",\n \"0.58575934\",\n \"0.58570063\",\n \"0.580719\",\n \"0.5769315\",\n \"0.5719066\",\n \"0.56948984\",\n \"0.56781536\",\n \"0.5670978\",\n \"0.5648903\",\n \"0.56003284\",\n \"0.5595187\",\n \"0.55951256\",\n \"0.5577118\",\n \"0.55685645\",\n \"0.5540157\",\n \"0.5529881\",\n \"0.55256736\",\n \"0.5511831\",\n \"0.54756546\",\n \"0.5469714\",\n \"0.5468761\",\n \"0.54282165\",\n \"0.5416485\",\n \"0.53973305\",\n \"0.5388993\",\n \"0.5383183\",\n \"0.53828907\",\n \"0.5364517\",\n \"0.5347838\",\n \"0.5344804\",\n \"0.5341158\",\n \"0.5332335\",\n \"0.5320457\",\n \"0.53137624\",\n \"0.5299597\",\n \"0.5286624\",\n \"0.528581\",\n \"0.52678025\",\n \"0.52601373\",\n \"0.5243053\",\n \"0.5229221\",\n \"0.52178055\",\n \"0.5217099\",\n \"0.52055335\",\n \"0.5202901\",\n \"0.5193666\",\n \"0.51927936\",\n \"0.5188188\",\n \"0.5187794\",\n \"0.5157166\",\n \"0.51557255\",\n \"0.51541126\",\n \"0.51516485\",\n \"0.51216716\",\n \"0.5121405\",\n \"0.5119334\",\n \"0.5113991\",\n \"0.50904804\",\n \"0.50876373\",\n \"0.507534\",\n \"0.5072584\",\n \"0.50710744\",\n \"0.506991\",\n \"0.5060521\",\n \"0.5053957\",\n \"0.5049969\",\n \"0.50400424\",\n \"0.5029955\",\n \"0.50176895\",\n \"0.50065374\",\n \"0.500538\",\n \"0.49985114\",\n \"0.49959415\",\n \"0.49902907\",\n \"0.4986542\",\n \"0.4985831\",\n \"0.49837995\",\n \"0.49762258\",\n \"0.4964562\",\n \"0.49542204\",\n \"0.4950504\",\n \"0.49408484\",\n \"0.49149516\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.59983224"},"document_rank":{"kind":"string","value":"14"}}},{"rowIdx":4674,"cells":{"query":{"kind":"string","value":"Returns the C function with a specified identifier (for C++, you need to do manual name mangling)"},"document":{"kind":"string","value":"function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n if (!func) {\n try {\n func = eval('_' + ident); // explicit lookup\n } catch(e) {}\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\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 getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch (e) {}\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch (e) {}\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch (e) {}\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n }","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n try {\n var func = globalScope['Module']['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch(e) {\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n if (!func) {\n try {\n func = eval('_' + ident); // explicit lookup\n } catch (e) {}\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n }","function getCFunc(ident) {\n try {\n var func = eval('_' + ident);\n } catch(e) {\n try {\n func = globalScope['Module']['_' + ident]; // closure exported function\n } catch(e) {}\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n if (!func) {\n try { func = eval('_' + ident); } catch(e) {}\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n if (!func) {\n try { func = eval('_' + ident); } catch(e) {}\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n if (!func) {\n try { func = eval('_' + ident); } catch(e) {}\n }\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n return func;\n}","function getCFunc(ident) {\r\n var func = Module['_' + ident]; // closure exported function\r\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\r\n return func;\r\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n var func = Module['_' + ident]; // closure exported function\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n return func;\n}","function getCFunc(ident) {\n\t var func = Module['_' + ident]; // closure exported function\n\t assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\n\t return func;\n\t}","function getCFunc(ident) {\nvar func = Module['_' + ident]; // closure exported function\nassert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\nreturn func;\n}","function functionName(func) {\n var result = /^function\\s+([\\w\\$]+)\\s*\\(/.exec(func.toString());\n return result ? result[1] : '<anonymous>'; // for an anonymous function there won't be a match\n}","getFunction(name) {\n const stack = this.lib.getOrAllocCallStack();\n const nameOffset = stack.allocRawBytes(name.length + 1);\n stack.storeRawBytes(nameOffset, support_1.StringToUint8Array(name));\n const outOffset = stack.allocPtrArray(1);\n const outPtr = stack.ptrFromOffset(outOffset);\n stack.commitToWasmMemory(outOffset);\n this.lib.checkCall(this.lib.exports.TVMModGetFunction(this.handle, stack.ptrFromOffset(nameOffset), 1, outPtr));\n const handle = this.lib.memory.loadPointer(outPtr);\n this.lib.recycleCallStack(stack);\n if (handle == 0) {\n throw Error(\"Cannot find function \" + name);\n }\n const ret = this.makePackedFunc(handle);\n return ret;\n }","function get_function_name(f) {\r\n\tvar str = f.toString();\r\n var name = str.split ('(')[0];\r\n name = name.split (/[' '{1,}]/)[1];\r\n return(name);\r\n}","function getFunctionName(aFunction) {\n var regexpResult = aFunction.toString().match(/function (\\w*)/);\n if (regexpResult && regexpResult[1]) {\n return regexpResult[1];\n }\n return 'anonymous';\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}","function ccall(ident, returnType, argTypes, args) {\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\n}"],"string":"[\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch (e) {}\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch (e) {}\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch (e) {}\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n }\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n try {\\n var func = globalScope['Module']['_' + ident]; // closure exported function\\n if (!func) func = eval('_' + ident); // explicit lookup\\n } catch(e) {\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) {\\n try {\\n func = eval('_' + ident); // explicit lookup\\n } catch (e) {}\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n }\",\n \"function getCFunc(ident) {\\n try {\\n var func = eval('_' + ident);\\n } catch(e) {\\n try {\\n func = globalScope['Module']['_' + ident]; // closure exported function\\n } catch(e) {}\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) {\\n try { func = eval('_' + ident); } catch(e) {}\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) {\\n try { func = eval('_' + ident); } catch(e) {}\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n if (!func) {\\n try { func = eval('_' + ident); } catch(e) {}\\n }\\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\r\\n var func = Module['_' + ident]; // closure exported function\\r\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\r\\n return func;\\r\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n var func = Module['_' + ident]; // closure exported function\\n assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n return func;\\n}\",\n \"function getCFunc(ident) {\\n\\t var func = Module['_' + ident]; // closure exported function\\n\\t assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\n\\t return func;\\n\\t}\",\n \"function getCFunc(ident) {\\nvar func = Module['_' + ident]; // closure exported function\\nassert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported');\\nreturn func;\\n}\",\n \"function functionName(func) {\\n var result = /^function\\\\s+([\\\\w\\\\$]+)\\\\s*\\\\(/.exec(func.toString());\\n return result ? result[1] : '<anonymous>'; // for an anonymous function there won't be a match\\n}\",\n \"getFunction(name) {\\n const stack = this.lib.getOrAllocCallStack();\\n const nameOffset = stack.allocRawBytes(name.length + 1);\\n stack.storeRawBytes(nameOffset, support_1.StringToUint8Array(name));\\n const outOffset = stack.allocPtrArray(1);\\n const outPtr = stack.ptrFromOffset(outOffset);\\n stack.commitToWasmMemory(outOffset);\\n this.lib.checkCall(this.lib.exports.TVMModGetFunction(this.handle, stack.ptrFromOffset(nameOffset), 1, outPtr));\\n const handle = this.lib.memory.loadPointer(outPtr);\\n this.lib.recycleCallStack(stack);\\n if (handle == 0) {\\n throw Error(\\\"Cannot find function \\\" + name);\\n }\\n const ret = this.makePackedFunc(handle);\\n return ret;\\n }\",\n \"function get_function_name(f) {\\r\\n\\tvar str = f.toString();\\r\\n var name = str.split ('(')[0];\\r\\n name = name.split (/[' '{1,}]/)[1];\\r\\n return(name);\\r\\n}\",\n \"function getFunctionName(aFunction) {\\n var regexpResult = aFunction.toString().match(/function (\\\\w*)/);\\n if (regexpResult && regexpResult[1]) {\\n return regexpResult[1];\\n }\\n return 'anonymous';\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\",\n \"function ccall(ident, returnType, argTypes, args) {\\n return ccallFunc(getCFunc(ident), returnType, argTypes, args);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.75231504","0.75231504","0.7520175","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.75044906","0.7473566","0.7473566","0.7473566","0.7473566","0.7473566","0.7473566","0.7473566","0.7473566","0.7473566","0.7473566","0.7462736","0.74625266","0.7453953","0.7453953","0.7453953","0.7265838","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72420096","0.72093815","0.718331","0.5906979","0.58243674","0.5508224","0.54761857","0.5307602","0.5307602","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581","0.5260581"],"string":"[\n \"0.75231504\",\n \"0.75231504\",\n \"0.7520175\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.75044906\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7473566\",\n \"0.7462736\",\n \"0.74625266\",\n \"0.7453953\",\n \"0.7453953\",\n \"0.7453953\",\n \"0.7265838\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72420096\",\n \"0.72093815\",\n \"0.718331\",\n \"0.5906979\",\n \"0.58243674\",\n \"0.5508224\",\n \"0.54761857\",\n \"0.5307602\",\n \"0.5307602\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\",\n \"0.5260581\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7469628"},"document_rank":{"kind":"string","value":"42"}}},{"rowIdx":4675,"cells":{"query":{"kind":"string","value":"Sets a value in memory in a dynamic way at runtime. Uses the type data. This is the same as makeSetValue, except that makeSetValue is done at compiletime and generates the needed code then, whereas this function picks the right code at runtime. Note that setValue and getValue only do aligned writes and reads! Note that ccall uses JS types as for defining types, while setValue and getValue need LLVM types ('i8', 'i32') this is a lowerlevel operation"},"document":{"kind":"string","value":"function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[((ptr)>>0)]=value; break;\n case 'i8': HEAP8[((ptr)>>0)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + 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 setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (HEAPF64[tempDoublePtr>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[tempDoublePtr>>2],HEAP32[(((ptr)+(4))>>2)]=HEAP32[tempDoublePtr+4>>2]); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[(((ptr)+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[(((ptr)+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[(((ptr)+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/(+(4294967296))), (+(4294967295)))>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=((HEAP32[((tempDoublePtr)>>2)])|0),HEAP32[(((ptr)+(4))>>2)]=((HEAP32[(((tempDoublePtr)+(4))>>2)])|0)); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/(+(4294967296))), (+(4294967295)))>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=((HEAP32[((tempDoublePtr)>>2)])|0),HEAP32[(((ptr)+(4))>>2)]=((HEAP32[(((tempDoublePtr)+(4))>>2)])|0)); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/(+(4294967296))), (+(4294967295)))>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=((HEAP32[((tempDoublePtr)>>2)])|0),HEAP32[(((ptr)+(4))>>2)]=((HEAP32[(((tempDoublePtr)+(4))>>2)])|0)); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type[type.length-1] === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': HEAP32[((ptr)>>2)]=value; break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (tempDoubleF64[0]=value,HEAP32[((ptr)>>2)]=tempDoubleI32[0],HEAP32[(((ptr)+(4))>>2)]=tempDoubleI32[1]); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type[type.length-1] === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': HEAP32[((ptr)>>2)]=value; break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (tempDoubleF64[0]=value,HEAP32[((ptr)>>2)]=tempDoubleI32[0],HEAP32[(((ptr)+(4))>>2)]=tempDoubleI32[1]); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type[type.length-1] === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': HEAP32[((ptr)>>2)]=value; break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': (tempDoubleF64[0]=value,HEAP32[((ptr)>>2)]=tempDoubleI32[0],HEAP32[(((ptr)+(4))>>2)]=tempDoubleI32[1]); break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,Math_abs(tempDouble) >= 1 ? (tempDouble > 0 ? Math_min(Math_floor((tempDouble)/4294967296), 4294967295)>>>0 : (~~(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296)))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,Math_abs(tempDouble) >= 1 ? (tempDouble > 0 ? Math_min(Math_floor((tempDouble)/4294967296), 4294967295)>>>0 : (~~(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296)))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,Math_abs(tempDouble) >= 1 ? (tempDouble > 0 ? Math_min(Math_floor((tempDouble)/4294967296), 4294967295)>>>0 : (~~(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296)))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length - 1) === '*') type = 'i32'; // pointers are 32-bit\n switch (type) {\n case 'i1':\n HEAP8[(ptr)] = value;\n break;\n case 'i8':\n HEAP8[(ptr)] = value;\n break;\n case 'i16':\n HEAP16[((ptr) >> 1)] = value;\n break;\n case 'i32':\n HEAP32[((ptr) >> 2)] = value;\n break;\n case 'i64':\n (tempI64 = [value >>> 0, (tempDouble = value, (+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble) / (+4294967296)))), (+4294967295))) | 0) >>> 0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble))) >>> 0)) / (+4294967296)))))) >>> 0) : 0)], HEAP32[((ptr) >> 2)] = tempI64[0], HEAP32[(((ptr) + (4)) >> 2)] = tempI64[1]);\n break;\n case 'float':\n HEAPF32[((ptr) >> 2)] = value;\n break;\n case 'double':\n HEAPF64[((ptr) >> 3)] = value;\n break;\n default:\n abort('invalid type for setValue: ' + type);\n }\n }","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length - 1) === '*') type = 'i32'; // pointers are 32-bit\n switch (type) {\n case 'i1':\n HEAP8[(ptr)] = value;\n break;\n case 'i8':\n HEAP8[(ptr)] = value;\n break;\n case 'i16':\n HEAP16[((ptr) >> 1)] = value;\n break;\n case 'i32':\n HEAP32[((ptr) >> 2)] = value;\n break;\n case 'i64':\n (tempI64 = [value >>> 0, (tempDouble = value, (+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble) / (+4294967296)))), (+4294967295))) | 0) >>> 0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble))) >>> 0)) / (+4294967296)))))) >>> 0) : 0)], HEAP32[((ptr) >> 2)] = tempI64[0], HEAP32[(((ptr) + (4)) >> 2)] = tempI64[1]);\n break;\n case 'float':\n HEAPF32[((ptr) >> 2)] = value;\n break;\n case 'double':\n HEAPF64[((ptr) >> 3)] = value;\n break;\n default:\n abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length - 1) === '*') type = 'i32'; // pointers are 32-bit\n switch (type) {\n case 'i1':\n HEAP8[(ptr)] = value;\n break;\n case 'i8':\n HEAP8[(ptr)] = value;\n break;\n case 'i16':\n HEAP16[((ptr) >> 1)] = value;\n break;\n case 'i32':\n HEAP32[((ptr) >> 2)] = value;\n break;\n case 'i64':\n (tempI64 = [value >>> 0, (tempDouble = value, (+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble) / (+4294967296)))), (+4294967295))) | 0) >>> 0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble))) >>> 0)) / (+4294967296)))))) >>> 0) : 0)], HEAP32[((ptr) >> 2)] = tempI64[0], HEAP32[(((ptr) + (4)) >> 2)] = tempI64[1]);\n break;\n case 'float':\n HEAPF32[((ptr) >> 2)] = value;\n break;\n case 'double':\n HEAPF64[((ptr) >> 3)] = value;\n break;\n default:\n abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[((ptr)>>0)]=value; break;\n case 'i8': HEAP8[((ptr)>>0)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math.abs(tempDouble))) >= (+(1)) ? (tempDouble > (+(0)) ? ((Math.min((+(Math.floor((tempDouble)/(+(4294967296))))), (+(4294967295))))|0)>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+(4294967296)))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\n default: abort('invalid type for setValue: ' + type);\n }\n}","set value(value) {}","set type(value) {}","setPackedArguments(stack, args, argsValue, argsCode) {\n for (let i = 0; i < args.length; ++i) {\n let val = args[i];\n const tp = typeof val;\n const valueOffset = argsValue + i * 8 /* TVMValue */;\n const codeOffset = argsCode + i * 4 /* I32 */;\n if (val instanceof NDArray) {\n stack.storePtr(valueOffset, val.handle);\n stack.storeI32(codeOffset, 13 /* TVMNDArrayHandle */);\n }\n else if (val instanceof Scalar) {\n if (val.dtype.startsWith(\"int\") || val.dtype.startsWith(\"uint\")) {\n stack.storeI64(valueOffset, val.value);\n stack.storeI32(codeOffset, 0 /* Int */);\n }\n else if (val.dtype.startsWith(\"float\")) {\n stack.storeF64(valueOffset, val.value);\n stack.storeI32(codeOffset, 2 /* Float */);\n }\n else {\n support_1.assert(val.dtype == \"handle\", \"Expect handle\");\n stack.storePtr(valueOffset, val.value);\n stack.storeI32(codeOffset, 3 /* TVMOpaqueHandle */);\n }\n }\n else if (val instanceof DLContext) {\n stack.storeI32(valueOffset, val.deviceType);\n stack.storeI32(valueOffset + 4 /* I32 */, val.deviceType);\n stack.storeI32(codeOffset, 6 /* TVMContext */);\n }\n else if (tp == \"number\") {\n stack.storeF64(valueOffset, val);\n stack.storeI32(codeOffset, 2 /* Float */);\n // eslint-disable-next-line no-prototype-builtins\n }\n else if (tp == \"function\" && val.hasOwnProperty(\"_tvmPackedCell\")) {\n stack.storePtr(valueOffset, val._tvmPackedCell.handle);\n stack.storeI32(codeOffset, 10 /* TVMPackedFuncHandle */);\n }\n else if (val === null || val == undefined) {\n stack.storePtr(valueOffset, 0);\n stack.storeI32(codeOffset, 4 /* Null */);\n }\n else if (tp == \"string\") {\n stack.allocThenSetArgString(valueOffset, val);\n stack.storeI32(codeOffset, 11 /* TVMStr */);\n }\n else if (val instanceof Uint8Array) {\n stack.allocThenSetArgBytes(valueOffset, val);\n stack.storeI32(codeOffset, 12 /* TVMBytes */);\n }\n else if (val instanceof Function) {\n val = this.toPackedFunc(val);\n stack.tempArgs.push(val);\n stack.storePtr(valueOffset, val._tvmPackedCell.handle);\n stack.storeI32(codeOffset, 10 /* TVMPackedFuncHandle */);\n }\n else if (val instanceof Module) {\n stack.storePtr(valueOffset, val.handle);\n stack.storeI32(codeOffset, 9 /* TVMModuleHandle */);\n }\n else {\n throw new Error(\"Unsupported argument type \" + tp);\n }\n }\n }","_set_value(value) {\n if (!this._has_value_flag) {\n this._update_size(1);\n this._has_value_flag = true;\n }\n this._value = value;\n }","function TypedObjectSetScalar(descr, typedObj, offset, fromValue) {\n assert(DESCR_KIND(descr) === JS_TYPEREPR_SCALAR_KIND,\n \"Expected scalar type descriptor\");\n var type = DESCR_TYPE(descr);\n switch (type) {\n case JS_SCALARTYPEREPR_INT8:\n return Store_int8(typedObj, offset,\n TO_INT32(fromValue) & 0xFF);\n\n case JS_SCALARTYPEREPR_UINT8:\n return Store_uint8(typedObj, offset,\n TO_UINT32(fromValue) & 0xFF);\n\n case JS_SCALARTYPEREPR_UINT8_CLAMPED:\n var v = ClampToUint8(+fromValue);\n return Store_int8(typedObj, offset, v);\n\n case JS_SCALARTYPEREPR_INT16:\n return Store_int16(typedObj, offset,\n TO_INT32(fromValue) & 0xFFFF);\n\n case JS_SCALARTYPEREPR_UINT16:\n return Store_uint16(typedObj, offset,\n TO_UINT32(fromValue) & 0xFFFF);\n\n case JS_SCALARTYPEREPR_INT32:\n return Store_int32(typedObj, offset,\n TO_INT32(fromValue));\n\n case JS_SCALARTYPEREPR_UINT32:\n return Store_uint32(typedObj, offset,\n TO_UINT32(fromValue));\n\n case JS_SCALARTYPEREPR_FLOAT32:\n return Store_float32(typedObj, offset, +fromValue);\n\n case JS_SCALARTYPEREPR_FLOAT64:\n return Store_float64(typedObj, offset, +fromValue);\n }\n\n assert(false, \"Unhandled scalar type: \" + type);\n return undefined;\n}","setNativeValue(element, value) {\n const valueSetter = Object.getOwnPropertyDescriptor(element, 'value').set\n const prototype = Object.getPrototypeOf(element)\n const prototypeValueSetter = Object.getOwnPropertyDescriptor(prototype, 'value').set\n\n if (valueSetter && valueSetter !== prototypeValueSetter) {\n prototypeValueSetter.call(element, value)\n } else {\n valueSetter.call(element, value)\n }\n }","setValue(_value) {\n if (this.isntUndefined(_value) && this.isValueObject(this.valueObj) && this.valueDiffers(_value)) {\n this.__value = _value;\n if (this.isObjectOrArray(_value)) {\n this.valueObj.set(this.cloneObject(_value));\n }\n else {\n this.valueObj.set(_value);\n }\n if (this.isFunction(this.refresh)) {\n this.refresh();\n }\n else if (this.isFunction(this.refreshValue)) {\n this.refreshValue();\n }\n }\n }","set(pointer, value) {\n this.memory[pointer] = value;\n }","function getPureArraySetter( type ) {\n\n\t \tswitch ( type ) {\n\n\t \t\tcase 0x1406: return setValue1fv; // FLOAT\n\t \t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t \t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t \t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t \t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t \t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t \t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t \t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t \t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t \t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t \t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t \t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t \t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t \t}\n\n\t }","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t}\n\n\t}","function getPureArraySetter( type ) {\n\t\n\t\t\tswitch ( type ) {\n\t\n\t\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\t\n\t\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\t\n\t\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\t\n\t\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\t\n\t\t\t}\n\t\n\t\t}","function setters(self, type, key, value, lifetime, cb, cas) {\n\tvar flag = 0;\n\tvar valuetype = typeof value;\n\tvar length;\n\n\tif (Buffer.isBuffer(value)) {\n\t\tflag = FLAG_BINARY;\n\t\tvalue = value.toString('binary');\n\t}\n\telse if (valuetype !== 'string' && valuetype !== 'number') {\n\t\tflag = FLAG_JSON;\n\t\tvalue = JSON.stringify(value);\n\t}\n\telse\n\t\tvalue = value.toString();\n\n\tlength = Buffer.byteLength(value);\n\tif (length > self.maxValue) {\n\t\tvar err = new Error('The length of the value is greater than ' + self.maxValue);\n\t\tconsole.error(err);\n\t\treturn cb ? cb(err) : self.onerror.trigger(err);\n\t}\n\n\tvar cmd = [type, key, flag, lifetime, length].join(' ') + (cas ? ' ' + cas : '');\n\tcommand(self, {\n\t\tkey: key,\n\t\tcb: cb,\n\t\tlifetime: lifetime,\n\t\tvalue: value,\n\t\tcas: cas,\n\t\ttype: type,\n\t\tcommand: cmd + LINEBREAK + value,\n\t\tredundancy: cmd + NOREPLY + LINEBREAK + value\n\t});\n}","function getPureArraySetter( type ) {\n\n\t\t\tswitch ( type ) {\n\n\t\t\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\t\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\t\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\t\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\t\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\t\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\t\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\t\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\t\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\t\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\t\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\t\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\t\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t\t\t}\n\n\t\t}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValue1fv; // FLOAT\n\t\tcase 0x8b50: return setValueV2a; // _VEC2\n\t\tcase 0x8b51: return setValueV3a; // _VEC3\n\t\tcase 0x8b52: return setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2a; // _MAT2\n\t\tcase 0x8b5b: return setValueM3a; // _MAT3\n\t\tcase 0x8b5c: return setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\n\n\t}\n\n}","function getPureArraySetter(type) {\n\n\tswitch (type) {\n\n\t\tcase 0x1406:\n\t\t\treturn setValue1fv; // FLOAT\n\t\tcase 0x8b50:\n\t\t\treturn setValueV2a; // _VEC2\n\t\tcase 0x8b51:\n\t\t\treturn setValueV3a; // _VEC3\n\t\tcase 0x8b52:\n\t\t\treturn setValueV4a; // _VEC4\n\n\t\tcase 0x8b5a:\n\t\t\treturn setValueM2a; // _MAT2\n\t\tcase 0x8b5b:\n\t\t\treturn setValueM3a; // _MAT3\n\t\tcase 0x8b5c:\n\t\t\treturn setValueM4a; // _MAT4\n\n\t\tcase 0x8b5e:\n\t\t\treturn setValueT1a; // SAMPLER_2D\n\t\tcase 0x8b60:\n\t\t\treturn setValueT6a; // SAMPLER_CUBE\n\n\t\tcase 0x1404:case 0x8b56:\n\t\t\treturn setValue1iv; // INT, BOOL\n\t\tcase 0x8b53:case 0x8b57:\n\t\t\treturn setValue2iv; // _VEC2\n\t\tcase 0x8b54:case 0x8b58:\n\t\t\treturn setValue3iv; // _VEC3\n\t\tcase 0x8b55:case 0x8b59:\n\t\t\treturn setValue4iv; // _VEC4\n\n\t}\n}","set intValue(value) {}","setValueObj(_valueObj) {\n if (this.isValueObject(_valueObj)) {\n this.__valueObj = _valueObj;\n this.setValue(_valueObj.value);\n }\n }","function getPureArraySetter( type ) {\n\n\tswitch ( type ) {\n\n\t\tcase 0x1406: return setValueV1fArray; // FLOAT\n\t\tcase 0x8b50: return setValueV2fArray; // _VEC2\n\t\tcase 0x8b51: return setValueV3fArray; // _VEC3\n\t\tcase 0x8b52: return setValueV4fArray; // _VEC4\n\n\t\tcase 0x8b5a: return setValueM2Array; // _MAT2\n\t\tcase 0x8b5b: return setValueM3Array; // _MAT3\n\t\tcase 0x8b5c: return setValueM4Array; // _MAT4\n\n\t\tcase 0x1404: case 0x8b56: return setValueV1iArray; // INT, BOOL\n\t\tcase 0x8b53: case 0x8b57: return setValueV2iArray; // _VEC2\n\t\tcase 0x8b54: case 0x8b58: return setValueV3iArray; // _VEC3\n\t\tcase 0x8b55: case 0x8b59: return setValueV4iArray; // _VEC4\n\n\t\tcase 0x1405: return setValueV1uiArray; // UINT\n\t\tcase 0x8dc6: return setValueV2uiArray; // _VEC2\n\t\tcase 0x8dc7: return setValueV3uiArray; // _VEC3\n\t\tcase 0x8dc8: return setValueV4uiArray; // _VEC4\n\n\t\tcase 0x8b5e: // SAMPLER_2D\n\t\tcase 0x8d66: // SAMPLER_EXTERNAL_OES\n\t\tcase 0x8dca: // INT_SAMPLER_2D\n\t\tcase 0x8dd2: // UNSIGNED_INT_SAMPLER_2D\n\t\tcase 0x8b62: // SAMPLER_2D_SHADOW\n\t\t\treturn setValueT1Array;\n\n\t\tcase 0x8b5f: // SAMPLER_3D\n\t\tcase 0x8dcb: // INT_SAMPLER_3D\n\t\tcase 0x8dd3: // UNSIGNED_INT_SAMPLER_3D\n\t\t\treturn setValueT3DArray;\n\n\t\tcase 0x8b60: // SAMPLER_CUBE\n\t\tcase 0x8dcc: // INT_SAMPLER_CUBE\n\t\tcase 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE\n\t\tcase 0x8dc5: // SAMPLER_CUBE_SHADOW\n\t\t\treturn setValueT6Array;\n\n\t\tcase 0x8dc1: // SAMPLER_2D_ARRAY\n\t\tcase 0x8dcf: // INT_SAMPLER_2D_ARRAY\n\t\tcase 0x8dd7: // UNSIGNED_INT_SAMPLER_2D_ARRAY\n\t\tcase 0x8dc4: // SAMPLER_2D_ARRAY_SHADOW\n\t\t\treturn setValueT2DArrayArray;\n\n\t}\n\n}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValueV1fArray; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2fArray; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3fArray; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4fArray; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2Array; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3Array; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4Array; // _MAT4\n\n\t\t\tcase 0x1404: case 0x8b56: return setValueV1iArray; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValueV2iArray; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValueV3iArray; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValueV4iArray; // _VEC4\n\n\t\t\tcase 0x1405: return setValueV1uiArray; // UINT\n\t\t\tcase 0x8dc6: return setValueV2uiArray; // _VEC2\n\t\t\tcase 0x8dc7: return setValueV3uiArray; // _VEC3\n\t\t\tcase 0x8dc8: return setValueV4uiArray; // _VEC4\n\n\t\t\tcase 0x8b5e: // SAMPLER_2D\n\t\t\tcase 0x8d66: // SAMPLER_EXTERNAL_OES\n\t\t\tcase 0x8dca: // INT_SAMPLER_2D\n\t\t\tcase 0x8dd2: // UNSIGNED_INT_SAMPLER_2D\n\t\t\tcase 0x8b62: // SAMPLER_2D_SHADOW\n\t\t\t\treturn setValueT1Array;\n\n\t\t\tcase 0x8b5f: // SAMPLER_3D\n\t\t\tcase 0x8dcb: // INT_SAMPLER_3D\n\t\t\tcase 0x8dd3: // UNSIGNED_INT_SAMPLER_3D\n\t\t\t\treturn setValueT3DArray;\n\n\t\t\tcase 0x8b60: // SAMPLER_CUBE\n\t\t\tcase 0x8dcc: // INT_SAMPLER_CUBE\n\t\t\tcase 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE\n\t\t\tcase 0x8dc5: // SAMPLER_CUBE_SHADOW\n\t\t\t\treturn setValueT6Array;\n\n\t\t\tcase 0x8dc1: // SAMPLER_2D_ARRAY\n\t\t\tcase 0x8dcf: // INT_SAMPLER_2D_ARRAY\n\t\t\tcase 0x8dd7: // UNSIGNED_INT_SAMPLER_2D_ARRAY\n\t\t\tcase 0x8dc4: // SAMPLER_2D_ARRAY_SHADOW\n\t\t\t\treturn setValueT2DArrayArray;\n\n\t\t}\n\n\t}","setCachedValue( accTypeEnumIndex, characteristicString, value, callback )\n {\n let self = this;\n\n if ( self.hV.statusMsg == \"TRUE\" )\n self.log.info( chalk.blue( `Setting (Cached) ${ self.displayName } ${ characteristicString }` ) + ` ${ value }` );\n else\n if ( settings.cmd4Dbg ) self.log.debug( `setCachedvalue accTypeEnumIndex:( ${ accTypeEnumIndex } )-\"${ characteristicString }\" function for: ${ self.displayName } value: ${ value }` );\n\n\n // Save the cached value.\n // Fakegato does not need to be updated as that is done on a \"Get\".\n self.cmd4Storage.setStoredValueForIndex( accTypeEnumIndex, value );\n\n let relatedCurrentAccTypeEnumIndex = this.getDevicesRelatedCurrentAccTypeEnumIndex( accTypeEnumIndex );\n\n // We are currently tring to set a cached characteristics \n // like \"Target*\".\n // There is no way for its relatedCurrentAccTypeEnumIndex characteristic like \"Current*\"\n // to be set if cached or Polled (with the exception below).\n if ( relatedCurrentAccTypeEnumIndex != null )\n {\n // We are in a \"Set\" but this applies to the \"Get\" for why we would need to\n // set the relatedCurrentAccTypeEnumIndex Characteristic as well.\n\n if ( self.listOfPollingCharacteristics[ relatedCurrentAccTypeEnumIndex ])\n {\n let relatedCharacteristicString = CMD4_ACC_TYPE_ENUM.properties[ relatedCurrentAccTypeEnumIndex ].type;\n self.log.info( chalk.blue( `Also Setting (Cached) ${ self.displayName } ${ relatedCharacteristicString }` ) + ` ${ value }` );\n self.cmd4Storage.setStoredValueForIndex( relatedCurrentAccTypeEnumIndex, value );\n }\n }\n\n callback( null );\n }","function TypedObjectSet(descr, typedObj, offset, name, fromValue) {\n if (!TypedObjectIsAttached(typedObj))\n ThrowTypeError(JSMSG_TYPEDOBJECT_HANDLE_UNATTACHED);\n\n switch (DESCR_KIND(descr)) {\n case JS_TYPEREPR_SCALAR_KIND:\n TypedObjectSetScalar(descr, typedObj, offset, fromValue);\n return;\n\n case JS_TYPEREPR_REFERENCE_KIND:\n TypedObjectSetReference(descr, typedObj, offset, name, fromValue);\n return;\n\n case JS_TYPEREPR_ARRAY_KIND:\n var length = DESCR_ARRAY_LENGTH(descr);\n if (TypedObjectSetArray(descr, length, typedObj, offset, fromValue))\n return;\n break;\n\n case JS_TYPEREPR_STRUCT_KIND:\n if (!IsObject(fromValue))\n break;\n\n // Adapt each field.\n var fieldNames = DESCR_STRUCT_FIELD_NAMES(descr);\n var fieldDescrs = DESCR_STRUCT_FIELD_TYPES(descr);\n var fieldOffsets = DESCR_STRUCT_FIELD_OFFSETS(descr);\n for (var i = 0; i < fieldNames.length; i++) {\n var fieldName = fieldNames[i];\n var fieldDescr = fieldDescrs[i];\n var fieldOffset = fieldOffsets[i];\n var fieldValue = fromValue[fieldName];\n TypedObjectSet(fieldDescr, typedObj, offset + fieldOffset, fieldName, fieldValue);\n }\n return;\n }\n\n ThrowTypeError(JSMSG_CANT_CONVERT_TO,\n typeof(fromValue),\n DESCR_STRING_REPR(descr));\n}","setValue(val) {\n this.binder.fieldValue = val;\n }","setValue(val) {\n this.binder.fieldValue = val;\n }","setValue(val) {\n this.binder.fieldValue = val;\n }","function setDataType(valueName, valueModel){\n switch(valueName){\n case \"on\":\n case \"reachable\":\n valueModel.set(\"number\", {min: 0, max: 1, step: 1, unit: \"int\"});\n break;\n case \"bri\":\n case \"sat\":\n valueModel.set(\"number\", {min: 0, max: 255, step: 1, unit: \"int\"});\n break;\n case \"hue\":\n valueModel.set(\"number\", {min: 0, max: 65535, step: 1, unit: \"int\"});\n break;\n default:\n valueModel.set(\"string\", {max: 99});\n break;\n }\n}","setValue(value) {\n this.value = value;\n }","setValue(value) {\n this._value = value;\n }","function setVal(obj,val)\n{\n obj.val(val);\n}","function writeDataForType( typeDefinition, value, byteArray, offset ) {\n const type = getDataTypeFromDefinition( typeDefinition );\n const length = getLengthFromDefinition( typeDefinition );\n\n let writeOffset = offset;\n\n if ( offset + ( length - 1 ) >= byteArray.length ) {\n return 0;\n }\n const littleEndian = isDefinitionForLittleEndian( typeDefinition );\n const isFloat = floatingPointTypes.includes( type );\n const isUnsigned = unsignedTypes.includes( type );\n const dataView = isFloat || sixtyFourBitTypes.includes( type ) ? new DataView( byteArray.buffer ) : null;\n\n switch ( type ) {\n default:\n return writeOffset;\n\n // NOTE we duplicate between single and list based values to\n // omit the need for a slicing operation on the ByteArray\n // 8-bit String type\n case types.CHAR:\n if ( length === 1 ) {\n byteArray[ writeOffset ] = value.charCodeAt( 0 );\n } else {\n for ( let i = 0; i < length; ++i ) {\n byteArray[ writeOffset + i ] = value.charCodeAt( i );\n }\n }\n writeOffset += length;\n break;\n\n // 8-bit Number types\n case types.BYTE:\n case types.INT8:\n case types.UINT8:\n if ( length === 1 ) {\n byteArray[ writeOffset ] = value;\n } else {\n for ( let i = 0; i < length; ++i ) {\n byteArray[ writeOffset + i ] = value[ i ];\n }\n }\n writeOffset += length;\n break;\n\n // NOTE the large bit shift statements aren't the most readable, but here we\n // take comfort in knowing that their performance is nice enough given\n // that this method is already abstracted behind several subroutines\n // 16-bit Number types\n case types.SHORT:\n case types.INT16:\n case types.UINT16:\n writeMultiple( writeOffset, length, 2, ( i, w ) => {\n const valueToWrite = length === 1 ? value : value[ i ];\n if ( littleEndian ) {\n byteArray[ w + 1 ] = ( valueToWrite >> 8 ) & 0xff;\n byteArray[ w ] = ( valueToWrite & 0xff );\n } else {\n byteArray[ w ] = ( valueToWrite >> 8 ) & 0xff;\n byteArray[ w + 1 ] = ( valueToWrite & 0xff );\n }\n });\n writeOffset += length * 2;\n break;\n\n // 24-bit Number types (this is more meaningful to those dealing with audio formats)\n case types.INT24:\n case types.UINT24:\n writeMultiple( writeOffset, length, 3, ( i, w ) => {\n const valueToWrite = length === 1 ? value : value[ i ];\n if ( littleEndian ) {\n byteArray[ w + 2 ] = ( valueToWrite >> 16 ) & 0xff;\n byteArray[ w + 1 ] = ( valueToWrite >> 8 ) & 0xff;\n byteArray[ w ] = ( valueToWrite & 0xff );\n } else {\n byteArray[ w ] = ( valueToWrite >> 16 ) & 0xff;\n byteArray[ w + 1 ] = ( valueToWrite >> 8 ) & 0xff;\n byteArray[ w + 2 ] = ( valueToWrite & 0xff );\n }\n });\n writeOffset += length * 3;\n break;\n\n // 32-bit integer Number types\n case types.INT32:\n case types.UINT32:\n case types.LONG:\n case types.ULONG:\n case types.FLOAT:\n case types.FLOAT32:\n writeMultiple( writeOffset, length, 4, ( i, w ) => {\n const valueToWrite = length === 1 ? value : value[ i ];\n if ( isFloat ) {\n dataView.setFloat32( w, valueToWrite, littleEndian );\n } else {\n if ( littleEndian ) {\n byteArray[ w + 3 ] = ( valueToWrite & 0xff000000 ) >> 24;\n byteArray[ w + 2 ] = ( valueToWrite & 0x00ff0000 ) >> 16;\n byteArray[ w + 1 ] = ( valueToWrite & 0x0000ff00 ) >> 8;\n byteArray[ w ] = ( valueToWrite & 0x000000ff );\n } else {\n byteArray[ w ] = ( valueToWrite & 0xff000000 ) >> 24;\n byteArray[ w + 1 ] = ( valueToWrite & 0x00ff0000 ) >> 16;\n byteArray[ w + 2 ] = ( valueToWrite & 0x0000ff00 ) >> 8;\n byteArray[ w + 3 ] = ( valueToWrite & 0x000000ff );\n }\n }\n });\n writeOffset += length * 4;\n break;\n\n // 64-bit Number types\n case types.INT64:\n case types.UINT64:\n case types.LONGLONG:\n case types.ULONGLONG:\n case types.DOUBLE:\n case types.FLOAT64:\n writeMultiple( writeOffset, length, 8, ( i, w ) => {\n const valueToWrite = length === 1 ? value : value[ i ];\n if ( isFloat ) {\n dataView.setFloat64( w, valueToWrite, littleEndian );\n } else {\n dataView[ isUnsigned ? 'setBigUint64' : 'setBigInt64' ]( w, BigInt( valueToWrite ), littleEndian );\n }\n });\n writeOffset += length * 8;\n break;\n }\n return writeOffset;\n}","function setCache(curType, id, key, value) {\n if (id && id != -1 && RandomStorage[curType]) {\n RandomStorage[curType][key + id] = value; }\n}","function getPureArraySetter( type ) {\n\n\t\tswitch ( type ) {\n\n\t\t\tcase 0x1406: return setValueV1fArray; // FLOAT\n\t\t\tcase 0x8b50: return setValueV2fArray; // _VEC2\n\t\t\tcase 0x8b51: return setValueV3fArray; // _VEC3\n\t\t\tcase 0x8b52: return setValueV4fArray; // _VEC4\n\n\t\t\tcase 0x8b5a: return setValueM2Array; // _MAT2\n\t\t\tcase 0x8b5b: return setValueM3Array; // _MAT3\n\t\t\tcase 0x8b5c: return setValueM4Array; // _MAT4\n\n\t\t\tcase 0x1404: case 0x8b56: return setValueV1iArray; // INT, BOOL\n\t\t\tcase 0x8b53: case 0x8b57: return setValueV2iArray; // _VEC2\n\t\t\tcase 0x8b54: case 0x8b58: return setValueV3iArray; // _VEC3\n\t\t\tcase 0x8b55: case 0x8b59: return setValueV4iArray; // _VEC4\n\n\t\t\tcase 0x8b5e: // SAMPLER_2D\n\t\t\tcase 0x8d66: // SAMPLER_EXTERNAL_OES\n\t\t\tcase 0x8dca: // INT_SAMPLER_2D\n\t\t\tcase 0x8dd2: // UNSIGNED_INT_SAMPLER_2D\n\t\t\tcase 0x8b62: // SAMPLER_2D_SHADOW\n\t\t\t\treturn setValueT1Array;\n\n\t\t\tcase 0x8b60: // SAMPLER_CUBE\n\t\t\tcase 0x8dcc: // INT_SAMPLER_CUBE\n\t\t\tcase 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE\n\t\t\tcase 0x8dc5: // SAMPLER_CUBE_SHADOW\n\t\t\t\treturn setValueT6Array;\n\n\t\t}\n\n\t}","setValue(value) {\n this.value = value;\n this.doubleNumber = this.value * 2;\n }","create(_id, _data, _type) {\n if (!_type) {\n HValue.new(_id, _data);\n }\n else if (_type === 1) {\n HPushValue.new(_id, _data);\n }\n else if (_type === 2) {\n HPullValue.new(_id, _data);\n }\n else {\n console.warn(`Unknown value type: ${_type}`);\n }\n }","function setNodeOptimizedVal(node, val) {\n node.type = typeof val;\n node.value = val;\n node.wasOptimized = true;\n delete node.left;\n delete node.right;\n}","set x(value) {}","set Custom(value) {}","set longValue(value) {}","set this[string](value) {}","function setByUuid (attrs, obj, name, value, actualType) {\n var uuid = value.uuid;\n var type = JS.getClassByName(actualType);\n if (type) {\n if (Fire.isChildClassOf(type, Fire.RawAsset)) {\n setAsset(obj, name, uuid, type);\n }\n else if (Fire.isChildClassOf(type, Fire.Runtime.NodeWrapper)) {\n var instance = Fire.engine.getInstanceById(uuid);\n if (instance && attrs && attrs.isRuntimeNode) {\n obj[name] = instance.targetN;\n }\n else {\n obj[name] = instance;\n }\n }\n else {\n // just a common primitive object\n obj[name] = value;\n }\n }\n else {\n Fire.warn('Unknown type to apply: ' + actualType);\n }\n}","function setCType(prop, classContext) {\n\tprop.isPtr = false;\n\tprop.CType = undefined;\n\tprop.CConstType = undefined;\n\tprop.CBaseType = undefined;\n\n\t/*\n\t * map basic JSON types\n\t */\n\tswitch ( prop.type ) {\n\tcase 'string':\n\t\tprop.CBaseType = \"std::string\";\n\t\tprop.isPtr = true;\n\t\tbreak;\n\n\tcase 'number':\n\t\tprop.CBaseType = \"double\";\n\t\tbreak;\n\n\tcase 'integer':\n\t\tprop.CBaseType = \"int64_t\";\n\t\tbreak;\n\n\tcase 'boolean':\n\t\tprop.CBaseType = \"bool\";\n\t\tbreak;\n\n\tcase 'object':\n\t\tprop.isPtr = true;\n\t\tprop.CBaseType = prop.className;\n\t\tbreak;\n\n\tcase 'array':\n\t\tprop.isPtr = true;\n\t\t// get type from array items\n\t\tprop.CBaseType = \"std::vector<\" + prop.items.CType + \">\";\n\t\tbreak;\n\n\tcase 'any':\n\t\tprop.isPtr = true;\n\t\tprop.CBaseType = \"std::string\"; // use the JSON text\n\t\tbreak;\n\n\tdefault:\n\t\t// this should never happen\n\t\tbreak;\n\t}\n\t\n\t/*\n\t * handle extended types\n\t */\n\t\n\t// ID\n\tif ( prop.type == 'string' && prop.exttype == 'id' ) {\n\t\tprop.CBaseType = 'ConnectedVision::id_t';\n\t\tprop.isPtr = false;\n\t}\n\n\t\n\t// timestamp\n\tif ( prop.type == 'integer' && prop.exttype == 'timestamp' ) {\n\t\tprop.CBaseType = 'ConnectedVision::timestamp_t';\n\t\tprop.isPtr = false;\n\t}\n\t\n\t// enforce exttype\n\tif ( !prop.exttype )\n\t\tprop.exttype = prop.type;\n\t\n\t// derive C/C++ type from base type\n\tif ( prop.isPtr ) {\n\t\tprop.CType = 'boost::shared_ptr<' + prop.CBaseType + '>';\n\t\tprop.CConstType = 'boost::shared_ptr<const ' + prop.CBaseType + '>';\n\t} else {\n\t\tprop.CType = prop.CBaseType;\n\t\tprop.CConstType = prop.CBaseType;\n\t}\n}","setValue(value) {\n // Save old values in computeCell for comparison checks\n for (const computeCell of this.computeCells) {\n computeCell.saveValue();\n }\n this.value = value;\n this.onUpdate();\n }","setAttrValue(attr, value) {\n this._ensureUnpacked();\n this.unpackedAttrs.set(attr.name, value);\n }"],"string":"[\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (HEAPF64[tempDoublePtr>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[tempDoublePtr>>2],HEAP32[(((ptr)+(4))>>2)]=HEAP32[tempDoublePtr+4>>2]); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[(((ptr)+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[(((ptr)+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/4294967296), 4294967295)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=HEAP32[((tempDoublePtr)>>2)],HEAP32[(((ptr)+(4))>>2)]=HEAP32[(((tempDoublePtr)+(4))>>2)]); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/(+(4294967296))), (+(4294967295)))>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=((HEAP32[((tempDoublePtr)>>2)])|0),HEAP32[(((ptr)+(4))>>2)]=((HEAP32[(((tempDoublePtr)+(4))>>2)])|0)); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/(+(4294967296))), (+(4294967295)))>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=((HEAP32[((tempDoublePtr)>>2)])|0),HEAP32[(((ptr)+(4))>>2)]=((HEAP32[(((tempDoublePtr)+(4))>>2)])|0)); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,Math.min(Math.floor((value)/(+(4294967296))), (+(4294967295)))>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (HEAPF64[(tempDoublePtr)>>3]=value,HEAP32[((ptr)>>2)]=((HEAP32[((tempDoublePtr)>>2)])|0),HEAP32[(((ptr)+(4))>>2)]=((HEAP32[(((tempDoublePtr)+(4))>>2)])|0)); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,((Math.min((+(Math.floor((value)/(+(4294967296))))), (+(4294967295))))|0)>>>0],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type[type.length-1] === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': HEAP32[((ptr)>>2)]=value; break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (tempDoubleF64[0]=value,HEAP32[((ptr)>>2)]=tempDoubleI32[0],HEAP32[(((ptr)+(4))>>2)]=tempDoubleI32[1]); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type[type.length-1] === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': HEAP32[((ptr)>>2)]=value; break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (tempDoubleF64[0]=value,HEAP32[((ptr)>>2)]=tempDoubleI32[0],HEAP32[(((ptr)+(4))>>2)]=tempDoubleI32[1]); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type[type.length-1] === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': HEAP32[((ptr)>>2)]=value; break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': (tempDoubleF64[0]=value,HEAP32[((ptr)>>2)]=tempDoubleI32[0],HEAP32[(((ptr)+(4))>>2)]=tempDoubleI32[1]); break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,Math_abs(tempDouble) >= 1 ? (tempDouble > 0 ? Math_min(Math_floor((tempDouble)/4294967296), 4294967295)>>>0 : (~~(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296)))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,Math_abs(tempDouble) >= 1 ? (tempDouble > 0 ? Math_min(Math_floor((tempDouble)/4294967296), 4294967295)>>>0 : (~~(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296)))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,Math_abs(tempDouble) >= 1 ? (tempDouble > 0 ? Math_min(Math_floor((tempDouble)/4294967296), 4294967295)>>>0 : (~~(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296)))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length - 1) === '*') type = 'i32'; // pointers are 32-bit\\n switch (type) {\\n case 'i1':\\n HEAP8[(ptr)] = value;\\n break;\\n case 'i8':\\n HEAP8[(ptr)] = value;\\n break;\\n case 'i16':\\n HEAP16[((ptr) >> 1)] = value;\\n break;\\n case 'i32':\\n HEAP32[((ptr) >> 2)] = value;\\n break;\\n case 'i64':\\n (tempI64 = [value >>> 0, (tempDouble = value, (+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble) / (+4294967296)))), (+4294967295))) | 0) >>> 0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble))) >>> 0)) / (+4294967296)))))) >>> 0) : 0)], HEAP32[((ptr) >> 2)] = tempI64[0], HEAP32[(((ptr) + (4)) >> 2)] = tempI64[1]);\\n break;\\n case 'float':\\n HEAPF32[((ptr) >> 2)] = value;\\n break;\\n case 'double':\\n HEAPF64[((ptr) >> 3)] = value;\\n break;\\n default:\\n abort('invalid type for setValue: ' + type);\\n }\\n }\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length - 1) === '*') type = 'i32'; // pointers are 32-bit\\n switch (type) {\\n case 'i1':\\n HEAP8[(ptr)] = value;\\n break;\\n case 'i8':\\n HEAP8[(ptr)] = value;\\n break;\\n case 'i16':\\n HEAP16[((ptr) >> 1)] = value;\\n break;\\n case 'i32':\\n HEAP32[((ptr) >> 2)] = value;\\n break;\\n case 'i64':\\n (tempI64 = [value >>> 0, (tempDouble = value, (+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble) / (+4294967296)))), (+4294967295))) | 0) >>> 0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble))) >>> 0)) / (+4294967296)))))) >>> 0) : 0)], HEAP32[((ptr) >> 2)] = tempI64[0], HEAP32[(((ptr) + (4)) >> 2)] = tempI64[1]);\\n break;\\n case 'float':\\n HEAPF32[((ptr) >> 2)] = value;\\n break;\\n case 'double':\\n HEAPF64[((ptr) >> 3)] = value;\\n break;\\n default:\\n abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= 1.0 ? (tempDouble > 0.0 ? ((Math_min((+(Math_floor((tempDouble)/4294967296.0))), 4294967295.0))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/4294967296.0)))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length - 1) === '*') type = 'i32'; // pointers are 32-bit\\n switch (type) {\\n case 'i1':\\n HEAP8[(ptr)] = value;\\n break;\\n case 'i8':\\n HEAP8[(ptr)] = value;\\n break;\\n case 'i16':\\n HEAP16[((ptr) >> 1)] = value;\\n break;\\n case 'i32':\\n HEAP32[((ptr) >> 2)] = value;\\n break;\\n case 'i64':\\n (tempI64 = [value >>> 0, (tempDouble = value, (+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble) / (+4294967296)))), (+4294967295))) | 0) >>> 0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble))) >>> 0)) / (+4294967296)))))) >>> 0) : 0)], HEAP32[((ptr) >> 2)] = tempI64[0], HEAP32[(((ptr) + (4)) >> 2)] = tempI64[1]);\\n break;\\n case 'float':\\n HEAPF32[((ptr) >> 2)] = value;\\n break;\\n case 'double':\\n HEAPF64[((ptr) >> 3)] = value;\\n break;\\n default:\\n abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[((ptr)>>0)]=value; break;\\n case 'i8': HEAP8[((ptr)>>0)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"function setValue(ptr, value, type, noSafe) {\\n type = type || 'i8';\\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\\n switch(type) {\\n case 'i1': HEAP8[(ptr)]=value; break;\\n case 'i8': HEAP8[(ptr)]=value; break;\\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\\n case 'i32': HEAP32[((ptr)>>2)]=value; break;\\n case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math.abs(tempDouble))) >= (+(1)) ? (tempDouble > (+(0)) ? ((Math.min((+(Math.floor((tempDouble)/(+(4294967296))))), (+(4294967295))))|0)>>>0 : (~~((+(Math.ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+(4294967296)))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;\\n case 'float': HEAPF32[((ptr)>>2)]=value; break;\\n case 'double': HEAPF64[((ptr)>>3)]=value; break;\\n default: abort('invalid type for setValue: ' + type);\\n }\\n}\",\n \"set value(value) {}\",\n \"set type(value) {}\",\n \"setPackedArguments(stack, args, argsValue, argsCode) {\\n for (let i = 0; i < args.length; ++i) {\\n let val = args[i];\\n const tp = typeof val;\\n const valueOffset = argsValue + i * 8 /* TVMValue */;\\n const codeOffset = argsCode + i * 4 /* I32 */;\\n if (val instanceof NDArray) {\\n stack.storePtr(valueOffset, val.handle);\\n stack.storeI32(codeOffset, 13 /* TVMNDArrayHandle */);\\n }\\n else if (val instanceof Scalar) {\\n if (val.dtype.startsWith(\\\"int\\\") || val.dtype.startsWith(\\\"uint\\\")) {\\n stack.storeI64(valueOffset, val.value);\\n stack.storeI32(codeOffset, 0 /* Int */);\\n }\\n else if (val.dtype.startsWith(\\\"float\\\")) {\\n stack.storeF64(valueOffset, val.value);\\n stack.storeI32(codeOffset, 2 /* Float */);\\n }\\n else {\\n support_1.assert(val.dtype == \\\"handle\\\", \\\"Expect handle\\\");\\n stack.storePtr(valueOffset, val.value);\\n stack.storeI32(codeOffset, 3 /* TVMOpaqueHandle */);\\n }\\n }\\n else if (val instanceof DLContext) {\\n stack.storeI32(valueOffset, val.deviceType);\\n stack.storeI32(valueOffset + 4 /* I32 */, val.deviceType);\\n stack.storeI32(codeOffset, 6 /* TVMContext */);\\n }\\n else if (tp == \\\"number\\\") {\\n stack.storeF64(valueOffset, val);\\n stack.storeI32(codeOffset, 2 /* Float */);\\n // eslint-disable-next-line no-prototype-builtins\\n }\\n else if (tp == \\\"function\\\" && val.hasOwnProperty(\\\"_tvmPackedCell\\\")) {\\n stack.storePtr(valueOffset, val._tvmPackedCell.handle);\\n stack.storeI32(codeOffset, 10 /* TVMPackedFuncHandle */);\\n }\\n else if (val === null || val == undefined) {\\n stack.storePtr(valueOffset, 0);\\n stack.storeI32(codeOffset, 4 /* Null */);\\n }\\n else if (tp == \\\"string\\\") {\\n stack.allocThenSetArgString(valueOffset, val);\\n stack.storeI32(codeOffset, 11 /* TVMStr */);\\n }\\n else if (val instanceof Uint8Array) {\\n stack.allocThenSetArgBytes(valueOffset, val);\\n stack.storeI32(codeOffset, 12 /* TVMBytes */);\\n }\\n else if (val instanceof Function) {\\n val = this.toPackedFunc(val);\\n stack.tempArgs.push(val);\\n stack.storePtr(valueOffset, val._tvmPackedCell.handle);\\n stack.storeI32(codeOffset, 10 /* TVMPackedFuncHandle */);\\n }\\n else if (val instanceof Module) {\\n stack.storePtr(valueOffset, val.handle);\\n stack.storeI32(codeOffset, 9 /* TVMModuleHandle */);\\n }\\n else {\\n throw new Error(\\\"Unsupported argument type \\\" + tp);\\n }\\n }\\n }\",\n \"_set_value(value) {\\n if (!this._has_value_flag) {\\n this._update_size(1);\\n this._has_value_flag = true;\\n }\\n this._value = value;\\n }\",\n \"function TypedObjectSetScalar(descr, typedObj, offset, fromValue) {\\n assert(DESCR_KIND(descr) === JS_TYPEREPR_SCALAR_KIND,\\n \\\"Expected scalar type descriptor\\\");\\n var type = DESCR_TYPE(descr);\\n switch (type) {\\n case JS_SCALARTYPEREPR_INT8:\\n return Store_int8(typedObj, offset,\\n TO_INT32(fromValue) & 0xFF);\\n\\n case JS_SCALARTYPEREPR_UINT8:\\n return Store_uint8(typedObj, offset,\\n TO_UINT32(fromValue) & 0xFF);\\n\\n case JS_SCALARTYPEREPR_UINT8_CLAMPED:\\n var v = ClampToUint8(+fromValue);\\n return Store_int8(typedObj, offset, v);\\n\\n case JS_SCALARTYPEREPR_INT16:\\n return Store_int16(typedObj, offset,\\n TO_INT32(fromValue) & 0xFFFF);\\n\\n case JS_SCALARTYPEREPR_UINT16:\\n return Store_uint16(typedObj, offset,\\n TO_UINT32(fromValue) & 0xFFFF);\\n\\n case JS_SCALARTYPEREPR_INT32:\\n return Store_int32(typedObj, offset,\\n TO_INT32(fromValue));\\n\\n case JS_SCALARTYPEREPR_UINT32:\\n return Store_uint32(typedObj, offset,\\n TO_UINT32(fromValue));\\n\\n case JS_SCALARTYPEREPR_FLOAT32:\\n return Store_float32(typedObj, offset, +fromValue);\\n\\n case JS_SCALARTYPEREPR_FLOAT64:\\n return Store_float64(typedObj, offset, +fromValue);\\n }\\n\\n assert(false, \\\"Unhandled scalar type: \\\" + type);\\n return undefined;\\n}\",\n \"setNativeValue(element, value) {\\n const valueSetter = Object.getOwnPropertyDescriptor(element, 'value').set\\n const prototype = Object.getPrototypeOf(element)\\n const prototypeValueSetter = Object.getOwnPropertyDescriptor(prototype, 'value').set\\n\\n if (valueSetter && valueSetter !== prototypeValueSetter) {\\n prototypeValueSetter.call(element, value)\\n } else {\\n valueSetter.call(element, value)\\n }\\n }\",\n \"setValue(_value) {\\n if (this.isntUndefined(_value) && this.isValueObject(this.valueObj) && this.valueDiffers(_value)) {\\n this.__value = _value;\\n if (this.isObjectOrArray(_value)) {\\n this.valueObj.set(this.cloneObject(_value));\\n }\\n else {\\n this.valueObj.set(_value);\\n }\\n if (this.isFunction(this.refresh)) {\\n this.refresh();\\n }\\n else if (this.isFunction(this.refreshValue)) {\\n this.refreshValue();\\n }\\n }\\n }\",\n \"set(pointer, value) {\\n this.memory[pointer] = value;\\n }\",\n \"function getPureArraySetter( type ) {\\n\\n\\t \\tswitch ( type ) {\\n\\n\\t \\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t \\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t \\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t \\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t \\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t \\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t \\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t \\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t \\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t \\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t \\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t \\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t \\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t \\t}\\n\\n\\t }\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function getPureArraySetter( type ) {\\n\\t\\n\\t\\t\\tswitch ( type ) {\\n\\t\\n\\t\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\t\\n\\t\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\t\\n\\t\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\t\\n\\t\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\t\\n\\t\\t\\t}\\n\\t\\n\\t\\t}\",\n \"function setters(self, type, key, value, lifetime, cb, cas) {\\n\\tvar flag = 0;\\n\\tvar valuetype = typeof value;\\n\\tvar length;\\n\\n\\tif (Buffer.isBuffer(value)) {\\n\\t\\tflag = FLAG_BINARY;\\n\\t\\tvalue = value.toString('binary');\\n\\t}\\n\\telse if (valuetype !== 'string' && valuetype !== 'number') {\\n\\t\\tflag = FLAG_JSON;\\n\\t\\tvalue = JSON.stringify(value);\\n\\t}\\n\\telse\\n\\t\\tvalue = value.toString();\\n\\n\\tlength = Buffer.byteLength(value);\\n\\tif (length > self.maxValue) {\\n\\t\\tvar err = new Error('The length of the value is greater than ' + self.maxValue);\\n\\t\\tconsole.error(err);\\n\\t\\treturn cb ? cb(err) : self.onerror.trigger(err);\\n\\t}\\n\\n\\tvar cmd = [type, key, flag, lifetime, length].join(' ') + (cas ? ' ' + cas : '');\\n\\tcommand(self, {\\n\\t\\tkey: key,\\n\\t\\tcb: cb,\\n\\t\\tlifetime: lifetime,\\n\\t\\tvalue: value,\\n\\t\\tcas: cas,\\n\\t\\ttype: type,\\n\\t\\tcommand: cmd + LINEBREAK + value,\\n\\t\\tredundancy: cmd + NOREPLY + LINEBREAK + value\\n\\t});\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\t\\tswitch ( type ) {\\n\\n\\t\\t\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\t\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\t\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\t\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\t\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\t\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\t\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\t\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\t\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\t\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\t\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\t\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\t\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e: return setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60: return setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValue4iv; // _VEC4\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter(type) {\\n\\n\\tswitch (type) {\\n\\n\\t\\tcase 0x1406:\\n\\t\\t\\treturn setValue1fv; // FLOAT\\n\\t\\tcase 0x8b50:\\n\\t\\t\\treturn setValueV2a; // _VEC2\\n\\t\\tcase 0x8b51:\\n\\t\\t\\treturn setValueV3a; // _VEC3\\n\\t\\tcase 0x8b52:\\n\\t\\t\\treturn setValueV4a; // _VEC4\\n\\n\\t\\tcase 0x8b5a:\\n\\t\\t\\treturn setValueM2a; // _MAT2\\n\\t\\tcase 0x8b5b:\\n\\t\\t\\treturn setValueM3a; // _MAT3\\n\\t\\tcase 0x8b5c:\\n\\t\\t\\treturn setValueM4a; // _MAT4\\n\\n\\t\\tcase 0x8b5e:\\n\\t\\t\\treturn setValueT1a; // SAMPLER_2D\\n\\t\\tcase 0x8b60:\\n\\t\\t\\treturn setValueT6a; // SAMPLER_CUBE\\n\\n\\t\\tcase 0x1404:case 0x8b56:\\n\\t\\t\\treturn setValue1iv; // INT, BOOL\\n\\t\\tcase 0x8b53:case 0x8b57:\\n\\t\\t\\treturn setValue2iv; // _VEC2\\n\\t\\tcase 0x8b54:case 0x8b58:\\n\\t\\t\\treturn setValue3iv; // _VEC3\\n\\t\\tcase 0x8b55:case 0x8b59:\\n\\t\\t\\treturn setValue4iv; // _VEC4\\n\\n\\t}\\n}\",\n \"set intValue(value) {}\",\n \"setValueObj(_valueObj) {\\n if (this.isValueObject(_valueObj)) {\\n this.__valueObj = _valueObj;\\n this.setValue(_valueObj.value);\\n }\\n }\",\n \"function getPureArraySetter( type ) {\\n\\n\\tswitch ( type ) {\\n\\n\\t\\tcase 0x1406: return setValueV1fArray; // FLOAT\\n\\t\\tcase 0x8b50: return setValueV2fArray; // _VEC2\\n\\t\\tcase 0x8b51: return setValueV3fArray; // _VEC3\\n\\t\\tcase 0x8b52: return setValueV4fArray; // _VEC4\\n\\n\\t\\tcase 0x8b5a: return setValueM2Array; // _MAT2\\n\\t\\tcase 0x8b5b: return setValueM3Array; // _MAT3\\n\\t\\tcase 0x8b5c: return setValueM4Array; // _MAT4\\n\\n\\t\\tcase 0x1404: case 0x8b56: return setValueV1iArray; // INT, BOOL\\n\\t\\tcase 0x8b53: case 0x8b57: return setValueV2iArray; // _VEC2\\n\\t\\tcase 0x8b54: case 0x8b58: return setValueV3iArray; // _VEC3\\n\\t\\tcase 0x8b55: case 0x8b59: return setValueV4iArray; // _VEC4\\n\\n\\t\\tcase 0x1405: return setValueV1uiArray; // UINT\\n\\t\\tcase 0x8dc6: return setValueV2uiArray; // _VEC2\\n\\t\\tcase 0x8dc7: return setValueV3uiArray; // _VEC3\\n\\t\\tcase 0x8dc8: return setValueV4uiArray; // _VEC4\\n\\n\\t\\tcase 0x8b5e: // SAMPLER_2D\\n\\t\\tcase 0x8d66: // SAMPLER_EXTERNAL_OES\\n\\t\\tcase 0x8dca: // INT_SAMPLER_2D\\n\\t\\tcase 0x8dd2: // UNSIGNED_INT_SAMPLER_2D\\n\\t\\tcase 0x8b62: // SAMPLER_2D_SHADOW\\n\\t\\t\\treturn setValueT1Array;\\n\\n\\t\\tcase 0x8b5f: // SAMPLER_3D\\n\\t\\tcase 0x8dcb: // INT_SAMPLER_3D\\n\\t\\tcase 0x8dd3: // UNSIGNED_INT_SAMPLER_3D\\n\\t\\t\\treturn setValueT3DArray;\\n\\n\\t\\tcase 0x8b60: // SAMPLER_CUBE\\n\\t\\tcase 0x8dcc: // INT_SAMPLER_CUBE\\n\\t\\tcase 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE\\n\\t\\tcase 0x8dc5: // SAMPLER_CUBE_SHADOW\\n\\t\\t\\treturn setValueT6Array;\\n\\n\\t\\tcase 0x8dc1: // SAMPLER_2D_ARRAY\\n\\t\\tcase 0x8dcf: // INT_SAMPLER_2D_ARRAY\\n\\t\\tcase 0x8dd7: // UNSIGNED_INT_SAMPLER_2D_ARRAY\\n\\t\\tcase 0x8dc4: // SAMPLER_2D_ARRAY_SHADOW\\n\\t\\t\\treturn setValueT2DArrayArray;\\n\\n\\t}\\n\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValueV1fArray; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2fArray; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3fArray; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4fArray; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2Array; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3Array; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4Array; // _MAT4\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValueV1iArray; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValueV2iArray; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValueV3iArray; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValueV4iArray; // _VEC4\\n\\n\\t\\t\\tcase 0x1405: return setValueV1uiArray; // UINT\\n\\t\\t\\tcase 0x8dc6: return setValueV2uiArray; // _VEC2\\n\\t\\t\\tcase 0x8dc7: return setValueV3uiArray; // _VEC3\\n\\t\\t\\tcase 0x8dc8: return setValueV4uiArray; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5e: // SAMPLER_2D\\n\\t\\t\\tcase 0x8d66: // SAMPLER_EXTERNAL_OES\\n\\t\\t\\tcase 0x8dca: // INT_SAMPLER_2D\\n\\t\\t\\tcase 0x8dd2: // UNSIGNED_INT_SAMPLER_2D\\n\\t\\t\\tcase 0x8b62: // SAMPLER_2D_SHADOW\\n\\t\\t\\t\\treturn setValueT1Array;\\n\\n\\t\\t\\tcase 0x8b5f: // SAMPLER_3D\\n\\t\\t\\tcase 0x8dcb: // INT_SAMPLER_3D\\n\\t\\t\\tcase 0x8dd3: // UNSIGNED_INT_SAMPLER_3D\\n\\t\\t\\t\\treturn setValueT3DArray;\\n\\n\\t\\t\\tcase 0x8b60: // SAMPLER_CUBE\\n\\t\\t\\tcase 0x8dcc: // INT_SAMPLER_CUBE\\n\\t\\t\\tcase 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE\\n\\t\\t\\tcase 0x8dc5: // SAMPLER_CUBE_SHADOW\\n\\t\\t\\t\\treturn setValueT6Array;\\n\\n\\t\\t\\tcase 0x8dc1: // SAMPLER_2D_ARRAY\\n\\t\\t\\tcase 0x8dcf: // INT_SAMPLER_2D_ARRAY\\n\\t\\t\\tcase 0x8dd7: // UNSIGNED_INT_SAMPLER_2D_ARRAY\\n\\t\\t\\tcase 0x8dc4: // SAMPLER_2D_ARRAY_SHADOW\\n\\t\\t\\t\\treturn setValueT2DArrayArray;\\n\\n\\t\\t}\\n\\n\\t}\",\n \"setCachedValue( accTypeEnumIndex, characteristicString, value, callback )\\n {\\n let self = this;\\n\\n if ( self.hV.statusMsg == \\\"TRUE\\\" )\\n self.log.info( chalk.blue( `Setting (Cached) ${ self.displayName } ${ characteristicString }` ) + ` ${ value }` );\\n else\\n if ( settings.cmd4Dbg ) self.log.debug( `setCachedvalue accTypeEnumIndex:( ${ accTypeEnumIndex } )-\\\"${ characteristicString }\\\" function for: ${ self.displayName } value: ${ value }` );\\n\\n\\n // Save the cached value.\\n // Fakegato does not need to be updated as that is done on a \\\"Get\\\".\\n self.cmd4Storage.setStoredValueForIndex( accTypeEnumIndex, value );\\n\\n let relatedCurrentAccTypeEnumIndex = this.getDevicesRelatedCurrentAccTypeEnumIndex( accTypeEnumIndex );\\n\\n // We are currently tring to set a cached characteristics \\n // like \\\"Target*\\\".\\n // There is no way for its relatedCurrentAccTypeEnumIndex characteristic like \\\"Current*\\\"\\n // to be set if cached or Polled (with the exception below).\\n if ( relatedCurrentAccTypeEnumIndex != null )\\n {\\n // We are in a \\\"Set\\\" but this applies to the \\\"Get\\\" for why we would need to\\n // set the relatedCurrentAccTypeEnumIndex Characteristic as well.\\n\\n if ( self.listOfPollingCharacteristics[ relatedCurrentAccTypeEnumIndex ])\\n {\\n let relatedCharacteristicString = CMD4_ACC_TYPE_ENUM.properties[ relatedCurrentAccTypeEnumIndex ].type;\\n self.log.info( chalk.blue( `Also Setting (Cached) ${ self.displayName } ${ relatedCharacteristicString }` ) + ` ${ value }` );\\n self.cmd4Storage.setStoredValueForIndex( relatedCurrentAccTypeEnumIndex, value );\\n }\\n }\\n\\n callback( null );\\n }\",\n \"function TypedObjectSet(descr, typedObj, offset, name, fromValue) {\\n if (!TypedObjectIsAttached(typedObj))\\n ThrowTypeError(JSMSG_TYPEDOBJECT_HANDLE_UNATTACHED);\\n\\n switch (DESCR_KIND(descr)) {\\n case JS_TYPEREPR_SCALAR_KIND:\\n TypedObjectSetScalar(descr, typedObj, offset, fromValue);\\n return;\\n\\n case JS_TYPEREPR_REFERENCE_KIND:\\n TypedObjectSetReference(descr, typedObj, offset, name, fromValue);\\n return;\\n\\n case JS_TYPEREPR_ARRAY_KIND:\\n var length = DESCR_ARRAY_LENGTH(descr);\\n if (TypedObjectSetArray(descr, length, typedObj, offset, fromValue))\\n return;\\n break;\\n\\n case JS_TYPEREPR_STRUCT_KIND:\\n if (!IsObject(fromValue))\\n break;\\n\\n // Adapt each field.\\n var fieldNames = DESCR_STRUCT_FIELD_NAMES(descr);\\n var fieldDescrs = DESCR_STRUCT_FIELD_TYPES(descr);\\n var fieldOffsets = DESCR_STRUCT_FIELD_OFFSETS(descr);\\n for (var i = 0; i < fieldNames.length; i++) {\\n var fieldName = fieldNames[i];\\n var fieldDescr = fieldDescrs[i];\\n var fieldOffset = fieldOffsets[i];\\n var fieldValue = fromValue[fieldName];\\n TypedObjectSet(fieldDescr, typedObj, offset + fieldOffset, fieldName, fieldValue);\\n }\\n return;\\n }\\n\\n ThrowTypeError(JSMSG_CANT_CONVERT_TO,\\n typeof(fromValue),\\n DESCR_STRING_REPR(descr));\\n}\",\n \"setValue(val) {\\n this.binder.fieldValue = val;\\n }\",\n \"setValue(val) {\\n this.binder.fieldValue = val;\\n }\",\n \"setValue(val) {\\n this.binder.fieldValue = val;\\n }\",\n \"function setDataType(valueName, valueModel){\\n switch(valueName){\\n case \\\"on\\\":\\n case \\\"reachable\\\":\\n valueModel.set(\\\"number\\\", {min: 0, max: 1, step: 1, unit: \\\"int\\\"});\\n break;\\n case \\\"bri\\\":\\n case \\\"sat\\\":\\n valueModel.set(\\\"number\\\", {min: 0, max: 255, step: 1, unit: \\\"int\\\"});\\n break;\\n case \\\"hue\\\":\\n valueModel.set(\\\"number\\\", {min: 0, max: 65535, step: 1, unit: \\\"int\\\"});\\n break;\\n default:\\n valueModel.set(\\\"string\\\", {max: 99});\\n break;\\n }\\n}\",\n \"setValue(value) {\\n this.value = value;\\n }\",\n \"setValue(value) {\\n this._value = value;\\n }\",\n \"function setVal(obj,val)\\n{\\n obj.val(val);\\n}\",\n \"function writeDataForType( typeDefinition, value, byteArray, offset ) {\\n const type = getDataTypeFromDefinition( typeDefinition );\\n const length = getLengthFromDefinition( typeDefinition );\\n\\n let writeOffset = offset;\\n\\n if ( offset + ( length - 1 ) >= byteArray.length ) {\\n return 0;\\n }\\n const littleEndian = isDefinitionForLittleEndian( typeDefinition );\\n const isFloat = floatingPointTypes.includes( type );\\n const isUnsigned = unsignedTypes.includes( type );\\n const dataView = isFloat || sixtyFourBitTypes.includes( type ) ? new DataView( byteArray.buffer ) : null;\\n\\n switch ( type ) {\\n default:\\n return writeOffset;\\n\\n // NOTE we duplicate between single and list based values to\\n // omit the need for a slicing operation on the ByteArray\\n // 8-bit String type\\n case types.CHAR:\\n if ( length === 1 ) {\\n byteArray[ writeOffset ] = value.charCodeAt( 0 );\\n } else {\\n for ( let i = 0; i < length; ++i ) {\\n byteArray[ writeOffset + i ] = value.charCodeAt( i );\\n }\\n }\\n writeOffset += length;\\n break;\\n\\n // 8-bit Number types\\n case types.BYTE:\\n case types.INT8:\\n case types.UINT8:\\n if ( length === 1 ) {\\n byteArray[ writeOffset ] = value;\\n } else {\\n for ( let i = 0; i < length; ++i ) {\\n byteArray[ writeOffset + i ] = value[ i ];\\n }\\n }\\n writeOffset += length;\\n break;\\n\\n // NOTE the large bit shift statements aren't the most readable, but here we\\n // take comfort in knowing that their performance is nice enough given\\n // that this method is already abstracted behind several subroutines\\n // 16-bit Number types\\n case types.SHORT:\\n case types.INT16:\\n case types.UINT16:\\n writeMultiple( writeOffset, length, 2, ( i, w ) => {\\n const valueToWrite = length === 1 ? value : value[ i ];\\n if ( littleEndian ) {\\n byteArray[ w + 1 ] = ( valueToWrite >> 8 ) & 0xff;\\n byteArray[ w ] = ( valueToWrite & 0xff );\\n } else {\\n byteArray[ w ] = ( valueToWrite >> 8 ) & 0xff;\\n byteArray[ w + 1 ] = ( valueToWrite & 0xff );\\n }\\n });\\n writeOffset += length * 2;\\n break;\\n\\n // 24-bit Number types (this is more meaningful to those dealing with audio formats)\\n case types.INT24:\\n case types.UINT24:\\n writeMultiple( writeOffset, length, 3, ( i, w ) => {\\n const valueToWrite = length === 1 ? value : value[ i ];\\n if ( littleEndian ) {\\n byteArray[ w + 2 ] = ( valueToWrite >> 16 ) & 0xff;\\n byteArray[ w + 1 ] = ( valueToWrite >> 8 ) & 0xff;\\n byteArray[ w ] = ( valueToWrite & 0xff );\\n } else {\\n byteArray[ w ] = ( valueToWrite >> 16 ) & 0xff;\\n byteArray[ w + 1 ] = ( valueToWrite >> 8 ) & 0xff;\\n byteArray[ w + 2 ] = ( valueToWrite & 0xff );\\n }\\n });\\n writeOffset += length * 3;\\n break;\\n\\n // 32-bit integer Number types\\n case types.INT32:\\n case types.UINT32:\\n case types.LONG:\\n case types.ULONG:\\n case types.FLOAT:\\n case types.FLOAT32:\\n writeMultiple( writeOffset, length, 4, ( i, w ) => {\\n const valueToWrite = length === 1 ? value : value[ i ];\\n if ( isFloat ) {\\n dataView.setFloat32( w, valueToWrite, littleEndian );\\n } else {\\n if ( littleEndian ) {\\n byteArray[ w + 3 ] = ( valueToWrite & 0xff000000 ) >> 24;\\n byteArray[ w + 2 ] = ( valueToWrite & 0x00ff0000 ) >> 16;\\n byteArray[ w + 1 ] = ( valueToWrite & 0x0000ff00 ) >> 8;\\n byteArray[ w ] = ( valueToWrite & 0x000000ff );\\n } else {\\n byteArray[ w ] = ( valueToWrite & 0xff000000 ) >> 24;\\n byteArray[ w + 1 ] = ( valueToWrite & 0x00ff0000 ) >> 16;\\n byteArray[ w + 2 ] = ( valueToWrite & 0x0000ff00 ) >> 8;\\n byteArray[ w + 3 ] = ( valueToWrite & 0x000000ff );\\n }\\n }\\n });\\n writeOffset += length * 4;\\n break;\\n\\n // 64-bit Number types\\n case types.INT64:\\n case types.UINT64:\\n case types.LONGLONG:\\n case types.ULONGLONG:\\n case types.DOUBLE:\\n case types.FLOAT64:\\n writeMultiple( writeOffset, length, 8, ( i, w ) => {\\n const valueToWrite = length === 1 ? value : value[ i ];\\n if ( isFloat ) {\\n dataView.setFloat64( w, valueToWrite, littleEndian );\\n } else {\\n dataView[ isUnsigned ? 'setBigUint64' : 'setBigInt64' ]( w, BigInt( valueToWrite ), littleEndian );\\n }\\n });\\n writeOffset += length * 8;\\n break;\\n }\\n return writeOffset;\\n}\",\n \"function setCache(curType, id, key, value) {\\n if (id && id != -1 && RandomStorage[curType]) {\\n RandomStorage[curType][key + id] = value; }\\n}\",\n \"function getPureArraySetter( type ) {\\n\\n\\t\\tswitch ( type ) {\\n\\n\\t\\t\\tcase 0x1406: return setValueV1fArray; // FLOAT\\n\\t\\t\\tcase 0x8b50: return setValueV2fArray; // _VEC2\\n\\t\\t\\tcase 0x8b51: return setValueV3fArray; // _VEC3\\n\\t\\t\\tcase 0x8b52: return setValueV4fArray; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5a: return setValueM2Array; // _MAT2\\n\\t\\t\\tcase 0x8b5b: return setValueM3Array; // _MAT3\\n\\t\\t\\tcase 0x8b5c: return setValueM4Array; // _MAT4\\n\\n\\t\\t\\tcase 0x1404: case 0x8b56: return setValueV1iArray; // INT, BOOL\\n\\t\\t\\tcase 0x8b53: case 0x8b57: return setValueV2iArray; // _VEC2\\n\\t\\t\\tcase 0x8b54: case 0x8b58: return setValueV3iArray; // _VEC3\\n\\t\\t\\tcase 0x8b55: case 0x8b59: return setValueV4iArray; // _VEC4\\n\\n\\t\\t\\tcase 0x8b5e: // SAMPLER_2D\\n\\t\\t\\tcase 0x8d66: // SAMPLER_EXTERNAL_OES\\n\\t\\t\\tcase 0x8dca: // INT_SAMPLER_2D\\n\\t\\t\\tcase 0x8dd2: // UNSIGNED_INT_SAMPLER_2D\\n\\t\\t\\tcase 0x8b62: // SAMPLER_2D_SHADOW\\n\\t\\t\\t\\treturn setValueT1Array;\\n\\n\\t\\t\\tcase 0x8b60: // SAMPLER_CUBE\\n\\t\\t\\tcase 0x8dcc: // INT_SAMPLER_CUBE\\n\\t\\t\\tcase 0x8dd4: // UNSIGNED_INT_SAMPLER_CUBE\\n\\t\\t\\tcase 0x8dc5: // SAMPLER_CUBE_SHADOW\\n\\t\\t\\t\\treturn setValueT6Array;\\n\\n\\t\\t}\\n\\n\\t}\",\n \"setValue(value) {\\n this.value = value;\\n this.doubleNumber = this.value * 2;\\n }\",\n \"create(_id, _data, _type) {\\n if (!_type) {\\n HValue.new(_id, _data);\\n }\\n else if (_type === 1) {\\n HPushValue.new(_id, _data);\\n }\\n else if (_type === 2) {\\n HPullValue.new(_id, _data);\\n }\\n else {\\n console.warn(`Unknown value type: ${_type}`);\\n }\\n }\",\n \"function setNodeOptimizedVal(node, val) {\\n node.type = typeof val;\\n node.value = val;\\n node.wasOptimized = true;\\n delete node.left;\\n delete node.right;\\n}\",\n \"set x(value) {}\",\n \"set Custom(value) {}\",\n \"set longValue(value) {}\",\n \"set this[string](value) {}\",\n \"function setByUuid (attrs, obj, name, value, actualType) {\\n var uuid = value.uuid;\\n var type = JS.getClassByName(actualType);\\n if (type) {\\n if (Fire.isChildClassOf(type, Fire.RawAsset)) {\\n setAsset(obj, name, uuid, type);\\n }\\n else if (Fire.isChildClassOf(type, Fire.Runtime.NodeWrapper)) {\\n var instance = Fire.engine.getInstanceById(uuid);\\n if (instance && attrs && attrs.isRuntimeNode) {\\n obj[name] = instance.targetN;\\n }\\n else {\\n obj[name] = instance;\\n }\\n }\\n else {\\n // just a common primitive object\\n obj[name] = value;\\n }\\n }\\n else {\\n Fire.warn('Unknown type to apply: ' + actualType);\\n }\\n}\",\n \"function setCType(prop, classContext) {\\n\\tprop.isPtr = false;\\n\\tprop.CType = undefined;\\n\\tprop.CConstType = undefined;\\n\\tprop.CBaseType = undefined;\\n\\n\\t/*\\n\\t * map basic JSON types\\n\\t */\\n\\tswitch ( prop.type ) {\\n\\tcase 'string':\\n\\t\\tprop.CBaseType = \\\"std::string\\\";\\n\\t\\tprop.isPtr = true;\\n\\t\\tbreak;\\n\\n\\tcase 'number':\\n\\t\\tprop.CBaseType = \\\"double\\\";\\n\\t\\tbreak;\\n\\n\\tcase 'integer':\\n\\t\\tprop.CBaseType = \\\"int64_t\\\";\\n\\t\\tbreak;\\n\\n\\tcase 'boolean':\\n\\t\\tprop.CBaseType = \\\"bool\\\";\\n\\t\\tbreak;\\n\\n\\tcase 'object':\\n\\t\\tprop.isPtr = true;\\n\\t\\tprop.CBaseType = prop.className;\\n\\t\\tbreak;\\n\\n\\tcase 'array':\\n\\t\\tprop.isPtr = true;\\n\\t\\t// get type from array items\\n\\t\\tprop.CBaseType = \\\"std::vector<\\\" + prop.items.CType + \\\">\\\";\\n\\t\\tbreak;\\n\\n\\tcase 'any':\\n\\t\\tprop.isPtr = true;\\n\\t\\tprop.CBaseType = \\\"std::string\\\"; // use the JSON text\\n\\t\\tbreak;\\n\\n\\tdefault:\\n\\t\\t// this should never happen\\n\\t\\tbreak;\\n\\t}\\n\\t\\n\\t/*\\n\\t * handle extended types\\n\\t */\\n\\t\\n\\t// ID\\n\\tif ( prop.type == 'string' && prop.exttype == 'id' ) {\\n\\t\\tprop.CBaseType = 'ConnectedVision::id_t';\\n\\t\\tprop.isPtr = false;\\n\\t}\\n\\n\\t\\n\\t// timestamp\\n\\tif ( prop.type == 'integer' && prop.exttype == 'timestamp' ) {\\n\\t\\tprop.CBaseType = 'ConnectedVision::timestamp_t';\\n\\t\\tprop.isPtr = false;\\n\\t}\\n\\t\\n\\t// enforce exttype\\n\\tif ( !prop.exttype )\\n\\t\\tprop.exttype = prop.type;\\n\\t\\n\\t// derive C/C++ type from base type\\n\\tif ( prop.isPtr ) {\\n\\t\\tprop.CType = 'boost::shared_ptr<' + prop.CBaseType + '>';\\n\\t\\tprop.CConstType = 'boost::shared_ptr<const ' + prop.CBaseType + '>';\\n\\t} else {\\n\\t\\tprop.CType = prop.CBaseType;\\n\\t\\tprop.CConstType = prop.CBaseType;\\n\\t}\\n}\",\n \"setValue(value) {\\n // Save old values in computeCell for comparison checks\\n for (const computeCell of this.computeCells) {\\n computeCell.saveValue();\\n }\\n this.value = value;\\n this.onUpdate();\\n }\",\n \"setAttrValue(attr, value) {\\n this._ensureUnpacked();\\n this.unpackedAttrs.set(attr.name, value);\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70037204","0.69912416","0.69912416","0.69912416","0.69762725","0.69762725","0.69762725","0.6955605","0.6955605","0.6955605","0.6955605","0.6949471","0.6949471","0.6949471","0.6913426","0.6913426","0.6913426","0.69094163","0.68989986","0.6898297","0.6898297","0.6898297","0.68836707","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.68786746","0.6870284","0.68685925","0.58687896","0.5770023","0.57538867","0.56516296","0.5529725","0.55253994","0.5484472","0.53751314","0.53704864","0.5318775","0.5318775","0.5318775","0.5318775","0.5318775","0.5318775","0.5318775","0.5318775","0.5316641","0.5298645","0.5293506","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.52709997","0.5188635","0.51254064","0.5084397","0.50779194","0.50726086","0.5006584","0.49690092","0.49593356","0.49593356","0.49593356","0.49474466","0.49466604","0.4945805","0.49339375","0.49068293","0.4848106","0.48474455","0.4842638","0.48345596","0.4828537","0.4816862","0.48136067","0.4793864","0.4782936","0.4779185","0.47767657","0.47703895","0.47617954"],"string":"[\n \"0.70037204\",\n \"0.69912416\",\n \"0.69912416\",\n \"0.69912416\",\n \"0.69762725\",\n \"0.69762725\",\n \"0.69762725\",\n \"0.6955605\",\n \"0.6955605\",\n \"0.6955605\",\n \"0.6955605\",\n \"0.6949471\",\n \"0.6949471\",\n \"0.6949471\",\n \"0.6913426\",\n \"0.6913426\",\n \"0.6913426\",\n \"0.69094163\",\n \"0.68989986\",\n \"0.6898297\",\n \"0.6898297\",\n \"0.6898297\",\n \"0.68836707\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.68786746\",\n \"0.6870284\",\n \"0.68685925\",\n \"0.58687896\",\n \"0.5770023\",\n \"0.57538867\",\n \"0.56516296\",\n \"0.5529725\",\n \"0.55253994\",\n \"0.5484472\",\n \"0.53751314\",\n \"0.53704864\",\n \"0.5318775\",\n \"0.5318775\",\n \"0.5318775\",\n \"0.5318775\",\n \"0.5318775\",\n \"0.5318775\",\n \"0.5318775\",\n \"0.5318775\",\n \"0.5316641\",\n \"0.5298645\",\n \"0.5293506\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.52709997\",\n \"0.5188635\",\n \"0.51254064\",\n \"0.5084397\",\n \"0.50779194\",\n \"0.50726086\",\n \"0.5006584\",\n \"0.49690092\",\n \"0.49593356\",\n \"0.49593356\",\n \"0.49593356\",\n \"0.49474466\",\n \"0.49466604\",\n \"0.4945805\",\n \"0.49339375\",\n \"0.49068293\",\n \"0.4848106\",\n \"0.48474455\",\n \"0.4842638\",\n \"0.48345596\",\n \"0.4828537\",\n \"0.4816862\",\n \"0.48136067\",\n \"0.4793864\",\n \"0.4782936\",\n \"0.4779185\",\n \"0.47767657\",\n \"0.47703895\",\n \"0.47617954\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6889543"},"document_rank":{"kind":"string","value":"22"}}},{"rowIdx":4676,"cells":{"query":{"kind":"string","value":"allocate(): This is for internal use. You can use it yourself as well, but the interface is a little tricky (see docs right below). The reason is that it is optimized for multiple syntaxes to save space in generated code. So you should normally not use allocate(), and instead allocate memory using _malloc(), initialize it with setValue(), and so forth."},"document":{"kind":"string","value":"function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\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 _allocate(bytes) {\n var address = Module._malloc(bytes.length);\n Module.HEAPU8.set(bytes, address);\n\n return address;\n }","constructor() {\n this.length = 0;\n this._capacity = 0;\n // Sets up the pointer where the memory is allocated\n this.ptr = memory.allocate(this.length);\n }","function malloc(size) {\n return new buffer_1.Buffer(size);\n}","Allocate() {\n\n }","function Object_alloc(){}","allocate(size) {\n if (this.head + size > this.memory.length) {\n return null;\n }\n\n let start = this.head;\n\n this.head += size;\n return start;\n }","function getMemory(size) {\nif (!staticSealed) return staticAlloc(size);\nif (!runtimeInitialized) return dynamicAlloc(size);\nreturn _malloc(size);\n}","function BasicObject_alloc(){}","smartMalloc(size) {\n const w = this.wasm\n const ptr = w._malloc(size)\n setTimeout(() => {\n w._free(ptr)\n }, 0)\n return ptr\n }","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [typeof _malloc === 'function' ? _malloc : Runtime.staticAlloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function getMemory(size) {\n\t if (!runtimeInitialized) return dynamicAlloc(size);\n\t return _malloc(size);\n\t}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n HEAPU8.set(new Uint8Array(slab), ret);\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","allocate() {\n // allocate memory as per request\n this.allocation[this.processId] = sumArrays(this.allocation[this.processId], this.request)\n\n // check if allocation == max, then free the resources\n if (this.allocation[this.processId].equals(this.max[this.processId])) {\n // increase available resources\n this.available = sumArrays(this.available, this.allocation[this.processId])\n\n // set a fleag for the finished process\n this.finished[this.processId] = true\n\n // set allocation for the finished process to 0\n this.allocation[this.processId].fill(0)\n\n // set max for the finished process to 0\n this.max[this.processId].fill(0)\n }\n\n // decrease available resources\n this.available = subtractArrays(this.available, this.request)\n }","function getMemory(size) {\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n }","function getMemory(size) {\r\n if (!runtimeInitialized) return dynamicAlloc(size);\r\n return _malloc(size);\r\n}","function allocate(slab, types, allocator) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n\n if (zeroinit) {\n _memset(ret, 0, size);\n return ret;\n }\n \n var i = 0, type;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n assert(type, 'Must know what type to store in allocate!');\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n i += Runtime.getNativeTypeSize(type);\n }\n\n return ret;\n}","function AllocatedBuf(length) {\n this.length = length;\n this.address = _malloc(length);\n }","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n HEAPU8.set(new Uint8Array(slab), ret);\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n HEAPU8.set(new Uint8Array(slab), ret);\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n HEAPU8.set(new Uint8Array(slab), ret);\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n HEAPU8.set(new Uint8Array(slab), ret);\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function AllocatedBuf(length) {\n\t\tthis.length = length;\n\t\tthis.address = _malloc(length);\n\t}","function AllocatedBuf(length) {\n\t\tthis.length = length;\n\t\tthis.address = _malloc(length);\n\t}","function AllocatedBuf(length) {\n\t\tthis.length = length;\n\t\tthis.address = _malloc(length);\n\t}","function AllocatedBuf(length) {\n\t\tthis.length = length;\n\t\tthis.address = _malloc(length);\n\t}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n var singleType = typeof types === 'string' ? types : null;\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n setValue(ret+i, curr, type);\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret,\n stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr) >> 2)] = 0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++) | 0)] = 0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0,\n type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret + i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret,\n stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr) >> 2)] = 0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++) | 0)] = 0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0,\n type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret + i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)|0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret, stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr)>>2)]=0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++)>>0)]=0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0, type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n}","function getMemory(size) {\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret,\n stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr) >> 2)] = 0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++) | 0)] = 0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0,\n type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret + i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n }","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n var ptr = ret,\n stop;\n assert((ret & 3) == 0);\n stop = ret + (size & ~3);\n for (; ptr < stop; ptr += 4) {\n HEAP32[((ptr) >> 2)] = 0;\n }\n stop = ret + size;\n while (ptr < stop) {\n HEAP8[((ptr++) >> 0)] = 0;\n }\n return ret;\n }\n\n if (singleType === 'i8') {\n if (slab.subarray || slab.slice) {\n HEAPU8.set(slab, ret);\n } else {\n HEAPU8.set(new Uint8Array(slab), ret);\n }\n return ret;\n }\n\n var i = 0,\n type, typeSize, previousType;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret + i, curr, type);\n\n // no need to look up size unless type changes, so cache it\n if (previousType !== type) {\n typeSize = Runtime.getNativeTypeSize(type);\n previousType = type;\n }\n i += typeSize;\n }\n\n return ret;\n }","function allocate(slab, types, allocator, ptr) {\n var zeroinit, size;\n if (typeof slab === 'number') {\n zeroinit = true;\n size = slab;\n } else {\n zeroinit = false;\n size = slab.length;\n }\n\n var singleType = typeof types === 'string' ? types : null;\n\n var ret;\n if (allocator == ALLOC_NONE) {\n ret = ptr;\n } else {\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\n }\n\n if (zeroinit) {\n _memset(ret, 0, size);\n return ret;\n }\n \n var i = 0, type;\n while (i < size) {\n var curr = slab[i];\n\n if (typeof curr === 'function') {\n curr = Runtime.getFunctionIndex(curr);\n }\n\n type = singleType || types[i];\n if (type === 0) {\n i++;\n continue;\n }\n\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\n\n setValue(ret+i, curr, type);\n i += Runtime.getNativeTypeSize(type);\n }\n\n return ret;\n}","constructor() {\n //starts array as empty\n this.length = 0;\n //capacity will be value for length of items in array + any empty spaces\n this._capacity = 0;\n //allocates the space for the length of new array, as long as there is room in memory\n this.ptr = newMem.allocate(this.length);\n }","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return staticAlloc(size);\n if (!runtimeInitialized) return dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if (!runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if (!runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if (!runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n}","function initialize(width, height) {\n\t\t\tthat.width = width;\n\t\t\tthat.height = height;\n\t\t\t\n\t\t\tif (width * height > that.size) {\n\t\t\t\tthat.free();\n\t\t\t\tthat.size = width * height;\n\t\t\t\tthat.heapPtr = Wasm._malloc(that.size);\n\t\t\t}\n\t\t}","function allocate(height, length) {\n\tvar node = new Array(length);\n\tnode.height = height;\n\tif (height > 0) {\n\t\tnode.sizes = new Array(length);\n\t}\n\treturn node;\n}","Allocate()\n\t{\n\t\t//\tcreate a promise function with the Resolve & Reject functions attached so we can call them\n\t\tfunction CreatePromise()\n\t\t{\n\t\t\tlet Callbacks = {};\n\t\t\tlet PromiseHandler = function (Resolve,Reject)\n\t\t\t{\n\t\t\t\tCallbacks.Resolve = Resolve;\n\t\t\t\tCallbacks.Reject = Reject;\n\t\t\t}\n\t\t\tlet Prom = new Promise(PromiseHandler);\n\t\t\tProm.Resolve = Callbacks.Resolve;\n\t\t\tProm.Reject = Callbacks.Reject;\n\t\t\treturn Prom;\n\t\t}\n\t\t\n\t\tconst NewPromise = CreatePromise();\n\t\tthis.Promises.push( NewPromise );\n\t\treturn NewPromise;\n\t}","function NilClass_alloc(){}","function $fe91$var$allocUnsafe(that, size) {\n $fe91$var$assertSize(size);\n that = $fe91$var$createBuffer(that, size < 0 ? 0 : $fe91$var$checked(size) | 0);\n\n if (!$fe91$var$Buffer.TYPED_ARRAY_SUPPORT) {\n for (var i = 0; i < size; ++i) {\n that[i] = 0;\n }\n }\n\n return that;\n}","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n }","function AllocateArrayBuffer(constructor, byteLength) {\n var obj = OrdinaryCreateFromConstructor(constructor, \"%ArrayBufferPrototype%\", ['ArrayBufferData', 'ArrayBufferByteLength']);\n Assert(byteLength >= 0);\n var block = CreateByteDataBlock(byteLength);\n obj.ArrayBufferData = block;\n obj.ArrayBufferByteLength = byteLength;\n return obj;\n}","function allocateStruct(definition, referenceDeclarations, existingAllocations) {\n let start = 0;\n let dynamic = false;\n //don't allocate things that have already been allocated\n if (definition.id in existingAllocations) {\n return existingAllocations;\n }\n let allocations = Object.assign({}, existingAllocations); //otherwise, we'll be adding to this, so we better clone\n let memberAllocations = {};\n for (const member of definition.members) {\n let length;\n let dynamicMember;\n [length, dynamicMember, allocations] = calldataSizeAndAllocate(member, referenceDeclarations, allocations);\n //vomit on illegal types in calldata -- note the short-circuit!\n if (length === undefined) {\n allocations[definition.id] = null;\n return allocations;\n }\n let pointer = {\n calldata: {\n start,\n length\n }\n };\n memberAllocations[member.id] = {\n definition: member,\n pointer\n };\n start += length;\n dynamic = dynamic || dynamicMember;\n }\n allocations[definition.id] = {\n definition,\n members: memberAllocations,\n length: dynamic ? DecodeUtils.EVM.WORD_SIZE : start,\n dynamic\n };\n return allocations;\n}","allocateHeap(hexData) {\n let addr = \"H\" + this.heapLength++; //Create placeholder address\n this.heap[addr] = { data: hexData, loc: \"\" };\n return addr;\n }","function caml_static_alloc (len) { return new MlMakeString (len); }","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n}","function getMemory(size) {\n if (!staticSealed) return Runtime.staticAlloc(size);\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\n return _malloc(size);\n}","function Class_alloc(){}","function Mem() {\n console.info('[Mem#constructor] Allocating memory...');\n _super.call(this);\n\n this.__storage__ = {};\n this.__length__ = 0;\n }","function Module_alloc(){}","allocate(qty=1) {\n assert(qty > 0, \"allocation requires an instance count\")\n if (qty > this.allocated) {\n // need to allocate more space:\n const existingdata = this.data;\n const existingcount = this.allocated;\n this.data = new ArrayBuffer(this.bytestride * qty);\n this.allocated = qty;\n // copy any existing data:\n if (existingdata) {\n new Uint8Array(this.data).set(new Uint8Array(existingdata));\n }\n\n // create interfaces for the instances:\n for (let i=0; i<this.allocated; i++) {\n let byteoffset = i * this.bytestride;\n let obj = this.instances[i];\n if (i >= existingcount) {\n // allocate new object:\n obj = {\n index: i,\n byteoffset: byteoffset,\n }\n this.instances[i] = obj;\n }\n // map fields to the new arraybuffer:\n for (let field of this.fields) {\n obj[field.name] = new Float32Array(this.data, byteoffset + field.byteoffset, field.components);\n }\n }\n this.instances.length = this.allocated;\n } \n // can't render more than we have:\n this.count = Math.min(this.count, this.allocated);\n\t\t\treturn this;\n\t\t}","function memory() {\n return this._memory = this._memory || {};\n}","function onAllocate() {\n let memorySize = memSizeEl.value;\n let memoryPre = sizePreEl.value;\n\n switch (memoryPre) {\n case 'B':\n break;\n case 'K':\n memorySize = parseInt(memorySize * 1024, 10) ;\n break;\n case 'M':\n memorySize = parseInt(memorySize * 1024 * 1024, 10);\n break;\n case 'G':\n memorySize = parseInt(memorySize * 1024 * 1024 * 1024, 10);\n break;\n }\n\n try {\n doAllocate(memorySize);\n statusEl.innerHTML = 'Allocated ' + memorySize + ' bytes!';\n } catch (e) {\n alert('Caught exception ' + e);\n statusEl.innerHTML = 'Allocation of buffer failed!';\n console.log(e);\n }\n}"],"string":"[\n \"function _allocate(bytes) {\\n var address = Module._malloc(bytes.length);\\n Module.HEAPU8.set(bytes, address);\\n\\n return address;\\n }\",\n \"constructor() {\\n this.length = 0;\\n this._capacity = 0;\\n // Sets up the pointer where the memory is allocated\\n this.ptr = memory.allocate(this.length);\\n }\",\n \"function malloc(size) {\\n return new buffer_1.Buffer(size);\\n}\",\n \"Allocate() {\\n\\n }\",\n \"function Object_alloc(){}\",\n \"allocate(size) {\\n if (this.head + size > this.memory.length) {\\n return null;\\n }\\n\\n let start = this.head;\\n\\n this.head += size;\\n return start;\\n }\",\n \"function getMemory(size) {\\nif (!staticSealed) return staticAlloc(size);\\nif (!runtimeInitialized) return dynamicAlloc(size);\\nreturn _malloc(size);\\n}\",\n \"function BasicObject_alloc(){}\",\n \"smartMalloc(size) {\\n const w = this.wasm\\n const ptr = w._malloc(size)\\n setTimeout(() => {\\n w._free(ptr)\\n }, 0)\\n return ptr\\n }\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [typeof _malloc === 'function' ? _malloc : Runtime.staticAlloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)>>0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n assert(type, 'Must know what type to store in allocate!');\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function getMemory(size) {\\n\\t if (!runtimeInitialized) return dynamicAlloc(size);\\n\\t return _malloc(size);\\n\\t}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n assert(type, 'Must know what type to store in allocate!');\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n assert(type, 'Must know what type to store in allocate!');\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n assert(type, 'Must know what type to store in allocate!');\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n assert(type, 'Must know what type to store in allocate!');\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n assert(type, 'Must know what type to store in allocate!');\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"allocate() {\\n // allocate memory as per request\\n this.allocation[this.processId] = sumArrays(this.allocation[this.processId], this.request)\\n\\n // check if allocation == max, then free the resources\\n if (this.allocation[this.processId].equals(this.max[this.processId])) {\\n // increase available resources\\n this.available = sumArrays(this.available, this.allocation[this.processId])\\n\\n // set a fleag for the finished process\\n this.finished[this.processId] = true\\n\\n // set allocation for the finished process to 0\\n this.allocation[this.processId].fill(0)\\n\\n // set max for the finished process to 0\\n this.max[this.processId].fill(0)\\n }\\n\\n // decrease available resources\\n this.available = subtractArrays(this.available, this.request)\\n }\",\n \"function getMemory(size) {\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n }\",\n \"function getMemory(size) {\\r\\n if (!runtimeInitialized) return dynamicAlloc(size);\\r\\n return _malloc(size);\\r\\n}\",\n \"function allocate(slab, types, allocator) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n\\n if (zeroinit) {\\n _memset(ret, 0, size);\\n return ret;\\n }\\n \\n var i = 0, type;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n assert(type, 'Must know what type to store in allocate!');\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n i += Runtime.getNativeTypeSize(type);\\n }\\n\\n return ret;\\n}\",\n \"function AllocatedBuf(length) {\\n this.length = length;\\n this.address = _malloc(length);\\n }\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function AllocatedBuf(length) {\\n\\t\\tthis.length = length;\\n\\t\\tthis.address = _malloc(length);\\n\\t}\",\n \"function AllocatedBuf(length) {\\n\\t\\tthis.length = length;\\n\\t\\tthis.address = _malloc(length);\\n\\t}\",\n \"function AllocatedBuf(length) {\\n\\t\\tthis.length = length;\\n\\t\\tthis.address = _malloc(length);\\n\\t}\",\n \"function AllocatedBuf(length) {\\n\\t\\tthis.length = length;\\n\\t\\tthis.address = _malloc(length);\\n\\t}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n var singleType = typeof types === 'string' ? types : null;\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n setValue(ret+i, curr, type);\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret,\\n stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr) >> 2)] = 0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++) | 0)] = 0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0,\\n type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret + i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret,\\n stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr) >> 2)] = 0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++) | 0)] = 0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0,\\n type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret + i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)|0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)>>0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)>>0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)>>0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)>>0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)>>0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret, stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr)>>2)]=0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++)>>0)]=0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0, type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n}\",\n \"function getMemory(size) {\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret,\\n stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr) >> 2)] = 0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++) | 0)] = 0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0,\\n type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret + i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n }\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n var ptr = ret,\\n stop;\\n assert((ret & 3) == 0);\\n stop = ret + (size & ~3);\\n for (; ptr < stop; ptr += 4) {\\n HEAP32[((ptr) >> 2)] = 0;\\n }\\n stop = ret + size;\\n while (ptr < stop) {\\n HEAP8[((ptr++) >> 0)] = 0;\\n }\\n return ret;\\n }\\n\\n if (singleType === 'i8') {\\n if (slab.subarray || slab.slice) {\\n HEAPU8.set(slab, ret);\\n } else {\\n HEAPU8.set(new Uint8Array(slab), ret);\\n }\\n return ret;\\n }\\n\\n var i = 0,\\n type, typeSize, previousType;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret + i, curr, type);\\n\\n // no need to look up size unless type changes, so cache it\\n if (previousType !== type) {\\n typeSize = Runtime.getNativeTypeSize(type);\\n previousType = type;\\n }\\n i += typeSize;\\n }\\n\\n return ret;\\n }\",\n \"function allocate(slab, types, allocator, ptr) {\\n var zeroinit, size;\\n if (typeof slab === 'number') {\\n zeroinit = true;\\n size = slab;\\n } else {\\n zeroinit = false;\\n size = slab.length;\\n }\\n\\n var singleType = typeof types === 'string' ? types : null;\\n\\n var ret;\\n if (allocator == ALLOC_NONE) {\\n ret = ptr;\\n } else {\\n ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));\\n }\\n\\n if (zeroinit) {\\n _memset(ret, 0, size);\\n return ret;\\n }\\n \\n var i = 0, type;\\n while (i < size) {\\n var curr = slab[i];\\n\\n if (typeof curr === 'function') {\\n curr = Runtime.getFunctionIndex(curr);\\n }\\n\\n type = singleType || types[i];\\n if (type === 0) {\\n i++;\\n continue;\\n }\\n\\n if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later\\n\\n setValue(ret+i, curr, type);\\n i += Runtime.getNativeTypeSize(type);\\n }\\n\\n return ret;\\n}\",\n \"constructor() {\\n //starts array as empty\\n this.length = 0;\\n //capacity will be value for length of items in array + any empty spaces\\n this._capacity = 0;\\n //allocates the space for the length of new array, as long as there is room in memory\\n this.ptr = newMem.allocate(this.length);\\n }\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return staticAlloc(size);\\n if (!runtimeInitialized) return dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if (!runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if (!runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if (!runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function initialize(width, height) {\\n\\t\\t\\tthat.width = width;\\n\\t\\t\\tthat.height = height;\\n\\t\\t\\t\\n\\t\\t\\tif (width * height > that.size) {\\n\\t\\t\\t\\tthat.free();\\n\\t\\t\\t\\tthat.size = width * height;\\n\\t\\t\\t\\tthat.heapPtr = Wasm._malloc(that.size);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function allocate(height, length) {\\n\\tvar node = new Array(length);\\n\\tnode.height = height;\\n\\tif (height > 0) {\\n\\t\\tnode.sizes = new Array(length);\\n\\t}\\n\\treturn node;\\n}\",\n \"Allocate()\\n\\t{\\n\\t\\t//\\tcreate a promise function with the Resolve & Reject functions attached so we can call them\\n\\t\\tfunction CreatePromise()\\n\\t\\t{\\n\\t\\t\\tlet Callbacks = {};\\n\\t\\t\\tlet PromiseHandler = function (Resolve,Reject)\\n\\t\\t\\t{\\n\\t\\t\\t\\tCallbacks.Resolve = Resolve;\\n\\t\\t\\t\\tCallbacks.Reject = Reject;\\n\\t\\t\\t}\\n\\t\\t\\tlet Prom = new Promise(PromiseHandler);\\n\\t\\t\\tProm.Resolve = Callbacks.Resolve;\\n\\t\\t\\tProm.Reject = Callbacks.Reject;\\n\\t\\t\\treturn Prom;\\n\\t\\t}\\n\\t\\t\\n\\t\\tconst NewPromise = CreatePromise();\\n\\t\\tthis.Promises.push( NewPromise );\\n\\t\\treturn NewPromise;\\n\\t}\",\n \"function NilClass_alloc(){}\",\n \"function $fe91$var$allocUnsafe(that, size) {\\n $fe91$var$assertSize(size);\\n that = $fe91$var$createBuffer(that, size < 0 ? 0 : $fe91$var$checked(size) | 0);\\n\\n if (!$fe91$var$Buffer.TYPED_ARRAY_SUPPORT) {\\n for (var i = 0; i < size; ++i) {\\n that[i] = 0;\\n }\\n }\\n\\n return that;\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n }\",\n \"function AllocateArrayBuffer(constructor, byteLength) {\\n var obj = OrdinaryCreateFromConstructor(constructor, \\\"%ArrayBufferPrototype%\\\", ['ArrayBufferData', 'ArrayBufferByteLength']);\\n Assert(byteLength >= 0);\\n var block = CreateByteDataBlock(byteLength);\\n obj.ArrayBufferData = block;\\n obj.ArrayBufferByteLength = byteLength;\\n return obj;\\n}\",\n \"function allocateStruct(definition, referenceDeclarations, existingAllocations) {\\n let start = 0;\\n let dynamic = false;\\n //don't allocate things that have already been allocated\\n if (definition.id in existingAllocations) {\\n return existingAllocations;\\n }\\n let allocations = Object.assign({}, existingAllocations); //otherwise, we'll be adding to this, so we better clone\\n let memberAllocations = {};\\n for (const member of definition.members) {\\n let length;\\n let dynamicMember;\\n [length, dynamicMember, allocations] = calldataSizeAndAllocate(member, referenceDeclarations, allocations);\\n //vomit on illegal types in calldata -- note the short-circuit!\\n if (length === undefined) {\\n allocations[definition.id] = null;\\n return allocations;\\n }\\n let pointer = {\\n calldata: {\\n start,\\n length\\n }\\n };\\n memberAllocations[member.id] = {\\n definition: member,\\n pointer\\n };\\n start += length;\\n dynamic = dynamic || dynamicMember;\\n }\\n allocations[definition.id] = {\\n definition,\\n members: memberAllocations,\\n length: dynamic ? DecodeUtils.EVM.WORD_SIZE : start,\\n dynamic\\n };\\n return allocations;\\n}\",\n \"allocateHeap(hexData) {\\n let addr = \\\"H\\\" + this.heapLength++; //Create placeholder address\\n this.heap[addr] = { data: hexData, loc: \\\"\\\" };\\n return addr;\\n }\",\n \"function caml_static_alloc (len) { return new MlMakeString (len); }\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function getMemory(size) {\\n if (!staticSealed) return Runtime.staticAlloc(size);\\n if ((typeof _sbrk !== 'undefined' && !_sbrk.called) || !runtimeInitialized) return Runtime.dynamicAlloc(size);\\n return _malloc(size);\\n}\",\n \"function Class_alloc(){}\",\n \"function Mem() {\\n console.info('[Mem#constructor] Allocating memory...');\\n _super.call(this);\\n\\n this.__storage__ = {};\\n this.__length__ = 0;\\n }\",\n \"function Module_alloc(){}\",\n \"allocate(qty=1) {\\n assert(qty > 0, \\\"allocation requires an instance count\\\")\\n if (qty > this.allocated) {\\n // need to allocate more space:\\n const existingdata = this.data;\\n const existingcount = this.allocated;\\n this.data = new ArrayBuffer(this.bytestride * qty);\\n this.allocated = qty;\\n // copy any existing data:\\n if (existingdata) {\\n new Uint8Array(this.data).set(new Uint8Array(existingdata));\\n }\\n\\n // create interfaces for the instances:\\n for (let i=0; i<this.allocated; i++) {\\n let byteoffset = i * this.bytestride;\\n let obj = this.instances[i];\\n if (i >= existingcount) {\\n // allocate new object:\\n obj = {\\n index: i,\\n byteoffset: byteoffset,\\n }\\n this.instances[i] = obj;\\n }\\n // map fields to the new arraybuffer:\\n for (let field of this.fields) {\\n obj[field.name] = new Float32Array(this.data, byteoffset + field.byteoffset, field.components);\\n }\\n }\\n this.instances.length = this.allocated;\\n } \\n // can't render more than we have:\\n this.count = Math.min(this.count, this.allocated);\\n\\t\\t\\treturn this;\\n\\t\\t}\",\n \"function memory() {\\n return this._memory = this._memory || {};\\n}\",\n \"function onAllocate() {\\n let memorySize = memSizeEl.value;\\n let memoryPre = sizePreEl.value;\\n\\n switch (memoryPre) {\\n case 'B':\\n break;\\n case 'K':\\n memorySize = parseInt(memorySize * 1024, 10) ;\\n break;\\n case 'M':\\n memorySize = parseInt(memorySize * 1024 * 1024, 10);\\n break;\\n case 'G':\\n memorySize = parseInt(memorySize * 1024 * 1024 * 1024, 10);\\n break;\\n }\\n\\n try {\\n doAllocate(memorySize);\\n statusEl.innerHTML = 'Allocated ' + memorySize + ' bytes!';\\n } catch (e) {\\n alert('Caught exception ' + e);\\n statusEl.innerHTML = 'Allocation of buffer failed!';\\n console.log(e);\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.68709147","0.6681199","0.63991416","0.6207962","0.6196632","0.6175716","0.61651045","0.61509424","0.6149775","0.6102238","0.60735273","0.60699433","0.60699433","0.60699433","0.60699433","0.60543585","0.6044165","0.603227","0.6024579","0.5928423","0.5928","0.5925239","0.5925239","0.5925239","0.5925239","0.59249955","0.59249955","0.59249955","0.59249955","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.59234035","0.5921399","0.5921399","0.59150237","0.59150237","0.59150237","0.59150237","0.59150237","0.59150237","0.59150237","0.59111416","0.59111416","0.59111416","0.59111416","0.59111416","0.59111416","0.5891322","0.5891322","0.5891322","0.5878504","0.5875958","0.58515084","0.58342016","0.5812547","0.5812547","0.5812547","0.5812547","0.5812547","0.5812547","0.5812547","0.5812547","0.5805619","0.5805619","0.5805619","0.57983375","0.5769518","0.5728652","0.56971055","0.5686761","0.5612823","0.5541574","0.55308056","0.55206096","0.5506794","0.5497768","0.5497768","0.5497768","0.5497768","0.54753685","0.54254985","0.5424452","0.53412384","0.5328835","0.529027"],"string":"[\n \"0.68709147\",\n \"0.6681199\",\n \"0.63991416\",\n \"0.6207962\",\n \"0.6196632\",\n \"0.6175716\",\n \"0.61651045\",\n \"0.61509424\",\n \"0.6149775\",\n \"0.6102238\",\n \"0.60735273\",\n \"0.60699433\",\n \"0.60699433\",\n \"0.60699433\",\n \"0.60699433\",\n \"0.60543585\",\n \"0.6044165\",\n \"0.603227\",\n \"0.6024579\",\n \"0.5928423\",\n \"0.5928\",\n \"0.5925239\",\n \"0.5925239\",\n \"0.5925239\",\n \"0.5925239\",\n \"0.59249955\",\n \"0.59249955\",\n \"0.59249955\",\n \"0.59249955\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.59234035\",\n \"0.5921399\",\n \"0.5921399\",\n \"0.59150237\",\n \"0.59150237\",\n \"0.59150237\",\n \"0.59150237\",\n \"0.59150237\",\n \"0.59150237\",\n \"0.59150237\",\n \"0.59111416\",\n \"0.59111416\",\n \"0.59111416\",\n \"0.59111416\",\n \"0.59111416\",\n \"0.59111416\",\n \"0.5891322\",\n \"0.5891322\",\n \"0.5891322\",\n \"0.5878504\",\n \"0.5875958\",\n \"0.58515084\",\n \"0.58342016\",\n \"0.5812547\",\n \"0.5812547\",\n \"0.5812547\",\n \"0.5812547\",\n \"0.5812547\",\n \"0.5812547\",\n \"0.5812547\",\n \"0.5812547\",\n \"0.5805619\",\n \"0.5805619\",\n \"0.5805619\",\n \"0.57983375\",\n \"0.5769518\",\n \"0.5728652\",\n \"0.56971055\",\n \"0.5686761\",\n \"0.5612823\",\n \"0.5541574\",\n \"0.55308056\",\n \"0.55206096\",\n \"0.5506794\",\n \"0.5497768\",\n \"0.5497768\",\n \"0.5497768\",\n \"0.5497768\",\n \"0.54753685\",\n \"0.54254985\",\n \"0.5424452\",\n \"0.53412384\",\n \"0.5328835\",\n \"0.529027\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.60528016"},"document_rank":{"kind":"string","value":"19"}}},{"rowIdx":4677,"cells":{"query":{"kind":"string","value":"Given a pointer 'ptr' to a nullterminated UTF16LEencoded string in the emscripten HEAP, returns a copy of that string as a Javascript String object."},"document":{"kind":"string","value":"function UTF16ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\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 UTF16ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n }","function UTF16ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n }","function UTF16ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function UTF16ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\n str += String.fromCharCode(codeUnit);\n }\n}","function getStringImpl(U32, U16, ptr) {\n var dataLength = U32[ptr >>> 2];\n var dataOffset = (ptr + 4) >>> 1;\n var dataRemain = dataLength;\n var parts = [];\n const chunkSize = 1024;\n while (dataRemain > chunkSize) {\n let last = U16[dataOffset + chunkSize - 1];\n let size = last >= 0xD800 && last < 0xDC00 ? chunkSize - 1 : chunkSize;\n let part = U16.subarray(dataOffset, dataOffset += size);\n parts.push(String.fromCharCode.apply(String, part));\n dataRemain -= size;\n }\n return parts.join(\"\") + String.fromCharCode.apply(String, U16.subarray(dataOffset, dataOffset + dataRemain));\n}","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n }","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n}","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function __getString(ptr) {\n if (!ptr) return null;\n const buffer = memory.buffer;\n const id = new Uint32Array(buffer)[ptr + ID_OFFSET >>> 2];\n if (id !== STRING_ID) throw Error(`not a string: ${ptr}`);\n return getStringImpl(buffer, ptr);\n }","function getString(ptr) {\n checkMem();\n return getStringImpl(U32, U16, ptr);\n }","function getStringImpl(buffer, ptr) {\n const len = new Uint32Array(buffer)[ptr + SIZE_OFFSET >>> 2] >>> 1;\n const arr = new Uint16Array(buffer, ptr, len);\n if (len <= STRING_DECODE_THRESHOLD) {\n return String.fromCharCode.apply(String, arr);\n }\n return decoder.decode(arr);\n}","function stringToUTF16(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<2)return 0;maxBytesToWrite-=2;// Null terminator.\n var startPtr=outPtr;var numCharsToWrite=maxBytesToWrite<str.length*2?maxBytesToWrite/2:str.length;for(var i=0;i<numCharsToWrite;++i){// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\n HEAP16[outPtr>>1]=codeUnit;outPtr+=2;}// Null-terminate the pointer to the HEAP.\n HEAP16[outPtr>>1]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n }","function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.","function UTF8ToString(ptr) {\nreturn UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}"],"string":"[\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n }\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n }\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function UTF16ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];\\n if (codeUnit == 0)\\n return str;\\n ++i;\\n // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.\\n str += String.fromCharCode(codeUnit);\\n }\\n}\",\n \"function getStringImpl(U32, U16, ptr) {\\n var dataLength = U32[ptr >>> 2];\\n var dataOffset = (ptr + 4) >>> 1;\\n var dataRemain = dataLength;\\n var parts = [];\\n const chunkSize = 1024;\\n while (dataRemain > chunkSize) {\\n let last = U16[dataOffset + chunkSize - 1];\\n let size = last >= 0xD800 && last < 0xDC00 ? chunkSize - 1 : chunkSize;\\n let part = U16.subarray(dataOffset, dataOffset += size);\\n parts.push(String.fromCharCode.apply(String, part));\\n dataRemain -= size;\\n }\\n return parts.join(\\\"\\\") + String.fromCharCode.apply(String, U16.subarray(dataOffset, dataOffset + dataRemain));\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n }\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function __getString(ptr) {\\n if (!ptr) return null;\\n const buffer = memory.buffer;\\n const id = new Uint32Array(buffer)[ptr + ID_OFFSET >>> 2];\\n if (id !== STRING_ID) throw Error(`not a string: ${ptr}`);\\n return getStringImpl(buffer, ptr);\\n }\",\n \"function getString(ptr) {\\n checkMem();\\n return getStringImpl(U32, U16, ptr);\\n }\",\n \"function getStringImpl(buffer, ptr) {\\n const len = new Uint32Array(buffer)[ptr + SIZE_OFFSET >>> 2] >>> 1;\\n const arr = new Uint16Array(buffer, ptr, len);\\n if (len <= STRING_DECODE_THRESHOLD) {\\n return String.fromCharCode.apply(String, arr);\\n }\\n return decoder.decode(arr);\\n}\",\n \"function stringToUTF16(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<2)return 0;maxBytesToWrite-=2;// Null terminator.\\n var startPtr=outPtr;var numCharsToWrite=maxBytesToWrite<str.length*2?maxBytesToWrite/2:str.length;for(var i=0;i<numCharsToWrite;++i){// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\\n HEAP16[outPtr>>1]=codeUnit;outPtr+=2;}// Null-terminate the pointer to the HEAP.\\n HEAP16[outPtr>>1]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n }\",\n \"function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.\",\n \"function UTF8ToString(ptr) {\\nreturn UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.71345544","0.71345544","0.71065223","0.71065223","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.7089183","0.697702","0.6938373","0.69288766","0.69288766","0.689808","0.689808","0.689808","0.689808","0.689808","0.689808","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.689248","0.6755725","0.6704869","0.6678514","0.6641592","0.6546975","0.6542134","0.6527677","0.65243036","0.65243036","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.65004665","0.6499825","0.6499825","0.6499825","0.6499825","0.6499825","0.6499825","0.6499825","0.6499825","0.6499825","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047","0.6488047"],"string":"[\n \"0.71345544\",\n \"0.71345544\",\n \"0.71065223\",\n \"0.71065223\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.7089183\",\n \"0.697702\",\n \"0.6938373\",\n \"0.69288766\",\n \"0.69288766\",\n \"0.689808\",\n \"0.689808\",\n \"0.689808\",\n \"0.689808\",\n \"0.689808\",\n \"0.689808\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.689248\",\n \"0.6755725\",\n \"0.6704869\",\n \"0.6678514\",\n \"0.6641592\",\n \"0.6546975\",\n \"0.6542134\",\n \"0.6527677\",\n \"0.65243036\",\n \"0.65243036\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.65004665\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6499825\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\",\n \"0.6488047\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7106646"},"document_rank":{"kind":"string","value":"13"}}},{"rowIdx":4678,"cells":{"query":{"kind":"string","value":"Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr', nullterminated and encoded in UTF16LE form. The copy will require at most (str.length2+1)2 bytes of space in the HEAP."},"document":{"kind":"string","value":"function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\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 stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n }","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n}","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n }","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length * 2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr) >> 1)] = codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr) >> 1)] = 0;\n return outPtr - startPtr;\n }","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\nif (maxBytesToWrite === undefined) {\nmaxBytesToWrite = 0x7FFFFFFF;\n}\nif (maxBytesToWrite < 2) return 0;\nmaxBytesToWrite -= 2; // Null terminator.\nvar startPtr = outPtr;\nvar numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\nfor (var i = 0; i < numCharsToWrite; ++i) {\n// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\nHEAP16[((outPtr)>>1)]=codeUnit;\noutPtr += 2;\n}\n// Null-terminate the pointer to the HEAP.\nHEAP16[((outPtr)>>1)]=0;\nreturn outPtr - startPtr;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<2)return 0;maxBytesToWrite-=2;// Null terminator.\n var startPtr=outPtr;var numCharsToWrite=maxBytesToWrite<str.length*2?maxBytesToWrite/2:str.length;for(var i=0;i<numCharsToWrite;++i){// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\n HEAP16[outPtr>>1]=codeUnit;outPtr+=2;}// Null-terminate the pointer to the HEAP.\n HEAP16[outPtr>>1]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\nif (maxBytesToWrite === undefined) {\nmaxBytesToWrite = 0x7FFFFFFF;\n}\nif (maxBytesToWrite < 4) return 0;\nvar startPtr = outPtr;\nvar endPtr = startPtr + maxBytesToWrite - 4;\nfor (var i = 0; i < str.length; ++i) {\n// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n// See http://unicode.org/faq/utf_bom.html#utf16-3\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\nif (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\nvar trailSurrogate = str.charCodeAt(++i);\ncodeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n}\nHEAP32[((outPtr)>>2)]=codeUnit;\noutPtr += 4;\nif (outPtr + 4 > endPtr) break;\n}\n// Null-terminate the pointer to the HEAP.\nHEAP32[((outPtr)>>2)]=0;\nreturn outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\r\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\r\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\r\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\r\n if (maxBytesToWrite === undefined) {\r\n maxBytesToWrite = 0x7FFFFFFF;\r\n }\r\n if (maxBytesToWrite < 2) return 0;\r\n maxBytesToWrite -= 2; // Null terminator.\r\n var startPtr = outPtr;\r\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\r\n for (var i = 0; i < numCharsToWrite; ++i) {\r\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\r\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\r\n HEAP16[((outPtr)>>1)]=codeUnit;\r\n outPtr += 2;\r\n }\r\n // Null-terminate the pointer to the HEAP.\r\n HEAP16[((outPtr)>>1)]=0;\r\n return outPtr - startPtr;\r\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr) >> 2)] = codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr) >> 2)] = 0;\n return outPtr - startPtr;\n }","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\n }","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n SAFE_HEAP_STORE(((outPtr)|0), ((codeUnit)|0), 2);\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n SAFE_HEAP_STORE(((outPtr)|0), ((0)|0), 2);\n return outPtr - startPtr;\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\nreturn stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}"],"string":"[\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n }\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n }\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length * 2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr) >> 1)] = codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr) >> 1)] = 0;\\n return outPtr - startPtr;\\n }\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\nif (maxBytesToWrite === undefined) {\\nmaxBytesToWrite = 0x7FFFFFFF;\\n}\\nif (maxBytesToWrite < 2) return 0;\\nmaxBytesToWrite -= 2; // Null terminator.\\nvar startPtr = outPtr;\\nvar numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\nfor (var i = 0; i < numCharsToWrite; ++i) {\\n// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\nHEAP16[((outPtr)>>1)]=codeUnit;\\noutPtr += 2;\\n}\\n// Null-terminate the pointer to the HEAP.\\nHEAP16[((outPtr)>>1)]=0;\\nreturn outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<2)return 0;maxBytesToWrite-=2;// Null terminator.\\n var startPtr=outPtr;var numCharsToWrite=maxBytesToWrite<str.length*2?maxBytesToWrite/2:str.length;for(var i=0;i<numCharsToWrite;++i){// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\\n HEAP16[outPtr>>1]=codeUnit;outPtr+=2;}// Null-terminate the pointer to the HEAP.\\n HEAP16[outPtr>>1]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\nif (maxBytesToWrite === undefined) {\\nmaxBytesToWrite = 0x7FFFFFFF;\\n}\\nif (maxBytesToWrite < 4) return 0;\\nvar startPtr = outPtr;\\nvar endPtr = startPtr + maxBytesToWrite - 4;\\nfor (var i = 0; i < str.length; ++i) {\\n// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n// See http://unicode.org/faq/utf_bom.html#utf16-3\\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\nif (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\nvar trailSurrogate = str.charCodeAt(++i);\\ncodeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n}\\nHEAP32[((outPtr)>>2)]=codeUnit;\\noutPtr += 4;\\nif (outPtr + 4 > endPtr) break;\\n}\\n// Null-terminate the pointer to the HEAP.\\nHEAP32[((outPtr)>>2)]=0;\\nreturn outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\r\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\r\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\r\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\r\\n if (maxBytesToWrite === undefined) {\\r\\n maxBytesToWrite = 0x7FFFFFFF;\\r\\n }\\r\\n if (maxBytesToWrite < 2) return 0;\\r\\n maxBytesToWrite -= 2; // Null terminator.\\r\\n var startPtr = outPtr;\\r\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\r\\n for (var i = 0; i < numCharsToWrite; ++i) {\\r\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\r\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\r\\n HEAP16[((outPtr)>>1)]=codeUnit;\\r\\n outPtr += 2;\\r\\n }\\r\\n // Null-terminate the pointer to the HEAP.\\r\\n HEAP16[((outPtr)>>1)]=0;\\r\\n return outPtr - startPtr;\\r\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr) >> 2)] = codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr) >> 2)] = 0;\\n return outPtr - startPtr;\\n }\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\\n }\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 2 == 0, 'Pointer passed to stringToUTF16 must be aligned to two bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF16(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n SAFE_HEAP_STORE(((outPtr)|0), ((codeUnit)|0), 2);\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n SAFE_HEAP_STORE(((outPtr)|0), ((0)|0), 2);\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\nreturn stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.80290776","0.7993579","0.7993579","0.7931322","0.7931322","0.7931322","0.7931322","0.7931322","0.7931322","0.7487391","0.7394279","0.739367","0.739367","0.73627746","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7355913","0.7335567","0.7335567","0.7335567","0.7335567","0.7335567","0.7335567","0.72838616","0.72838616","0.72838616","0.72838616","0.72838616","0.72838616","0.72838616","0.7220985","0.71898985","0.7156221","0.7156221","0.7156221","0.7156221","0.7156221","0.7156221","0.7156221","0.7156221","0.7156221","0.7156221","0.7156221","0.7147823","0.7140285","0.7140285","0.7140285","0.71302426","0.7098119","0.70765597","0.70765597","0.70765597","0.70765597","0.70765597","0.70765597","0.70765597","0.7020997","0.7020997","0.7020997","0.701334","0.6974478","0.69509935","0.6950447","0.69290537","0.69290537","0.69290537","0.69290537","0.69290537","0.69290537","0.69273394","0.69273394","0.69273394","0.69273394","0.69273394"],"string":"[\n \"0.80290776\",\n \"0.7993579\",\n \"0.7993579\",\n \"0.7931322\",\n \"0.7931322\",\n \"0.7931322\",\n \"0.7931322\",\n \"0.7931322\",\n \"0.7931322\",\n \"0.7487391\",\n \"0.7394279\",\n \"0.739367\",\n \"0.739367\",\n \"0.73627746\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7355913\",\n \"0.7335567\",\n \"0.7335567\",\n \"0.7335567\",\n \"0.7335567\",\n \"0.7335567\",\n \"0.7335567\",\n \"0.72838616\",\n \"0.72838616\",\n \"0.72838616\",\n \"0.72838616\",\n \"0.72838616\",\n \"0.72838616\",\n \"0.72838616\",\n \"0.7220985\",\n \"0.71898985\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7156221\",\n \"0.7147823\",\n \"0.7140285\",\n \"0.7140285\",\n \"0.7140285\",\n \"0.71302426\",\n \"0.7098119\",\n \"0.70765597\",\n \"0.70765597\",\n \"0.70765597\",\n \"0.70765597\",\n \"0.70765597\",\n \"0.70765597\",\n \"0.70765597\",\n \"0.7020997\",\n \"0.7020997\",\n \"0.7020997\",\n \"0.701334\",\n \"0.6974478\",\n \"0.69509935\",\n \"0.6950447\",\n \"0.69290537\",\n \"0.69290537\",\n \"0.69290537\",\n \"0.69290537\",\n \"0.69290537\",\n \"0.69290537\",\n \"0.69273394\",\n \"0.69273394\",\n \"0.69273394\",\n \"0.69273394\",\n \"0.69273394\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.794772"},"document_rank":{"kind":"string","value":"15"}}},{"rowIdx":4679,"cells":{"query":{"kind":"string","value":"Given a pointer 'ptr' to a nullterminated UTF32LEencoded string in the emscripten HEAP, returns a copy of that string as a Javascript String object."},"document":{"kind":"string","value":"function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\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 __getString(ptr) {\n if (!ptr) return null;\n const buffer = memory.buffer;\n const id = new Uint32Array(buffer)[ptr + ID_OFFSET >>> 2];\n if (id !== STRING_ID) throw Error(`not a string: ${ptr}`);\n return getStringImpl(buffer, ptr);\n }","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n }","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF32ToString(ptr) {\n var i = 0;\n var str = '';\n while (1) {\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\n if (utf32 == 0)\n return str;\n ++i;\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\n if (utf32 >= 0x10000) {\n var ch = utf32 - 0x10000;\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\n } else {\n str += String.fromCharCode(utf32);\n }\n }\n}","function UTF8ToString(ptr) {\nreturn UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8,ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8, ptr);\n }","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8, ptr);\n}","function UTF8ToString(ptr) {\n return UTF8ArrayToString(HEAPU8, ptr);\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n }","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = ((SAFE_HEAP_LOAD(((ptr++)|0), 1, 0))|0);\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n}","function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function getStringImpl(U32, U16, ptr) {\n var dataLength = U32[ptr >>> 2];\n var dataOffset = (ptr + 4) >>> 1;\n var dataRemain = dataLength;\n var parts = [];\n const chunkSize = 1024;\n while (dataRemain > chunkSize) {\n let last = U16[dataOffset + chunkSize - 1];\n let size = last >= 0xD800 && last < 0xDC00 ? chunkSize - 1 : chunkSize;\n let part = U16.subarray(dataOffset, dataOffset += size);\n parts.push(String.fromCharCode.apply(String, part));\n dataRemain -= size;\n }\n return parts.join(\"\") + String.fromCharCode.apply(String, U16.subarray(dataOffset, dataOffset + dataRemain));\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++) >> 0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n }","function getString(ptr) {\n checkMem();\n return getStringImpl(U32, U16, ptr);\n }","function AsciiToString(ptr) {\r\n var str = '';\r\n while (1) {\r\n var ch = HEAP8[((ptr++)>>0)];\r\n if (!ch) return str;\r\n str += String.fromCharCode(ch);\r\n }\r\n}","function getStringImpl(buffer, ptr) {\n const len = new Uint32Array(buffer)[ptr + SIZE_OFFSET >>> 2] >>> 1;\n const arr = new Uint16Array(buffer, ptr, len);\n if (len <= STRING_DECODE_THRESHOLD) {\n return String.fromCharCode.apply(String, arr);\n }\n return decoder.decode(arr);\n}","function mallocAndWriteString(str) {\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\n return ptr;\n}","function mallocAndWriteString(str) {\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\n return ptr;\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAPU8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAPU8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAPU8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAPU8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function AsciiToString(ptr) {\n var str = '';\n while (1) {\n var ch = HEAP8[((ptr++)>>0)];\n if (!ch) return str;\n str += String.fromCharCode(ch);\n }\n}","function mallocAndWriteString(str) {\n const ptr = onigasmH_1$1.onigasmH._malloc(str.utf8Bytes.length);\n onigasmH_1$1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\n return ptr;\n}","function AsciiToString(ptr) {\nvar str = '';\nwhile (1) {\nvar ch = HEAP8[((ptr++)>>0)];\nif (!ch) return str;\nstr += String.fromCharCode(ch);\n}\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\nif (maxBytesToWrite === undefined) {\nmaxBytesToWrite = 0x7FFFFFFF;\n}\nif (maxBytesToWrite < 4) return 0;\nvar startPtr = outPtr;\nvar endPtr = startPtr + maxBytesToWrite - 4;\nfor (var i = 0; i < str.length; ++i) {\n// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n// See http://unicode.org/faq/utf_bom.html#utf16-3\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\nif (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\nvar trailSurrogate = str.charCodeAt(++i);\ncodeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n}\nHEAP32[((outPtr)>>2)]=codeUnit;\noutPtr += 4;\nif (outPtr + 4 > endPtr) break;\n}\n// Null-terminate the pointer to the HEAP.\nHEAP32[((outPtr)>>2)]=0;\nreturn outPtr - startPtr;\n}"],"string":"[\n \"function __getString(ptr) {\\n if (!ptr) return null;\\n const buffer = memory.buffer;\\n const id = new Uint32Array(buffer)[ptr + ID_OFFSET >>> 2];\\n if (id !== STRING_ID) throw Error(`not a string: ${ptr}`);\\n return getStringImpl(buffer, ptr);\\n }\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n }\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr) + (i * 4)) >> 2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF32ToString(ptr) {\\n var i = 0;\\n var str = '';\\n while (1) {\\n var utf32 = HEAP32[(((ptr)+(i*4))>>2)];\\n if (utf32 == 0)\\n return str;\\n ++i;\\n // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.\\n if (utf32 >= 0x10000) {\\n var ch = utf32 - 0x10000;\\n str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));\\n } else {\\n str += String.fromCharCode(utf32);\\n }\\n }\\n}\",\n \"function UTF8ToString(ptr) {\\nreturn UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8,ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8, ptr);\\n }\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8, ptr);\\n}\",\n \"function UTF8ToString(ptr) {\\n return UTF8ArrayToString(HEAPU8, ptr);\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n }\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = ((SAFE_HEAP_LOAD(((ptr++)|0), 1, 0))|0);\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n}\",\n \"function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function getStringImpl(U32, U16, ptr) {\\n var dataLength = U32[ptr >>> 2];\\n var dataOffset = (ptr + 4) >>> 1;\\n var dataRemain = dataLength;\\n var parts = [];\\n const chunkSize = 1024;\\n while (dataRemain > chunkSize) {\\n let last = U16[dataOffset + chunkSize - 1];\\n let size = last >= 0xD800 && last < 0xDC00 ? chunkSize - 1 : chunkSize;\\n let part = U16.subarray(dataOffset, dataOffset += size);\\n parts.push(String.fromCharCode.apply(String, part));\\n dataRemain -= size;\\n }\\n return parts.join(\\\"\\\") + String.fromCharCode.apply(String, U16.subarray(dataOffset, dataOffset + dataRemain));\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++) >> 0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n }\",\n \"function getString(ptr) {\\n checkMem();\\n return getStringImpl(U32, U16, ptr);\\n }\",\n \"function AsciiToString(ptr) {\\r\\n var str = '';\\r\\n while (1) {\\r\\n var ch = HEAP8[((ptr++)>>0)];\\r\\n if (!ch) return str;\\r\\n str += String.fromCharCode(ch);\\r\\n }\\r\\n}\",\n \"function getStringImpl(buffer, ptr) {\\n const len = new Uint32Array(buffer)[ptr + SIZE_OFFSET >>> 2] >>> 1;\\n const arr = new Uint16Array(buffer, ptr, len);\\n if (len <= STRING_DECODE_THRESHOLD) {\\n return String.fromCharCode.apply(String, arr);\\n }\\n return decoder.decode(arr);\\n}\",\n \"function mallocAndWriteString(str) {\\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\\n return ptr;\\n}\",\n \"function mallocAndWriteString(str) {\\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\\n return ptr;\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAPU8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAPU8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAPU8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAPU8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function AsciiToString(ptr) {\\n var str = '';\\n while (1) {\\n var ch = HEAP8[((ptr++)>>0)];\\n if (!ch) return str;\\n str += String.fromCharCode(ch);\\n }\\n}\",\n \"function mallocAndWriteString(str) {\\n const ptr = onigasmH_1$1.onigasmH._malloc(str.utf8Bytes.length);\\n onigasmH_1$1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\\n return ptr;\\n}\",\n \"function AsciiToString(ptr) {\\nvar str = '';\\nwhile (1) {\\nvar ch = HEAP8[((ptr++)>>0)];\\nif (!ch) return str;\\nstr += String.fromCharCode(ch);\\n}\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\nif (maxBytesToWrite === undefined) {\\nmaxBytesToWrite = 0x7FFFFFFF;\\n}\\nif (maxBytesToWrite < 4) return 0;\\nvar startPtr = outPtr;\\nvar endPtr = startPtr + maxBytesToWrite - 4;\\nfor (var i = 0; i < str.length; ++i) {\\n// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n// See http://unicode.org/faq/utf_bom.html#utf16-3\\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\nif (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\nvar trailSurrogate = str.charCodeAt(++i);\\ncodeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n}\\nHEAP32[((outPtr)>>2)]=codeUnit;\\noutPtr += 4;\\nif (outPtr + 4 > endPtr) break;\\n}\\n// Null-terminate the pointer to the HEAP.\\nHEAP32[((outPtr)>>2)]=0;\\nreturn outPtr - startPtr;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70205736","0.68332297","0.68074226","0.68074226","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6767575","0.6676319","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.6656409","0.66299176","0.66172504","0.66172504","0.6576798","0.6562302","0.6540405","0.6540405","0.6516757","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.6507901","0.65015495","0.65015495","0.65015495","0.65015495","0.65015495","0.65015495","0.6435543","0.63722897","0.6333513","0.6326488","0.6325318","0.6318466","0.6318466","0.6313646","0.6313646","0.6313646","0.6313646","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.6247857","0.62352705","0.62204474","0.6216834"],"string":"[\n \"0.70205736\",\n \"0.68332297\",\n \"0.68074226\",\n \"0.68074226\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6767575\",\n \"0.6676319\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.6656409\",\n \"0.66299176\",\n \"0.66172504\",\n \"0.66172504\",\n \"0.6576798\",\n \"0.6562302\",\n \"0.6540405\",\n \"0.6540405\",\n \"0.6516757\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.6507901\",\n \"0.65015495\",\n \"0.65015495\",\n \"0.65015495\",\n \"0.65015495\",\n \"0.65015495\",\n \"0.65015495\",\n \"0.6435543\",\n \"0.63722897\",\n \"0.6333513\",\n \"0.6326488\",\n \"0.6325318\",\n \"0.6318466\",\n \"0.6318466\",\n \"0.6313646\",\n \"0.6313646\",\n \"0.6313646\",\n \"0.6313646\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.6247857\",\n \"0.62352705\",\n \"0.62204474\",\n \"0.6216834\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.67930496"},"document_rank":{"kind":"string","value":"11"}}},{"rowIdx":4680,"cells":{"query":{"kind":"string","value":"Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr', nullterminated and encoded in UTF32LE form. The copy will require at most (str.length+1)4 bytes of space in the HEAP, but can use less, since str.length does not return the number of characters in the string, but the number of UTF16 code units in the string."},"document":{"kind":"string","value":"function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0;\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 stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n }","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\n ++iChar;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\nif (maxBytesToWrite === undefined) {\nmaxBytesToWrite = 0x7FFFFFFF;\n}\nif (maxBytesToWrite < 4) return 0;\nvar startPtr = outPtr;\nvar endPtr = startPtr + maxBytesToWrite - 4;\nfor (var i = 0; i < str.length; ++i) {\n// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n// See http://unicode.org/faq/utf_bom.html#utf16-3\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\nif (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\nvar trailSurrogate = str.charCodeAt(++i);\ncodeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n}\nHEAP32[((outPtr)>>2)]=codeUnit;\noutPtr += 4;\nif (outPtr + 4 > endPtr) break;\n}\n// Null-terminate the pointer to the HEAP.\nHEAP32[((outPtr)>>2)]=0;\nreturn outPtr - startPtr;\n}","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n }","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n}","function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr) >> 2)] = codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr) >> 2)] = 0;\n return outPtr - startPtr;\n }","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF16(str, outPtr) {\n for(var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\n}","function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n HEAP32[((outPtr)>>2)]=codeUnit;\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP32[((outPtr)>>2)]=0;\n return outPtr - startPtr;\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\r\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\r\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\r\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\r\n if (maxBytesToWrite === undefined) {\r\n maxBytesToWrite = 0x7FFFFFFF;\r\n }\r\n if (maxBytesToWrite < 4) return 0;\r\n var startPtr = outPtr;\r\n var endPtr = startPtr + maxBytesToWrite - 4;\r\n for (var i = 0; i < str.length; ++i) {\r\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\r\n // See http://unicode.org/faq/utf_bom.html#utf16-3\r\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\r\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\r\n var trailSurrogate = str.charCodeAt(++i);\r\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\r\n }\r\n HEAP32[((outPtr)>>2)]=codeUnit;\r\n outPtr += 4;\r\n if (outPtr + 4 > endPtr) break;\r\n }\r\n // Null-terminate the pointer to the HEAP.\r\n HEAP32[((outPtr)>>2)]=0;\r\n return outPtr - startPtr;\r\n}","function stringToUTF32(str, outPtr, maxBytesToWrite) {\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 4) return 0;\n var startPtr = outPtr;\n var endPtr = startPtr + maxBytesToWrite - 4;\n for (var i = 0; i < str.length; ++i) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\n // See http://unicode.org/faq/utf_bom.html#utf16-3\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\n var trailSurrogate = str.charCodeAt(++i);\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\n }\n SAFE_HEAP_STORE(((outPtr)|0), ((codeUnit)|0), 4);\n outPtr += 4;\n if (outPtr + 4 > endPtr) break;\n }\n // Null-terminate the pointer to the HEAP.\n SAFE_HEAP_STORE(((outPtr)|0), ((0)|0), 4);\n return outPtr - startPtr;\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\n }","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\nreturn stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length * 2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr) >> 1)] = codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr) >> 1)] = 0;\n return outPtr - startPtr;\n }","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\nif (maxBytesToWrite === undefined) {\nmaxBytesToWrite = 0x7FFFFFFF;\n}\nif (maxBytesToWrite < 2) return 0;\nmaxBytesToWrite -= 2; // Null terminator.\nvar startPtr = outPtr;\nvar numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\nfor (var i = 0; i < numCharsToWrite; ++i) {\n// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\nHEAP16[((outPtr)>>1)]=codeUnit;\noutPtr += 2;\n}\n// Null-terminate the pointer to the HEAP.\nHEAP16[((outPtr)>>1)]=0;\nreturn outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str, outPtr, maxBytesToWrite) {\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if (maxBytesToWrite === undefined) {\n maxBytesToWrite = 0x7FFFFFFF;\n }\n if (maxBytesToWrite < 2) return 0;\n maxBytesToWrite -= 2; // Null terminator.\n var startPtr = outPtr;\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\n for (var i = 0; i < numCharsToWrite; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[((outPtr)>>1)]=codeUnit;\n outPtr += 2;\n }\n // Null-terminate the pointer to the HEAP.\n HEAP16[((outPtr)>>1)]=0;\n return outPtr - startPtr;\n}","function stringToUTF16(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<2)return 0;maxBytesToWrite-=2;// Null terminator.\n var startPtr=outPtr;var numCharsToWrite=maxBytesToWrite<str.length*2?maxBytesToWrite/2:str.length;for(var i=0;i<numCharsToWrite;++i){// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\n HEAP16[outPtr>>1]=codeUnit;outPtr+=2;}// Null-terminate the pointer to the HEAP.\n HEAP16[outPtr>>1]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n }","function mallocAndWriteString(str) {\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\n return ptr;\n}","function mallocAndWriteString(str) {\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\n return ptr;\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\r\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\r\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\r\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}","function stringToUTF8(str, outPtr, maxBytesToWrite) {\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\n}"],"string":"[\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n }\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = codeUnit;\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr) + (iChar * 4)) >> 2)] = 0;\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr) {\\n var iChar = 0;\\n for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++iCodeUnit);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit\\n ++iChar;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[(((outPtr)+(iChar*4))>>2)]=0\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\nif (maxBytesToWrite === undefined) {\\nmaxBytesToWrite = 0x7FFFFFFF;\\n}\\nif (maxBytesToWrite < 4) return 0;\\nvar startPtr = outPtr;\\nvar endPtr = startPtr + maxBytesToWrite - 4;\\nfor (var i = 0; i < str.length; ++i) {\\n// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n// See http://unicode.org/faq/utf_bom.html#utf16-3\\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\nif (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\nvar trailSurrogate = str.charCodeAt(++i);\\ncodeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n}\\nHEAP32[((outPtr)>>2)]=codeUnit;\\noutPtr += 4;\\nif (outPtr + 4 > endPtr) break;\\n}\\n// Null-terminate the pointer to the HEAP.\\nHEAP32[((outPtr)>>2)]=0;\\nreturn outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n }\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for (var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr) + (i * 2)) >> 1)] = codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr) + (str.length * 2)) >> 1)] = 0;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr) >> 2)] = codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr) >> 2)] = 0;\\n return outPtr - startPtr;\\n }\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0;\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF16(str, outPtr) {\\n for(var i = 0; i < str.length; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[(((outPtr)+(str.length*2))>>1)]=0\\n}\",\n \"function stringToUTF32(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<4)return 0;var startPtr=outPtr;var endPtr=startPtr+maxBytesToWrite-4;for(var i=0;i<str.length;++i){// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\\n if(codeUnit>=0xD800&&codeUnit<=0xDFFF){var trailSurrogate=str.charCodeAt(++i);codeUnit=0x10000+((codeUnit&0x3FF)<<10)|trailSurrogate&0x3FF;}HEAP32[outPtr>>2]=codeUnit;outPtr+=4;if(outPtr+4>endPtr)break;}// Null-terminate the pointer to the HEAP.\\n HEAP32[outPtr>>2]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n HEAP32[((outPtr)>>2)]=codeUnit;\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP32[((outPtr)>>2)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\r\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\r\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\r\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\r\\n if (maxBytesToWrite === undefined) {\\r\\n maxBytesToWrite = 0x7FFFFFFF;\\r\\n }\\r\\n if (maxBytesToWrite < 4) return 0;\\r\\n var startPtr = outPtr;\\r\\n var endPtr = startPtr + maxBytesToWrite - 4;\\r\\n for (var i = 0; i < str.length; ++i) {\\r\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\r\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\r\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\r\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\r\\n var trailSurrogate = str.charCodeAt(++i);\\r\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\r\\n }\\r\\n HEAP32[((outPtr)>>2)]=codeUnit;\\r\\n outPtr += 4;\\r\\n if (outPtr + 4 > endPtr) break;\\r\\n }\\r\\n // Null-terminate the pointer to the HEAP.\\r\\n HEAP32[((outPtr)>>2)]=0;\\r\\n return outPtr - startPtr;\\r\\n}\",\n \"function stringToUTF32(str, outPtr, maxBytesToWrite) {\\n assert(outPtr % 4 == 0, 'Pointer passed to stringToUTF32 must be aligned to four bytes!');\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF32(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 4) return 0;\\n var startPtr = outPtr;\\n var endPtr = startPtr + maxBytesToWrite - 4;\\n for (var i = 0; i < str.length; ++i) {\\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.\\n // See http://unicode.org/faq/utf_bom.html#utf16-3\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {\\n var trailSurrogate = str.charCodeAt(++i);\\n codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);\\n }\\n SAFE_HEAP_STORE(((outPtr)|0), ((codeUnit)|0), 4);\\n outPtr += 4;\\n if (outPtr + 4 > endPtr) break;\\n }\\n // Null-terminate the pointer to the HEAP.\\n SAFE_HEAP_STORE(((outPtr)|0), ((0)|0), 4);\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\\n }\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\nreturn stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length * 2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr) >> 1)] = codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr) >> 1)] = 0;\\n return outPtr - startPtr;\\n }\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\nif (maxBytesToWrite === undefined) {\\nmaxBytesToWrite = 0x7FFFFFFF;\\n}\\nif (maxBytesToWrite < 2) return 0;\\nmaxBytesToWrite -= 2; // Null terminator.\\nvar startPtr = outPtr;\\nvar numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\nfor (var i = 0; i < numCharsToWrite; ++i) {\\n// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\nvar codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\nHEAP16[((outPtr)>>1)]=codeUnit;\\noutPtr += 2;\\n}\\n// Null-terminate the pointer to the HEAP.\\nHEAP16[((outPtr)>>1)]=0;\\nreturn outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str, outPtr, maxBytesToWrite) {\\n // Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if (maxBytesToWrite === undefined) {\\n maxBytesToWrite = 0x7FFFFFFF;\\n }\\n if (maxBytesToWrite < 2) return 0;\\n maxBytesToWrite -= 2; // Null terminator.\\n var startPtr = outPtr;\\n var numCharsToWrite = (maxBytesToWrite < str.length*2) ? (maxBytesToWrite / 2) : str.length;\\n for (var i = 0; i < numCharsToWrite; ++i) {\\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\\n HEAP16[((outPtr)>>1)]=codeUnit;\\n outPtr += 2;\\n }\\n // Null-terminate the pointer to the HEAP.\\n HEAP16[((outPtr)>>1)]=0;\\n return outPtr - startPtr;\\n}\",\n \"function stringToUTF16(str,outPtr,maxBytesToWrite){// Backwards compatibility: if max bytes is not specified, assume unsafe unbounded write is allowed.\\n if(maxBytesToWrite===undefined){maxBytesToWrite=0x7FFFFFFF;}if(maxBytesToWrite<2)return 0;maxBytesToWrite-=2;// Null terminator.\\n var startPtr=outPtr;var numCharsToWrite=maxBytesToWrite<str.length*2?maxBytesToWrite/2:str.length;for(var i=0;i<numCharsToWrite;++i){// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\\n var codeUnit=str.charCodeAt(i);// possibly a lead surrogate\\n HEAP16[outPtr>>1]=codeUnit;outPtr+=2;}// Null-terminate the pointer to the HEAP.\\n HEAP16[outPtr>>1]=0;return outPtr-startPtr;}// Returns the number of bytes the given Javascript string takes if encoded as a UTF16 byte array, EXCLUDING the null terminator byte.\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n }\",\n \"function mallocAndWriteString(str) {\\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\\n return ptr;\\n}\",\n \"function mallocAndWriteString(str) {\\n const ptr = onigasmH_1.onigasmH._malloc(str.utf8Bytes.length);\\n onigasmH_1.onigasmH.HEAPU8.set(str.utf8Bytes, ptr);\\n return ptr;\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\r\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\r\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\r\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\",\n \"function stringToUTF8(str, outPtr, maxBytesToWrite) {\\n assert(typeof maxBytesToWrite == 'number', 'stringToUTF8(str, outPtr, maxBytesToWrite) is missing the third parameter that specifies the length of the output buffer!');\\n return stringToUTF8Array(str, HEAPU8,outPtr, maxBytesToWrite);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.79397404","0.78454715","0.78454715","0.78064543","0.78064543","0.78064543","0.78064543","0.78064543","0.78064543","0.76360685","0.76156414","0.7611457","0.7611457","0.757421","0.7559589","0.7559589","0.7559589","0.7559589","0.7559589","0.7559589","0.7559589","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.7552597","0.75412816","0.75412816","0.75412816","0.75412816","0.75412816","0.75412816","0.7499352","0.7486936","0.7486936","0.7486936","0.7413614","0.7413614","0.7413614","0.7413614","0.7413614","0.7413614","0.7413614","0.7413614","0.7413614","0.7413614","0.7413614","0.7408105","0.7260828","0.7077656","0.7051279","0.70419997","0.702524","0.702524","0.702524","0.702524","0.702524","0.702524","0.70200557","0.6974868","0.69296587","0.69296587","0.69296587","0.69296587","0.69296587","0.69296587","0.69296587","0.6867607","0.6859814","0.6830553","0.6830553","0.68150175","0.679814","0.679814","0.679814","0.679814"],"string":"[\n \"0.79397404\",\n \"0.78454715\",\n \"0.78454715\",\n \"0.78064543\",\n \"0.78064543\",\n \"0.78064543\",\n \"0.78064543\",\n \"0.78064543\",\n \"0.78064543\",\n \"0.76360685\",\n \"0.76156414\",\n \"0.7611457\",\n \"0.7611457\",\n \"0.757421\",\n \"0.7559589\",\n \"0.7559589\",\n \"0.7559589\",\n \"0.7559589\",\n \"0.7559589\",\n \"0.7559589\",\n \"0.7559589\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.7552597\",\n \"0.75412816\",\n \"0.75412816\",\n \"0.75412816\",\n \"0.75412816\",\n \"0.75412816\",\n \"0.75412816\",\n \"0.7499352\",\n \"0.7486936\",\n \"0.7486936\",\n \"0.7486936\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7413614\",\n \"0.7408105\",\n \"0.7260828\",\n \"0.7077656\",\n \"0.7051279\",\n \"0.70419997\",\n \"0.702524\",\n \"0.702524\",\n \"0.702524\",\n \"0.702524\",\n \"0.702524\",\n \"0.702524\",\n \"0.70200557\",\n \"0.6974868\",\n \"0.69296587\",\n \"0.69296587\",\n \"0.69296587\",\n \"0.69296587\",\n \"0.69296587\",\n \"0.69296587\",\n \"0.69296587\",\n \"0.6867607\",\n \"0.6859814\",\n \"0.6830553\",\n \"0.6830553\",\n \"0.68150175\",\n \"0.679814\",\n \"0.679814\",\n \"0.679814\",\n \"0.679814\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.78261834"},"document_rank":{"kind":"string","value":"15"}}},{"rowIdx":4681,"cells":{"query":{"kind":"string","value":"dynamic area handled by sbrk"},"document":{"kind":"string","value":"function enlargeMemory() {\n abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');\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":["_McDonaldAlloc(size) {\n size = roundUp(size, this._alignment);\n\n for (let i = 0; i < this._chunkCount; ++i) {\n const chunk = this._chunks[i];\n let isFound = false;\n let start = chunk.start;\n\n if (start + size <= chunk.end) {\n isFound = true;\n } else if (start > chunk.end) {\n if (start + size <= chunk.size) {\n isFound = true;\n } else if (size <= chunk.end) {\n // Try to find from head again.\n chunk.start = start = 0;\n isFound = true;\n }\n } else if (start === chunk.end) {\n chunk.start = start = 0;\n chunk.end = chunk.size;\n\n if (size <= chunk.end) {\n isFound = true;\n }\n }\n\n if (isFound) {\n chunk.start += size;\n const handle = {\n chunkIdx: i,\n start,\n end: start + size,\n texture: chunk.texture\n };\n\n this._handles.push(handle);\n\n return handle;\n }\n } // create a new one\n\n\n const targetSize = Math.sqrt(size / this._formatSize);\n const texLength = this._roundUpFn && this._roundUpFn(targetSize, this._formatSize) || Math.max(1024, nearestPOT(targetSize));\n\n const newChunk = this._chunks[this.createChunk(texLength)];\n\n newChunk.start += size;\n const texHandle = {\n chunkIdx: this._chunkCount,\n start: 0,\n end: size,\n texture: newChunk.texture\n };\n\n this._handles.push(texHandle);\n\n return texHandle;\n }","scavengeLoop() {\n const closures = this.nonMovedObjectsToScavenge,\n blocks = this.blocksToScavenge;\n\n let currentBlock = undefined, currentObject = undefined;\n\n // Note: there are various nested loops, mainly because there are\n // two kinds of objects, that must be scavenged in a different way:\n // objects that have been copied in to-space, and non-moved objects.\n // Objects copied in to-space are scavenged by traversing the\n // to-space sequentially. Non-moved objects are stored\n // in `this.nonMovedObjects` and must be handled separately.\n // Moreover, scavenging an object of either kind may introduce\n // new objects of either kind.\n while (true) {\n if (!currentBlock) {\n // We try and pick a new block to scavenge\n currentBlock = blocks.pop();\n if (currentBlock)\n // If there exists a block to scavenge,\n // start with the object pointed\n // by the `start` field in the block\n // descriptor\n currentObject = (\n this.memory.i32Load(\n currentBlock + rtsConstants.offset_bdescr_start\n )\n );\n }\n // Iterate over the objects in the `currentBlock`,\n // but only if there's such a block\n while (currentBlock) {\n // `currentLimit` is the upper limit for `currentBlock`\n // and consists of a pointer to the free space in the\n // current block\n const currentLimit = (\n this.memory.i32Load(\n currentBlock + rtsConstants.offset_bdescr_free\n )\n );\n if (currentObject >= currentLimit)\n // There are no more blocks to scavenge in the\n // `currentBlock`. Break, but do not unset\n // the current block, as we are not done with\n // it yet: scavenging the non-moved closures below\n // may add new objects to `currentBlock`.\n break;\n // Scavenge the current object, and increase the\n // `currentObject` address of the amount (sizeof) provided by\n // the `scavengeClosure` function.\n currentObject += this.scavengeClosure(currentObject);\n }\n if (blocks.length > 0) {\n // There are more blocks to scavenge:\n // since we have completely processed the\n // current currentBlock, we can continue\n // and pick the next one\n currentBlock = currentObject = undefined;\n continue;\n } else if (closures.length == 0)\n // There are no more block to scavenge,\n // nor in the to-space nor among the non-moved\n // objects. We are done.\n return;\n // Scavenge the remaining non-moved objects\n while (closures.length > 0) {\n this.scavengeClosure(closures.pop());\n }\n // Continue scavenging the possibly newly evacuated objects\n }\n }","call(handle) {\n this.registers[$ra] = this.registers[$pc];\n this.setPc(this.heap.getaddr(handle));\n }","call(handle) {\n false && false;\n this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\"$ra\"]] = this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\"$pc\"]];\n this.setPc(this.heap.getaddr(handle));\n }","call(handle) {\n false && false;\n this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\"$ra\"]] = this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\"$pc\"]];\n this.setPc(this.heap.getaddr(handle));\n }","insert(item) {\n this.heap.push(item);\n this.size++;\n\n // put it at the end\n let i = this.size - 1;\n this.locations.set(this.hash(item), i);\n\n while (i > 0) {\n let parent = this.parentIndex(i);\n\n if (this.validParent(i, parent))\n break;\n\n // swap item places\n this.heap[i] = this.heap[parent];\n this.heap[parent] = item;\n\n // set locations on the swap\n this.locations.set(this.hash(item), parent);\n this.locations.set(this.hash(this.heap[i]), i);\n\n i = parent;\n }\n }","function incrementPointer() {\t\t\t\n\t\t\tpointerAddress += 1;\n\t\t\tif(pointerAddress >= instructions.length) {\t\t\t\n\t\t\t\twindow.console.log('Brainfuck program finished.');\n\t\t\t\tstatus = STATUSES['STOPPED'];\n\t\t\t}\n\t\t}","_pushSegmentPointer(pointer, index) {\n return [\n // addr = segmentPointer + i\n '@' + index,\n 'D=A',\n '@' + pointer,\n this._pointerIsNumber(pointer) ? 'A=D+A' : 'A=D+M',\n // *SP = *addr\n 'D=M',\n '@SP',\n 'A=M',\n 'M=D',\n\n // SP++\n '@SP',\n 'M=M+1',\n ]\n }","function linebrk(buf, n) {\n\tvar s = buf.toString('ascii');\n\tvar ret = \"\";\n\tvar i = 0;\n\twhile (i + n < s.length) {\n\t\tret += s.substring(i, i + n) + \"\\n\";\n\t\ti += n;\n\t}\n\treturn ret + s.substring(i, s.length);\n}","processKeys(dt) {\n\t\tvar npos = this.pos.copy();\n\t\tif (this.keys['a']) {\n\t\t\tnpos.x -= dt * 200;\n\t\t}\n\t\telse if (this.keys['d']) {\n\t\t\tnpos.x += dt * 200;\n\t\t}\n\t\tif (this.keys['w']) {\n\t\t\tnpos.y -= dt * 200;\n\t\t}\n\t\telse if (this.keys['s']) {\n\t\t\tnpos.y += dt * 200;\n\t\t}\n\n\t\tthis.pos = this.processPos(npos);\n\t\tif(this.mouseUpdated) {\n\t\t\tvar rpos = this.mousePos.div(CellSize).round();\n\t\t\tvar neighbour = false;\n\t\t\tlet shift = [new Vector2(0, 0), new Vector2(-1, 0), new Vector2(1, 0), new Vector2(0, -1), new Vector2(0, 1)];\n\t\t\tfor(let i = 0; i < 5; i++) {\n\t\t\t\tvar t = rpos.add(shift[i]);\n\t\t\t\tif(this.map.checkCoords(t.x, t.y) && this.map.get(t.x, t.y).owner == this.id) {\n\t\t\t\t\tneighbour = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(neighbour) {\n\t\t\t\tif(this.mouseButton == 0) {\n\t\t\t\t\tif(this.map.checkCoords(rpos.x, rpos.y) && this.workers >= 1) {\n\t\t\t\t\t\tvar block = this.map.get(rpos.x, rpos.y);\n\t\t\t\t\t\t//var dist = block.physics.rpos.add(new Vector2(1 / 2, 1 / 2)).sub(this.physics.rpos.add(this.physics.size.diva(CellSize.x * 2))).abs();\n\t\t\t\t\t\tif(this.energy >= block.energyCost || (block.id == 12 && this.energy >= block.energyCost / 10)) { \n\t\t\t\t\t\t\tif(this.map.breakBlock(rpos.x, rpos.y, {gameId: this.network.gameId, side: this.network.side})) {\n\t\t\t\t\t\t\t\tthis.workers--;\n\t\t\t\t\t\t\t\tif(block.id == 12) this.energy -= block.energyCost / 10;\n\t\t\t\t\t\t\t\telse if(!block.needBlock) this.energy -= block.energyCost;\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\telse if(this.mouseButton == 2) {\n\t\t\t\t\tif(this.map.checkCoords(rpos.x, rpos.y) && this.workers >= 1 && this.energy >= 5 && this.stone >= 5) {\n\t\t\t\t\t\tvar block = this.map.get(rpos.x, rpos.y);\n\t\t\t\t\t\t//var dist = block.physics.rpos.add(new Vector2(1 / 2, 1 / 2)).sub(this.physics.rpos.add(this.physics.size.diva(CellSize.x * 2))).abs();\n\t\t\t\t\t\t//if(dist <= 5) {\n\t\t\t\t\t\t\tvar good = true;\n\t\t\t\t\t\t\trooms[this.network.room].players.forEach(function(item, i, arr) {\n\t\t\t\t\t\t\t\tgood = good && (!block.physics.intersects(item.physics) || !item.alive);\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\tif(good && block.id == 0) {\n\t\t\t\t\t\t\t\tblock.id = 12;\n\t\t\t\t\t\t\t\tblock.owner = this.id;\n\t\t\t\t\t\t\t\tthis.energy -= 5;\n\t\t\t\t\t\t\t\tthis.stone -= 5;\n\t\t\t\t\t\t\t\tthis.map.updateBlock(Math.floor(rpos.x), Math.floor(rpos.y));\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}\n\t\t\tthis.mouseUpdated = false;\n\t\t}\n\t}","function onAlloc () {\n allocDoneCount++\n }","allocate(size) {\n if (this.head + size > this.memory.length) {\n return null;\n }\n\n let start = this.head;\n\n this.head += size;\n return start;\n }","get _virtualEnd(){return this._virtualStart+this._physicalCount-1;}","function bi_windup(s) {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n }","function blockify(piece) {\n\t\tpiece.shape.moveTo(blockHeap);\n\t\t\n\t\t/*\n\t\tTODO: will have to use a 2d array as trying to use .getIntersections for each tile is not performant enough\n\t\t\n\t\t*/\n\t\t\n\t\tfor (var i = 0, len = tetrjs.config.board.height; i<len; i++) {\n\t\t\tfor (var j = 0, len2 = tetrjs.config.board.width; j<len; j++) {\n\t\t\t\tvar x = (j * tetrjs.config.board.blockSize) + tetrjs.config.board.blockSize/2;\n\t\t\t\tvar y = (i * tetrjs.config.board.blockSize) + tetrjs.config.board.blockSize/2;\n\t\t\t\tvar ints = tetrjs.game.getBlockHeap().getIntersections(x,y);\n\t\t\t\tfor (var k = 0; k < ints.length; k++) {\n\t\t\t\t\t//console.log(\"intersects\", ints[k].getAbsolutePosition());\n\t\t\t\t\t/*_layer.add( new Kinetic.Rect({\n\t\t\t\t\t\tx: x,\n\t\t\t\t\t\ty: y,\n\t\t\t\t\t\twidth: 1,\n\t\t\t\t\t\theight: 1,\n\t\t\t\t\t\tstroke: \"red\",\n\t\t\t\t\t\tstrokeWidth:1,\n\t\t\t\t\t\tdetectionType: \"path\"\n\t\t\t\t\t}) );*/\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcurrentShape = null;\n\t}","function snakeMemory(){\n if(snakeTail>1){\n for (var i = 1; i < snakeTail; i++) {\n snake[snake.length - i][0] = snake[(snake.length-i)-1][0];\n snake[snake.length - i][1] = snake[(snake.length-i)-1][1];\n }\n }\n}","rollInProcess(ct, segNum) {\n let filename = DeviceDriverDisk.swapPrefix + ct.pid;\n let byteString = _krnDiskDriver.readFile(filename);\n if (byteString == undefined) {\n console.log(\"Could not roll in PID \" + ct.pid);\n console.log(new Error().stack);\n }\n // Convert string to bytes\n let bytes = byteString.split(\"\").map(function (x) {\n return x.charCodeAt(0);\n });\n bytes = bytes.slice(0, _MMU.segmentSize);\n _MMU.clearSegment(segNum);\n _MMU.loadBytesToSegment(segNum, bytes);\n // Let the process context know that it is in memory\n ct.segment = segNum;\n ct.inMemory = true;\n return 0;\n }","function h$follow(obj, sp) {\n var i, ii, iter, c, work, w;\n\n\n\n ;\n var work, mark = h$gcMark;\n if(typeof sp === 'number') {\n work = obj.slice(0, sp+1);\n w = sp + 1;\n } else {\n work = [obj];\n w = 1;\n }\n while(w > 0) {\n ;\n c = work[--w];\n ;\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\n var doMark = false;\n var cf = c.f;\n ;\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\n ;\n // only change the two least significant bits for heap objects\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n // dynamic references\n var d = c.d2;\n switch(cf.size) {\n case 0: break;\n case 1: work[w++] = c.d1;; break;\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\n default: w = h$followObjGen(c,work,w);\n }\n // static references\n var s = cf.s;\n if(s !== null) {\n ;\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\n }\n } else if(c instanceof h$Weak) {\n ;\n if(c.keym.m === mark) {\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\n } else {\n // fixme we should keep separate arrays for\n // value mark pending / cleanup pending?\n if(c.val !== null) h$scannedWeaks.push(c);\n }\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n } else if(c instanceof h$MVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n /*\n only push the values in the queues, not the waiting threads\n\n the threads will be scanned after threads waiting on unreachable\n MVars have been cleaned up\n */\n iter = c.writers.iter();\n while((ii = iter()) !== null) work[w++] = ii[1];;\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\n } else if(c instanceof h$MutVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n } else if(c instanceof h$TVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n } else if(c instanceof h$Thread) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n if(c.stack) {\n for(i=c.sp;i>=0;i--) work[w++] = c.stack[i];;\n }\n } else if(c instanceof h$Transaction) {\n /* - the accessed TVar values don't need to be marked\n - parents are also on the stack, so they should've been marked already\n */\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n for(i=c.invariants.length-1;i>=0;i--) work[w++] = c.invariants[i];;\n work[w++] = c.action;;\n iter = c.tvars.iter();\n while((ii = iter.next()) !== null) work[w++] = ii;;\n } else if(c instanceof Array && c.__ghcjsArray) { // only for Haskell arrays with lifted values\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n ;\n for(i=0;i<c.length;i++) {\n var x = c[i];\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) work[w++] = x;;\n }\n } else if(typeof c === 'object') {\n ;\n\n\n\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\n var x = h$extensibleRetentionCallbacks[i](c, mark);\n if(x === false) continue;\n\n\n\n if(x !== true) {\n for(j=x.length-1;j>=0;j--) work[w++] = x[j];;\n }\n break;\n }\n\n\n\n\n\n } // otherwise: not an object, no followable values\n }\n }\n ;\n}","get _virtualEnd(){return this._virtualStart+this._physicalCount-1}","function bi_windup(s) {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n }","onBreaking(i, j, source) {\n\t\tvar block = this.get(i, j);\n\t\tvar stoneCost = block.stoneCost;\n\t\tvar pl;\n\t\tif(source.side == 0) pl = rooms[this.room].players[source.gameId];\n\t\telse pl = rooms[this.room].viruses[source.gameId];\n\t\tif(pl) {\n\t\t\tpl.workers++;\n\t\t\tpl.stone += stoneCost;\n\t\t}\n\t\tif(this.checkCoords(i, j - 1) && this.get(i, j - 1).needBlock) {\n\t\t\tthis.breakBlock(i, j - 1, source);\n\t\t\tif(pl) {\n\t\t\t\tpl.workers--;\n\t\t\t}\n\t\t}\n\t\t// if(block.owner >= 0) {\n\t\t// \tvar owner = rooms[this.room].network[block.owner];\n\t\t// \tif(owner.side == 0) {\n\t\t// \t\towner = rooms[owner.room].players[owner.gameId];\n\t\t// \t}\n\t\t// \telse {\n\t\t// \t\towner = rooms[owner.room].viruses[owner.gameId];\n\n\t\t// \t\tif(owner.core.rpos.x == i && owner.core.rpos.y == j) {\n\t\t// \t\t\towner.alive = false;\n\t\t// \t\t}\n\t\t// \t}\n\t\t// }\n\t\tblock.id = 0;\n\t}","function bi_windup(s)\n\t {\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t }","function bi_windup(s) {\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","_findSlot(key) {\n const hash = HashMap._hashString(key);\n const start = hash % this._capacity;\n // We use a for loop to avoid collisions by open addressing\n for (let i = start; i < start + this._capacity; i++) {\n const index = i % this._capacity;\n const slot = this._hashTable[index];\n // console.log('index: ', index);\n // console.log('slot: ', slot);\n if (slot === undefined || (slot.key === key && !slot.DELETED)) {\n // console.log('undefined slot found')\n return index;\n } else {\n // console.log('undefined slot NOT FOUND... next?')\n }\n }\n }","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s)\n\t{\n\t if (s.bi_valid > 8) {\n\t put_short(s, s.bi_buf);\n\t } else if (s.bi_valid > 0) {\n\t //put_byte(s, (Byte)s->bi_buf);\n\t s.pending_buf[s.pending++] = s.bi_buf;\n\t }\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t}","function bi_windup(s){if(s.bi_valid>8){put_short(s,s.bi_buf);}else if(s.bi_valid>0){//put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++]=s.bi_buf;}s.bi_buf=0;s.bi_valid=0;}","function bi_windup(s)\n {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n }","map_sram(bank_start, bank_end, addr_start, addr_end) {\n\t\tlet offset = 0;\n\t\tfor (let c = bank_start; c <= bank_end; c++) {\n\t\t\tfor (let i = addr_start; i <= addr_end; i += 0x1000) {\n\t\t\t\tlet b = (c << 4) | (i >>> 12);\n\t\t\t\tthis.readmap[b].kind = this.writemap[b].kind = MAP_TI.SRAM;\n\t\t\t\tthis.readmap[b].offset = this.writemap[b].offset = offset;\n\t\t\t\tthis.block_is_ROM[b] = false;\n\t\t\t\tthis.block_is_RAM[b] = false;\n\t\t\t\toffset += 0x1000;\n\t\t\t\t//if (offset > this.SRAMSize) return;\n\t\t\t\tif (offset > this.SRAMSize) offset = 0;\n\t\t\t}\n\t\t}\n\t}","_calculateBounds() {\n // FILL IN//\n }","insert(point){\n if(!this.boundary.contains(point)){\n return false;\n } \n if((this.points.length<this.capacity && !this.isDivided)||this.depth===MAX_DEPTH){\n this.points.push(point);\n return true;\n } else {\n if(!this.isDivided){\n this.subdivide();\n }\n \n if(this.northeast.insert(point)){\n return true;\n } else if(this.northwest.insert(point)){\n return true;\n } else if(this.southeast.insert(point)){\n return true;\n } else if(this.southwest.insert(point)){\n return true;\n } \n }\n }","pathFindSheet(list, pad) {\n const c = this.LIBRARY_TILE\n const yMax = c.mask.height;\n const tmp_list = []; // new list\n let cache = {};\n let antiFreeze = 500000;\n\n for (let I = 0, L = list.length; I < L; I++) {\n const cage = list[I];\n let x = +pad, y = +pad;\n let w = cage.width, h = cage.height;\n cage.position.set(x,y);\n cage.getBounds();\n // scan, no collid with alrealy added cage\n for (let i = 0, l = tmp_list.length, contact = false; i < l; i++) {\n const temp = tmp_list[i];\n if($app.hitCheck(cage,temp)){\n i = -1;\n y+=(h+pad);\n // si collision, jump pixel line X++\n if(y+h>yMax){ x+=pad, y = +pad }\n else{ y+=pad };\n cage.position.set(x,y);\n cage.getBounds();\n };\n if(!antiFreeze--){ console.error(\"error:antiFreeze\"); break };\n };\n // no break hitCheck, we can add\n tmp_list.push(cage);\n cache[cage.dataObj._textureName] = new PIXI.Point(x,y); //REGISTER\n cage._boundsRect.pad(pad+2,pad+1);\n };\n return cache;\n }","function h$follow(obj, sp) {\n var i, ii, iter, c, work, w;\n ;\n var work, mark = h$gcMark;\n if(typeof sp === 'number') {\n work = obj.slice(0, sp+1);\n w = sp + 1;\n } else {\n work = [obj];\n w = 1;\n }\n while(w > 0) {\n ;\n c = work[--w];\n ;\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\n var doMark = false;\n var cf = c.f;\n ;\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\n ;\n // only change the two least significant bits for heap objects\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n // dynamic references\n var d = c.d2;\n switch(cf.size) {\n case 0: break;\n case 1: work[w++] = c.d1;; break;\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\n default: w = h$followObjGen(c,work,w);\n }\n // static references\n var s = cf.s;\n if(s !== null) {\n ;\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\n }\n } else if(c instanceof h$Weak) {\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n } else if(c instanceof h$MVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n iter = c.writers.iter();\n while((ii = iter()) !== null) {\n work[w++] = ii[1];; // value\n work[w++] = ii[0];; // thread\n }\n iter = c.readers.iter();\n while((ii = iter()) !== null) {\n work[w++] = ii;;\n }\n if(c.waiters) {\n for(i=c.waiters.length-1;i>=0;i--) {\n work[w++] = c.waiters[i];;\n }\n }\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\n } else if(c instanceof h$MutVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n } else if(c instanceof h$TVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n iter = c.blocked.iter();\n while((ii = iter.next()) !== null) {\n work[w++] = ii;;\n }\n if(c.invariants) {\n iter = c.invariants.iter();\n while((ii = iter.next()) !== null) {\n work[w++] = ii;;\n }\n }\n } else if(c instanceof h$Thread) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n if(c.stack) {\n for(i=c.sp;i>=0;i--) {\n work[w++] = c.stack[i];;\n }\n }\n for(i=0;i<c.excep.length;i++) {\n work[w++] = c.excep[i];;\n }\n } else if(c instanceof h$Transaction) {\n // - the accessed TVar values don't need to be marked\n // - parents are also on the stack, so they should've been marked already\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n for(i=c.invariants.length-1;i>=0;i--) {\n work[w++] = c.invariants[i].action;;\n }\n work[w++] = c.action;;\n iter = c.tvars.iter();\n while((ii = iter.nextVal()) !== null) {\n work[w++] = ii.val;;\n }\n } else if(c instanceof Array && c.__ghcjsArray) {\n // only for Haskell arrays with lifted values\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n ;\n for(i=0;i<c.length;i++) {\n var x = c[i];\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) {\n work[w++] = x;;\n }\n }\n } else if(typeof c === 'object') {\n ;\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\n var x = h$extensibleRetentionCallbacks[i](c, mark);\n if(x === false) continue;\n if(x !== true) {\n for(j=x.length-1;j>=0;j--) {\n work[w++] = x[j];;\n }\n }\n break;\n }\n } // otherwise: not an object, no followable values\n }\n }\n ;\n}","function h$follow(obj, sp) {\n var i, ii, iter, c, work, w;\n ;\n var work, mark = h$gcMark;\n if(typeof sp === 'number') {\n work = obj.slice(0, sp+1);\n w = sp + 1;\n } else {\n work = [obj];\n w = 1;\n }\n while(w > 0) {\n ;\n c = work[--w];\n ;\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\n var doMark = false;\n var cf = c.f;\n ;\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\n ;\n // only change the two least significant bits for heap objects\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n // dynamic references\n var d = c.d2;\n switch(cf.size) {\n case 0: break;\n case 1: work[w++] = c.d1;; break;\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\n default: w = h$followObjGen(c,work,w);\n }\n // static references\n var s = cf.s;\n if(s !== null) {\n ;\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\n }\n } else if(c instanceof h$Weak) {\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n } else if(c instanceof h$MVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n iter = c.writers.iter();\n while((ii = iter()) !== null) {\n work[w++] = ii[1];; // value\n work[w++] = ii[0];; // thread\n }\n iter = c.readers.iter();\n while((ii = iter()) !== null) {\n work[w++] = ii;;\n }\n if(c.waiters) {\n for(i=c.waiters.length-1;i>=0;i--) {\n work[w++] = c.waiters[i];;\n }\n }\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\n } else if(c instanceof h$MutVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n } else if(c instanceof h$TVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n iter = c.blocked.iter();\n while((ii = iter.next()) !== null) {\n work[w++] = ii;;\n }\n if(c.invariants) {\n iter = c.invariants.iter();\n while((ii = iter.next()) !== null) {\n work[w++] = ii;;\n }\n }\n } else if(c instanceof h$Thread) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n if(c.stack) {\n for(i=c.sp;i>=0;i--) {\n work[w++] = c.stack[i];;\n }\n }\n for(i=0;i<c.excep.length;i++) {\n work[w++] = c.excep[i];;\n }\n } else if(c instanceof h$Transaction) {\n // - the accessed TVar values don't need to be marked\n // - parents are also on the stack, so they should've been marked already\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n for(i=c.invariants.length-1;i>=0;i--) {\n work[w++] = c.invariants[i].action;;\n }\n work[w++] = c.action;;\n iter = c.tvars.iter();\n while((ii = iter.nextVal()) !== null) {\n work[w++] = ii.val;;\n }\n } else if(c instanceof Array && c.__ghcjsArray) {\n // only for Haskell arrays with lifted values\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n ;\n for(i=0;i<c.length;i++) {\n var x = c[i];\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) {\n work[w++] = x;;\n }\n }\n } else if(typeof c === 'object') {\n ;\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\n var x = h$extensibleRetentionCallbacks[i](c, mark);\n if(x === false) continue;\n if(x !== true) {\n for(j=x.length-1;j>=0;j--) {\n work[w++] = x[j];;\n }\n }\n break;\n }\n } // otherwise: not an object, no followable values\n }\n }\n ;\n}","function h$follow(obj, sp) {\n var i, ii, iter, c, work, w;\n ;\n var work, mark = h$gcMark;\n if(typeof sp === 'number') {\n work = obj.slice(0, sp+1);\n w = sp + 1;\n } else {\n work = [obj];\n w = 1;\n }\n while(w > 0) {\n ;\n c = work[--w];\n ;\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\n var doMark = false;\n var cf = c.f;\n ;\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\n ;\n // only change the two least significant bits for heap objects\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n // dynamic references\n var d = c.d2;\n switch(cf.size) {\n case 0: break;\n case 1: work[w++] = c.d1;; break;\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\n default: w = h$followObjGen(c,work,w);\n }\n // static references\n var s = cf.s;\n if(s !== null) {\n ;\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\n }\n } else if(c instanceof h$FastWeak) {\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n if(c.ticket !== null && !((typeof c.ticket.m === 'number' && (c.ticket.m & 3) === mark) || (typeof c.ticket.m === 'object' && ((c.ticket.m.m & 3) === mark)))) {\n c.ticket = null; // If the ticket isn't reachable, this will let it get cleaned up by the JS gc; if it is reachable, it'll fill this back in\n }\n } else if(c instanceof h$FastWeakTicket) {\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n if(!((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) {\n work[w++] = c.val;;\n }\n if(((typeof c.weak.m === 'number' && (c.weak.m & 3) === mark) || (typeof c.weak.m === 'object' && ((c.weak.m.m & 3) === mark)))) {\n // In this case, the weak side has been marked first, which means it's been cleared; restore it\n c.weak.ticket = c;\n }\n } else if(c instanceof h$FastWeakBag) {\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n var j = 0; // j should always be equal to the number of not-yet-necessarily-dead tickets that have been traversed; this should always be less than or equal to i\n for(i = 0; i < c.tickets.length; i++) {\n // Any nulls left in the array prior to checking on the tickets must be tickets that died in the last GC, so we ignore them\n if(c.tickets[i] !== null) {\n if(j !== i) {\n c.tickets[i].pos = j;\n }\n if(!((typeof c.tickets[i].m === 'number' && (c.tickets[i].m & 3) === mark) || (typeof c.tickets[i].m === 'object' && ((c.tickets[i].m.m & 3) === mark)))) {\n // If the ticket isn't reachable, this will let it get cleaned up by the JS gc; if it is reachable, it'll fill this back in\n c.tickets[j] = null;\n } else if(j !== i) {\n // We need to move the item\n c.tickets[j] = c.tickets[i];\n } // If it's marked and not moving, don't do anything\n j++;\n }\n }\n c.tickets.length = j; // Shrink the array if any nulls have been dropped\n } else if(c instanceof h$FastWeakBagTicket) {\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n if(!((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) {\n work[w++] = c.val;;\n }\n if(((typeof c.bag.m === 'number' && (c.bag.m & 3) === mark) || (typeof c.bag.m === 'object' && ((c.bag.m.m & 3) === mark)))) {\n // In this case, the weak side has been marked first, which means it's been cleared; restore it\n c.bag.tickets[c.pos] = c;\n }\n } else if(c instanceof h$Weak) {\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n } else if(c instanceof h$MVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n iter = c.writers.iter();\n while((ii = iter()) !== null) {\n work[w++] = ii[1];; // value\n work[w++] = ii[0];; // thread\n }\n iter = c.readers.iter();\n while((ii = iter()) !== null) {\n work[w++] = ii;;\n }\n if(c.waiters) {\n for(i=c.waiters.length-1;i>=0;i--) {\n work[w++] = c.waiters[i];;\n }\n }\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\n } else if(c instanceof h$MutVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n } else if(c instanceof h$TVar) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n work[w++] = c.val;;\n iter = c.blocked.iter();\n while((ii = iter.next()) !== null) {\n work[w++] = ii;;\n }\n if(c.invariants) {\n iter = c.invariants.iter();\n while((ii = iter.next()) !== null) {\n work[w++] = ii;;\n }\n }\n } else if(c instanceof h$Thread) {\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n if(c.stack) {\n for(i=c.sp;i>=0;i--) {\n work[w++] = c.stack[i];;\n }\n }\n for(i=0;i<c.excep.length;i++) {\n work[w++] = c.excep[i];;\n }\n } else if(c instanceof h$Transaction) {\n // - the accessed TVar values don't need to be marked\n // - parents are also on the stack, so they should've been marked already\n ;\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n for(i=c.invariants.length-1;i>=0;i--) {\n work[w++] = c.invariants[i].action;;\n }\n work[w++] = c.action;;\n iter = c.tvars.iter();\n while((ii = iter.nextVal()) !== null) {\n work[w++] = ii.val;;\n }\n } else if(c instanceof Array && c.__ghcjsArray) {\n // only for Haskell arrays with lifted values\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\n ;\n for(i=0;i<c.length;i++) {\n var x = c[i];\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) {\n work[w++] = x;;\n }\n }\n } else if(typeof c === 'object') {\n ;\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\n var x = h$extensibleRetentionCallbacks[i](c, mark);\n if(x === false) continue;\n if(x !== true) {\n for(j=x.length-1;j>=0;j--) {\n work[w++] = x[j];;\n }\n }\n break;\n }\n } // otherwise: not an object, no followable values\n }\n }\n ;\n}","function bi_windup(s) {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","performGC() {\n if (this.yolo || this.heapAlloc.liveSize() < (this.gcThreshold * rtsConstants.mblock_size)) {\n // Garbage collection is skipped. This happens in yolo mode,\n // or when the total number of \"live\" blocks is below the given threshold\n // (by \"live\", we mean allocated and not yet freed - see HeapAlloc.liveSize).\n // This avoids a lot of GC invocations\n // (see {@link https://github.com/tweag/asterius/pull/379}).\n this.updateNursery();\n return;\n }\n this.reentrancyGuard.enter(1);\n\n // Set the current generation number to 1, so that\n // closures are evacuated in the older generation.\n // Also, only major collections for now.\n this.heapAlloc.setGenerationNo(1);\n\n // Evacuate TSOs\n for (const [_, tso_info] of this.scheduler.tsos) {\n tso_info.addr = this.evacuateClosure(tso_info.addr);\n }\n\n // Evacuate stable pointers\n for (const [sp, c] of this.stablePtrManager.spt.entries()) {\n this.stablePtrManager.spt.set(sp, this.evacuateClosure(c));\n }\n\n // Stage the movement of stable pointers.\n // Step 1: Move all the pointers\n // Step 2: Update the pointer -> stablepointer mapping\n // We cannot do this at the same time, since moving the pointer while\n // we walk the ptr2stable map can yield an infinite loop:\n // eg. (ptr:0 stablename: 42) --MOVE--> (ptr:1 stablename:42) --MOVE--> (ptr:2 stablename:42) ...\n let ptr2stableMoved = new Map();\n for (const [ptr, stable] of this.stableNameManager.ptr2stable.entries()) {\n const ptrMoved = this.evacuateClosure(ptr);\n const stableMoved = this.evacuateClosure(stable);\n ptr2stableMoved.set(ptrMoved, stableMoved);\n }\n this.stableNameManager.ptr2stable = ptr2stableMoved;\n\n // do the rest of the scavenging work\n this.scavengeLoop();\n\n // update the ret pointer in the complete TSOs\n for (const [_, tso_info] of this.scheduler.tsos) {\n if (tso_info.ret) {\n const tso = tso_info.addr;\n const stackobj = (\n this.memory.i32Load(tso + rtsConstants.offset_StgTSO_stackobj)\n );\n const sp = (\n this.memory.i32Load(stackobj + rtsConstants.offset_StgStack_sp)\n );\n tso_info.ret = (this.memory.i32Load(sp + 4));\n }\n }\n\n // mark unused blocks\n this.heapAlloc.handleLiveness(this.liveBlocks, this.deadBlocks);\n // set current generation back to 0\n this.heapAlloc.setGenerationNo(0);\n // allocate a new nursery\n this.updateNursery();\n // garbage collect unused JSVals\n this.components.jsvalManager = this.liveJSValManager;\n // cleanup\n this.nonMovedObjects.clear();\n this.liveBlocks.clear();\n this.deadBlocks.clear();\n this.liveJSValManager = new JSValManager(this.components);\n this.reentrancyGuard.exit(1);\n }","park_vehicle(vehicle) {\n //Initial Loop through the list of parking slots\n for(var i=0 ; i<this.sizes.length; i++) {\n //check if the slot is occupied and if the vehicle size is SMALL\n //Small vehicles can park either of the three, Small, Medium, Large Parking Slot\n if(vehicle.vehicle_size === 'S' && !this.sizes[i].occupied) {\n //check if where would be the vehicle coming from entry point 1;\n if(vehicle.entry_point === 1) {\n // calculate for the closest distance from where the vehicle is coming from\n var currDistance = Math.abs(1 - this.map[0].entry_point1);\n var newDistance = Math.abs(1 - this.map[i].entry_point1);\n // check if the new distance is less than the curr distance if so park the vehicle\n // else park the vehicle with the lowest distance from the entry point of the vehicle\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n //check if where would be the vehicle coming from entry point 2;\n else if(vehicle.entry_point == 2) {\n // calculate for the closest distance from where the vehicle is coming from\n var currDistance = Math.abs(1 - this.map[0].entry_point2);\n var newDistance = Math.abs(1 - this.map[i].entry_point2);\n // check if the new distance is less than the curr distance if so park the vehicle\n // else park the vehicle with the lowest distance from the entry point of the vehicle\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n //check if where would be the vehicle coming from entry point 3;\n else if(vehicle.entry_point == 3) {\n // calculate for the closest distance from where the vehicle is coming from\n var currDistance = Math.abs(1 - this.map[0].entry_point3);\n var newDistance = Math.abs(1 - this.map[i].entry_point3);\n // check if the new distance is less than the curr distance if so park the vehicle\n // else park the vehicle with the lowest distance from the entry point of the vehicle\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n }\n //check the size of the vehicle and if the parking slot is occupied\n else if (vehicle.vehicle_size === 'M' && !this.sizes[i].occupied) {\n //if the vehicle size is medium it can only be parked at medium slot and large slot\n if(this.sizes[i].slot_size === MEDIUM_SLOT || this.sizes[i].slot_size === LARGE_SLOT) {\n if(vehicle.entry_point === 1) {\n var currDistance = Math.abs(1 - this.map[0].entry_point1);\n var newDistance = Math.abs(1 - this.map[i].entry_point1);\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n else if(vehicle.entry_point == 2) {\n var currDistance = Math.abs(1 - this.map[0].entry_point2);\n var newDistance = Math.abs(1 - this.map[i].entry_point2);\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n else if(vehicle.entry_point == 3) {\n var currDistance = Math.abs(1 - this.map[0].entry_point3);\n var newDistance = Math.abs(1 - this.map[i].entry_point3);\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n return [this.map[i], this.sizes[i]]\n }\n }\n // if there is no more available slot for the vehicle to parked\n // return no avaialable parking slot\n } else {\n return 'No available Parking Slot'\n }\n }\n //checks if the vehicle size is Large and if the parking slot is occupied\n //Large vehicles can only be parked at Large Parking Slot\n else if (vehicle.vehicle_size === 'L' && !this.sizes[i].occupied) {\n if(this.sizes[i].slot_size === LARGE_SLOT) {\n if(vehicle.entry_point === 1) {\n var currDistance = Math.abs(1 - this.map[0].entry_point1);\n var newDistance = Math.abs(1 - this.map[i].entry_point1);\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n else if(vehicle.entry_point == 2) {\n var currDistance = Math.abs(1 - this.map[0].entry_point2);\n var newDistance = Math.abs(1 - this.map[i].entry_point2);\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n else if(vehicle.entry_point == 3) {\n var currDistance = Math.abs(1 - this.map[0].entry_point3);\n var newDistance = Math.abs(1 - this.map[i].entry_point3);\n if(newDistance < currDistance) {\n currDistance = newDistance;\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n } else {\n this.sizes[i].occupied = true;\n this.sizes[i].charge = 40;\n this.sizes[i].time_in = new Date()\n this.sizes[i].vehicle = vehicle;\n return [this.map[i], this.sizes[i]]\n }\n }\n } else {\n return 'No available Parking Slot'\n }\n } \n }\n }","function bi_windup(s) {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n }","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}","function bi_windup(s)\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n}"],"string":"[\n \"_McDonaldAlloc(size) {\\n size = roundUp(size, this._alignment);\\n\\n for (let i = 0; i < this._chunkCount; ++i) {\\n const chunk = this._chunks[i];\\n let isFound = false;\\n let start = chunk.start;\\n\\n if (start + size <= chunk.end) {\\n isFound = true;\\n } else if (start > chunk.end) {\\n if (start + size <= chunk.size) {\\n isFound = true;\\n } else if (size <= chunk.end) {\\n // Try to find from head again.\\n chunk.start = start = 0;\\n isFound = true;\\n }\\n } else if (start === chunk.end) {\\n chunk.start = start = 0;\\n chunk.end = chunk.size;\\n\\n if (size <= chunk.end) {\\n isFound = true;\\n }\\n }\\n\\n if (isFound) {\\n chunk.start += size;\\n const handle = {\\n chunkIdx: i,\\n start,\\n end: start + size,\\n texture: chunk.texture\\n };\\n\\n this._handles.push(handle);\\n\\n return handle;\\n }\\n } // create a new one\\n\\n\\n const targetSize = Math.sqrt(size / this._formatSize);\\n const texLength = this._roundUpFn && this._roundUpFn(targetSize, this._formatSize) || Math.max(1024, nearestPOT(targetSize));\\n\\n const newChunk = this._chunks[this.createChunk(texLength)];\\n\\n newChunk.start += size;\\n const texHandle = {\\n chunkIdx: this._chunkCount,\\n start: 0,\\n end: size,\\n texture: newChunk.texture\\n };\\n\\n this._handles.push(texHandle);\\n\\n return texHandle;\\n }\",\n \"scavengeLoop() {\\n const closures = this.nonMovedObjectsToScavenge,\\n blocks = this.blocksToScavenge;\\n\\n let currentBlock = undefined, currentObject = undefined;\\n\\n // Note: there are various nested loops, mainly because there are\\n // two kinds of objects, that must be scavenged in a different way:\\n // objects that have been copied in to-space, and non-moved objects.\\n // Objects copied in to-space are scavenged by traversing the\\n // to-space sequentially. Non-moved objects are stored\\n // in `this.nonMovedObjects` and must be handled separately.\\n // Moreover, scavenging an object of either kind may introduce\\n // new objects of either kind.\\n while (true) {\\n if (!currentBlock) {\\n // We try and pick a new block to scavenge\\n currentBlock = blocks.pop();\\n if (currentBlock)\\n // If there exists a block to scavenge,\\n // start with the object pointed\\n // by the `start` field in the block\\n // descriptor\\n currentObject = (\\n this.memory.i32Load(\\n currentBlock + rtsConstants.offset_bdescr_start\\n )\\n );\\n }\\n // Iterate over the objects in the `currentBlock`,\\n // but only if there's such a block\\n while (currentBlock) {\\n // `currentLimit` is the upper limit for `currentBlock`\\n // and consists of a pointer to the free space in the\\n // current block\\n const currentLimit = (\\n this.memory.i32Load(\\n currentBlock + rtsConstants.offset_bdescr_free\\n )\\n );\\n if (currentObject >= currentLimit)\\n // There are no more blocks to scavenge in the\\n // `currentBlock`. Break, but do not unset\\n // the current block, as we are not done with\\n // it yet: scavenging the non-moved closures below\\n // may add new objects to `currentBlock`.\\n break;\\n // Scavenge the current object, and increase the\\n // `currentObject` address of the amount (sizeof) provided by\\n // the `scavengeClosure` function.\\n currentObject += this.scavengeClosure(currentObject);\\n }\\n if (blocks.length > 0) {\\n // There are more blocks to scavenge:\\n // since we have completely processed the\\n // current currentBlock, we can continue\\n // and pick the next one\\n currentBlock = currentObject = undefined;\\n continue;\\n } else if (closures.length == 0)\\n // There are no more block to scavenge,\\n // nor in the to-space nor among the non-moved\\n // objects. We are done.\\n return;\\n // Scavenge the remaining non-moved objects\\n while (closures.length > 0) {\\n this.scavengeClosure(closures.pop());\\n }\\n // Continue scavenging the possibly newly evacuated objects\\n }\\n }\",\n \"call(handle) {\\n this.registers[$ra] = this.registers[$pc];\\n this.setPc(this.heap.getaddr(handle));\\n }\",\n \"call(handle) {\\n false && false;\\n this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\\\"$ra\\\"]] = this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\\\"$pc\\\"]];\\n this.setPc(this.heap.getaddr(handle));\\n }\",\n \"call(handle) {\\n false && false;\\n this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\\\"$ra\\\"]] = this.registers[_glimmer_vm__WEBPACK_IMPORTED_MODULE_1__[\\\"$pc\\\"]];\\n this.setPc(this.heap.getaddr(handle));\\n }\",\n \"insert(item) {\\n this.heap.push(item);\\n this.size++;\\n\\n // put it at the end\\n let i = this.size - 1;\\n this.locations.set(this.hash(item), i);\\n\\n while (i > 0) {\\n let parent = this.parentIndex(i);\\n\\n if (this.validParent(i, parent))\\n break;\\n\\n // swap item places\\n this.heap[i] = this.heap[parent];\\n this.heap[parent] = item;\\n\\n // set locations on the swap\\n this.locations.set(this.hash(item), parent);\\n this.locations.set(this.hash(this.heap[i]), i);\\n\\n i = parent;\\n }\\n }\",\n \"function incrementPointer() {\\t\\t\\t\\n\\t\\t\\tpointerAddress += 1;\\n\\t\\t\\tif(pointerAddress >= instructions.length) {\\t\\t\\t\\n\\t\\t\\t\\twindow.console.log('Brainfuck program finished.');\\n\\t\\t\\t\\tstatus = STATUSES['STOPPED'];\\n\\t\\t\\t}\\n\\t\\t}\",\n \"_pushSegmentPointer(pointer, index) {\\n return [\\n // addr = segmentPointer + i\\n '@' + index,\\n 'D=A',\\n '@' + pointer,\\n this._pointerIsNumber(pointer) ? 'A=D+A' : 'A=D+M',\\n // *SP = *addr\\n 'D=M',\\n '@SP',\\n 'A=M',\\n 'M=D',\\n\\n // SP++\\n '@SP',\\n 'M=M+1',\\n ]\\n }\",\n \"function linebrk(buf, n) {\\n\\tvar s = buf.toString('ascii');\\n\\tvar ret = \\\"\\\";\\n\\tvar i = 0;\\n\\twhile (i + n < s.length) {\\n\\t\\tret += s.substring(i, i + n) + \\\"\\\\n\\\";\\n\\t\\ti += n;\\n\\t}\\n\\treturn ret + s.substring(i, s.length);\\n}\",\n \"processKeys(dt) {\\n\\t\\tvar npos = this.pos.copy();\\n\\t\\tif (this.keys['a']) {\\n\\t\\t\\tnpos.x -= dt * 200;\\n\\t\\t}\\n\\t\\telse if (this.keys['d']) {\\n\\t\\t\\tnpos.x += dt * 200;\\n\\t\\t}\\n\\t\\tif (this.keys['w']) {\\n\\t\\t\\tnpos.y -= dt * 200;\\n\\t\\t}\\n\\t\\telse if (this.keys['s']) {\\n\\t\\t\\tnpos.y += dt * 200;\\n\\t\\t}\\n\\n\\t\\tthis.pos = this.processPos(npos);\\n\\t\\tif(this.mouseUpdated) {\\n\\t\\t\\tvar rpos = this.mousePos.div(CellSize).round();\\n\\t\\t\\tvar neighbour = false;\\n\\t\\t\\tlet shift = [new Vector2(0, 0), new Vector2(-1, 0), new Vector2(1, 0), new Vector2(0, -1), new Vector2(0, 1)];\\n\\t\\t\\tfor(let i = 0; i < 5; i++) {\\n\\t\\t\\t\\tvar t = rpos.add(shift[i]);\\n\\t\\t\\t\\tif(this.map.checkCoords(t.x, t.y) && this.map.get(t.x, t.y).owner == this.id) {\\n\\t\\t\\t\\t\\tneighbour = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(neighbour) {\\n\\t\\t\\t\\tif(this.mouseButton == 0) {\\n\\t\\t\\t\\t\\tif(this.map.checkCoords(rpos.x, rpos.y) && this.workers >= 1) {\\n\\t\\t\\t\\t\\t\\tvar block = this.map.get(rpos.x, rpos.y);\\n\\t\\t\\t\\t\\t\\t//var dist = block.physics.rpos.add(new Vector2(1 / 2, 1 / 2)).sub(this.physics.rpos.add(this.physics.size.diva(CellSize.x * 2))).abs();\\n\\t\\t\\t\\t\\t\\tif(this.energy >= block.energyCost || (block.id == 12 && this.energy >= block.energyCost / 10)) { \\n\\t\\t\\t\\t\\t\\t\\tif(this.map.breakBlock(rpos.x, rpos.y, {gameId: this.network.gameId, side: this.network.side})) {\\n\\t\\t\\t\\t\\t\\t\\t\\tthis.workers--;\\n\\t\\t\\t\\t\\t\\t\\t\\tif(block.id == 12) this.energy -= block.energyCost / 10;\\n\\t\\t\\t\\t\\t\\t\\t\\telse if(!block.needBlock) this.energy -= block.energyCost;\\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\\telse if(this.mouseButton == 2) {\\n\\t\\t\\t\\t\\tif(this.map.checkCoords(rpos.x, rpos.y) && this.workers >= 1 && this.energy >= 5 && this.stone >= 5) {\\n\\t\\t\\t\\t\\t\\tvar block = this.map.get(rpos.x, rpos.y);\\n\\t\\t\\t\\t\\t\\t//var dist = block.physics.rpos.add(new Vector2(1 / 2, 1 / 2)).sub(this.physics.rpos.add(this.physics.size.diva(CellSize.x * 2))).abs();\\n\\t\\t\\t\\t\\t\\t//if(dist <= 5) {\\n\\t\\t\\t\\t\\t\\t\\tvar good = true;\\n\\t\\t\\t\\t\\t\\t\\trooms[this.network.room].players.forEach(function(item, i, arr) {\\n\\t\\t\\t\\t\\t\\t\\t\\tgood = good && (!block.physics.intersects(item.physics) || !item.alive);\\n\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\tif(good && block.id == 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\tblock.id = 12;\\n\\t\\t\\t\\t\\t\\t\\t\\tblock.owner = this.id;\\n\\t\\t\\t\\t\\t\\t\\t\\tthis.energy -= 5;\\n\\t\\t\\t\\t\\t\\t\\t\\tthis.stone -= 5;\\n\\t\\t\\t\\t\\t\\t\\t\\tthis.map.updateBlock(Math.floor(rpos.x), Math.floor(rpos.y));\\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}\\n\\t\\t\\tthis.mouseUpdated = false;\\n\\t\\t}\\n\\t}\",\n \"function onAlloc () {\\n allocDoneCount++\\n }\",\n \"allocate(size) {\\n if (this.head + size > this.memory.length) {\\n return null;\\n }\\n\\n let start = this.head;\\n\\n this.head += size;\\n return start;\\n }\",\n \"get _virtualEnd(){return this._virtualStart+this._physicalCount-1;}\",\n \"function bi_windup(s) {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n }\",\n \"function blockify(piece) {\\n\\t\\tpiece.shape.moveTo(blockHeap);\\n\\t\\t\\n\\t\\t/*\\n\\t\\tTODO: will have to use a 2d array as trying to use .getIntersections for each tile is not performant enough\\n\\t\\t\\n\\t\\t*/\\n\\t\\t\\n\\t\\tfor (var i = 0, len = tetrjs.config.board.height; i<len; i++) {\\n\\t\\t\\tfor (var j = 0, len2 = tetrjs.config.board.width; j<len; j++) {\\n\\t\\t\\t\\tvar x = (j * tetrjs.config.board.blockSize) + tetrjs.config.board.blockSize/2;\\n\\t\\t\\t\\tvar y = (i * tetrjs.config.board.blockSize) + tetrjs.config.board.blockSize/2;\\n\\t\\t\\t\\tvar ints = tetrjs.game.getBlockHeap().getIntersections(x,y);\\n\\t\\t\\t\\tfor (var k = 0; k < ints.length; k++) {\\n\\t\\t\\t\\t\\t//console.log(\\\"intersects\\\", ints[k].getAbsolutePosition());\\n\\t\\t\\t\\t\\t/*_layer.add( new Kinetic.Rect({\\n\\t\\t\\t\\t\\t\\tx: x,\\n\\t\\t\\t\\t\\t\\ty: y,\\n\\t\\t\\t\\t\\t\\twidth: 1,\\n\\t\\t\\t\\t\\t\\theight: 1,\\n\\t\\t\\t\\t\\t\\tstroke: \\\"red\\\",\\n\\t\\t\\t\\t\\t\\tstrokeWidth:1,\\n\\t\\t\\t\\t\\t\\tdetectionType: \\\"path\\\"\\n\\t\\t\\t\\t\\t}) );*/\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcurrentShape = null;\\n\\t}\",\n \"function snakeMemory(){\\n if(snakeTail>1){\\n for (var i = 1; i < snakeTail; i++) {\\n snake[snake.length - i][0] = snake[(snake.length-i)-1][0];\\n snake[snake.length - i][1] = snake[(snake.length-i)-1][1];\\n }\\n }\\n}\",\n \"rollInProcess(ct, segNum) {\\n let filename = DeviceDriverDisk.swapPrefix + ct.pid;\\n let byteString = _krnDiskDriver.readFile(filename);\\n if (byteString == undefined) {\\n console.log(\\\"Could not roll in PID \\\" + ct.pid);\\n console.log(new Error().stack);\\n }\\n // Convert string to bytes\\n let bytes = byteString.split(\\\"\\\").map(function (x) {\\n return x.charCodeAt(0);\\n });\\n bytes = bytes.slice(0, _MMU.segmentSize);\\n _MMU.clearSegment(segNum);\\n _MMU.loadBytesToSegment(segNum, bytes);\\n // Let the process context know that it is in memory\\n ct.segment = segNum;\\n ct.inMemory = true;\\n return 0;\\n }\",\n \"function h$follow(obj, sp) {\\n var i, ii, iter, c, work, w;\\n\\n\\n\\n ;\\n var work, mark = h$gcMark;\\n if(typeof sp === 'number') {\\n work = obj.slice(0, sp+1);\\n w = sp + 1;\\n } else {\\n work = [obj];\\n w = 1;\\n }\\n while(w > 0) {\\n ;\\n c = work[--w];\\n ;\\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\\n var doMark = false;\\n var cf = c.f;\\n ;\\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\\n ;\\n // only change the two least significant bits for heap objects\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n // dynamic references\\n var d = c.d2;\\n switch(cf.size) {\\n case 0: break;\\n case 1: work[w++] = c.d1;; break;\\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\\n default: w = h$followObjGen(c,work,w);\\n }\\n // static references\\n var s = cf.s;\\n if(s !== null) {\\n ;\\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\\n }\\n } else if(c instanceof h$Weak) {\\n ;\\n if(c.keym.m === mark) {\\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\\n } else {\\n // fixme we should keep separate arrays for\\n // value mark pending / cleanup pending?\\n if(c.val !== null) h$scannedWeaks.push(c);\\n }\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n } else if(c instanceof h$MVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n /*\\n only push the values in the queues, not the waiting threads\\n\\n the threads will be scanned after threads waiting on unreachable\\n MVars have been cleaned up\\n */\\n iter = c.writers.iter();\\n while((ii = iter()) !== null) work[w++] = ii[1];;\\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\\n } else if(c instanceof h$MutVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n } else if(c instanceof h$TVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n } else if(c instanceof h$Thread) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n if(c.stack) {\\n for(i=c.sp;i>=0;i--) work[w++] = c.stack[i];;\\n }\\n } else if(c instanceof h$Transaction) {\\n /* - the accessed TVar values don't need to be marked\\n - parents are also on the stack, so they should've been marked already\\n */\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n for(i=c.invariants.length-1;i>=0;i--) work[w++] = c.invariants[i];;\\n work[w++] = c.action;;\\n iter = c.tvars.iter();\\n while((ii = iter.next()) !== null) work[w++] = ii;;\\n } else if(c instanceof Array && c.__ghcjsArray) { // only for Haskell arrays with lifted values\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n ;\\n for(i=0;i<c.length;i++) {\\n var x = c[i];\\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) work[w++] = x;;\\n }\\n } else if(typeof c === 'object') {\\n ;\\n\\n\\n\\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\\n var x = h$extensibleRetentionCallbacks[i](c, mark);\\n if(x === false) continue;\\n\\n\\n\\n if(x !== true) {\\n for(j=x.length-1;j>=0;j--) work[w++] = x[j];;\\n }\\n break;\\n }\\n\\n\\n\\n\\n\\n } // otherwise: not an object, no followable values\\n }\\n }\\n ;\\n}\",\n \"get _virtualEnd(){return this._virtualStart+this._physicalCount-1}\",\n \"function bi_windup(s) {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n }\",\n \"onBreaking(i, j, source) {\\n\\t\\tvar block = this.get(i, j);\\n\\t\\tvar stoneCost = block.stoneCost;\\n\\t\\tvar pl;\\n\\t\\tif(source.side == 0) pl = rooms[this.room].players[source.gameId];\\n\\t\\telse pl = rooms[this.room].viruses[source.gameId];\\n\\t\\tif(pl) {\\n\\t\\t\\tpl.workers++;\\n\\t\\t\\tpl.stone += stoneCost;\\n\\t\\t}\\n\\t\\tif(this.checkCoords(i, j - 1) && this.get(i, j - 1).needBlock) {\\n\\t\\t\\tthis.breakBlock(i, j - 1, source);\\n\\t\\t\\tif(pl) {\\n\\t\\t\\t\\tpl.workers--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// if(block.owner >= 0) {\\n\\t\\t// \\tvar owner = rooms[this.room].network[block.owner];\\n\\t\\t// \\tif(owner.side == 0) {\\n\\t\\t// \\t\\towner = rooms[owner.room].players[owner.gameId];\\n\\t\\t// \\t}\\n\\t\\t// \\telse {\\n\\t\\t// \\t\\towner = rooms[owner.room].viruses[owner.gameId];\\n\\n\\t\\t// \\t\\tif(owner.core.rpos.x == i && owner.core.rpos.y == j) {\\n\\t\\t// \\t\\t\\towner.alive = false;\\n\\t\\t// \\t\\t}\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\t\\tblock.id = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t {\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t }\",\n \"function bi_windup(s) {\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"_findSlot(key) {\\n const hash = HashMap._hashString(key);\\n const start = hash % this._capacity;\\n // We use a for loop to avoid collisions by open addressing\\n for (let i = start; i < start + this._capacity; i++) {\\n const index = i % this._capacity;\\n const slot = this._hashTable[index];\\n // console.log('index: ', index);\\n // console.log('slot: ', slot);\\n if (slot === undefined || (slot.key === key && !slot.DELETED)) {\\n // console.log('undefined slot found')\\n return index;\\n } else {\\n // console.log('undefined slot NOT FOUND... next?')\\n }\\n }\\n }\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s)\\n\\t{\\n\\t if (s.bi_valid > 8) {\\n\\t put_short(s, s.bi_buf);\\n\\t } else if (s.bi_valid > 0) {\\n\\t //put_byte(s, (Byte)s->bi_buf);\\n\\t s.pending_buf[s.pending++] = s.bi_buf;\\n\\t }\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t}\",\n \"function bi_windup(s){if(s.bi_valid>8){put_short(s,s.bi_buf);}else if(s.bi_valid>0){//put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++]=s.bi_buf;}s.bi_buf=0;s.bi_valid=0;}\",\n \"function bi_windup(s)\\n {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n }\",\n \"map_sram(bank_start, bank_end, addr_start, addr_end) {\\n\\t\\tlet offset = 0;\\n\\t\\tfor (let c = bank_start; c <= bank_end; c++) {\\n\\t\\t\\tfor (let i = addr_start; i <= addr_end; i += 0x1000) {\\n\\t\\t\\t\\tlet b = (c << 4) | (i >>> 12);\\n\\t\\t\\t\\tthis.readmap[b].kind = this.writemap[b].kind = MAP_TI.SRAM;\\n\\t\\t\\t\\tthis.readmap[b].offset = this.writemap[b].offset = offset;\\n\\t\\t\\t\\tthis.block_is_ROM[b] = false;\\n\\t\\t\\t\\tthis.block_is_RAM[b] = false;\\n\\t\\t\\t\\toffset += 0x1000;\\n\\t\\t\\t\\t//if (offset > this.SRAMSize) return;\\n\\t\\t\\t\\tif (offset > this.SRAMSize) offset = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"_calculateBounds() {\\n // FILL IN//\\n }\",\n \"insert(point){\\n if(!this.boundary.contains(point)){\\n return false;\\n } \\n if((this.points.length<this.capacity && !this.isDivided)||this.depth===MAX_DEPTH){\\n this.points.push(point);\\n return true;\\n } else {\\n if(!this.isDivided){\\n this.subdivide();\\n }\\n \\n if(this.northeast.insert(point)){\\n return true;\\n } else if(this.northwest.insert(point)){\\n return true;\\n } else if(this.southeast.insert(point)){\\n return true;\\n } else if(this.southwest.insert(point)){\\n return true;\\n } \\n }\\n }\",\n \"pathFindSheet(list, pad) {\\n const c = this.LIBRARY_TILE\\n const yMax = c.mask.height;\\n const tmp_list = []; // new list\\n let cache = {};\\n let antiFreeze = 500000;\\n\\n for (let I = 0, L = list.length; I < L; I++) {\\n const cage = list[I];\\n let x = +pad, y = +pad;\\n let w = cage.width, h = cage.height;\\n cage.position.set(x,y);\\n cage.getBounds();\\n // scan, no collid with alrealy added cage\\n for (let i = 0, l = tmp_list.length, contact = false; i < l; i++) {\\n const temp = tmp_list[i];\\n if($app.hitCheck(cage,temp)){\\n i = -1;\\n y+=(h+pad);\\n // si collision, jump pixel line X++\\n if(y+h>yMax){ x+=pad, y = +pad }\\n else{ y+=pad };\\n cage.position.set(x,y);\\n cage.getBounds();\\n };\\n if(!antiFreeze--){ console.error(\\\"error:antiFreeze\\\"); break };\\n };\\n // no break hitCheck, we can add\\n tmp_list.push(cage);\\n cache[cage.dataObj._textureName] = new PIXI.Point(x,y); //REGISTER\\n cage._boundsRect.pad(pad+2,pad+1);\\n };\\n return cache;\\n }\",\n \"function h$follow(obj, sp) {\\n var i, ii, iter, c, work, w;\\n ;\\n var work, mark = h$gcMark;\\n if(typeof sp === 'number') {\\n work = obj.slice(0, sp+1);\\n w = sp + 1;\\n } else {\\n work = [obj];\\n w = 1;\\n }\\n while(w > 0) {\\n ;\\n c = work[--w];\\n ;\\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\\n var doMark = false;\\n var cf = c.f;\\n ;\\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\\n ;\\n // only change the two least significant bits for heap objects\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n // dynamic references\\n var d = c.d2;\\n switch(cf.size) {\\n case 0: break;\\n case 1: work[w++] = c.d1;; break;\\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\\n default: w = h$followObjGen(c,work,w);\\n }\\n // static references\\n var s = cf.s;\\n if(s !== null) {\\n ;\\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\\n }\\n } else if(c instanceof h$Weak) {\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n } else if(c instanceof h$MVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n iter = c.writers.iter();\\n while((ii = iter()) !== null) {\\n work[w++] = ii[1];; // value\\n work[w++] = ii[0];; // thread\\n }\\n iter = c.readers.iter();\\n while((ii = iter()) !== null) {\\n work[w++] = ii;;\\n }\\n if(c.waiters) {\\n for(i=c.waiters.length-1;i>=0;i--) {\\n work[w++] = c.waiters[i];;\\n }\\n }\\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\\n } else if(c instanceof h$MutVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n } else if(c instanceof h$TVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n iter = c.blocked.iter();\\n while((ii = iter.next()) !== null) {\\n work[w++] = ii;;\\n }\\n if(c.invariants) {\\n iter = c.invariants.iter();\\n while((ii = iter.next()) !== null) {\\n work[w++] = ii;;\\n }\\n }\\n } else if(c instanceof h$Thread) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n if(c.stack) {\\n for(i=c.sp;i>=0;i--) {\\n work[w++] = c.stack[i];;\\n }\\n }\\n for(i=0;i<c.excep.length;i++) {\\n work[w++] = c.excep[i];;\\n }\\n } else if(c instanceof h$Transaction) {\\n // - the accessed TVar values don't need to be marked\\n // - parents are also on the stack, so they should've been marked already\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n for(i=c.invariants.length-1;i>=0;i--) {\\n work[w++] = c.invariants[i].action;;\\n }\\n work[w++] = c.action;;\\n iter = c.tvars.iter();\\n while((ii = iter.nextVal()) !== null) {\\n work[w++] = ii.val;;\\n }\\n } else if(c instanceof Array && c.__ghcjsArray) {\\n // only for Haskell arrays with lifted values\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n ;\\n for(i=0;i<c.length;i++) {\\n var x = c[i];\\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) {\\n work[w++] = x;;\\n }\\n }\\n } else if(typeof c === 'object') {\\n ;\\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\\n var x = h$extensibleRetentionCallbacks[i](c, mark);\\n if(x === false) continue;\\n if(x !== true) {\\n for(j=x.length-1;j>=0;j--) {\\n work[w++] = x[j];;\\n }\\n }\\n break;\\n }\\n } // otherwise: not an object, no followable values\\n }\\n }\\n ;\\n}\",\n \"function h$follow(obj, sp) {\\n var i, ii, iter, c, work, w;\\n ;\\n var work, mark = h$gcMark;\\n if(typeof sp === 'number') {\\n work = obj.slice(0, sp+1);\\n w = sp + 1;\\n } else {\\n work = [obj];\\n w = 1;\\n }\\n while(w > 0) {\\n ;\\n c = work[--w];\\n ;\\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\\n var doMark = false;\\n var cf = c.f;\\n ;\\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\\n ;\\n // only change the two least significant bits for heap objects\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n // dynamic references\\n var d = c.d2;\\n switch(cf.size) {\\n case 0: break;\\n case 1: work[w++] = c.d1;; break;\\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\\n default: w = h$followObjGen(c,work,w);\\n }\\n // static references\\n var s = cf.s;\\n if(s !== null) {\\n ;\\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\\n }\\n } else if(c instanceof h$Weak) {\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n } else if(c instanceof h$MVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n iter = c.writers.iter();\\n while((ii = iter()) !== null) {\\n work[w++] = ii[1];; // value\\n work[w++] = ii[0];; // thread\\n }\\n iter = c.readers.iter();\\n while((ii = iter()) !== null) {\\n work[w++] = ii;;\\n }\\n if(c.waiters) {\\n for(i=c.waiters.length-1;i>=0;i--) {\\n work[w++] = c.waiters[i];;\\n }\\n }\\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\\n } else if(c instanceof h$MutVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n } else if(c instanceof h$TVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n iter = c.blocked.iter();\\n while((ii = iter.next()) !== null) {\\n work[w++] = ii;;\\n }\\n if(c.invariants) {\\n iter = c.invariants.iter();\\n while((ii = iter.next()) !== null) {\\n work[w++] = ii;;\\n }\\n }\\n } else if(c instanceof h$Thread) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n if(c.stack) {\\n for(i=c.sp;i>=0;i--) {\\n work[w++] = c.stack[i];;\\n }\\n }\\n for(i=0;i<c.excep.length;i++) {\\n work[w++] = c.excep[i];;\\n }\\n } else if(c instanceof h$Transaction) {\\n // - the accessed TVar values don't need to be marked\\n // - parents are also on the stack, so they should've been marked already\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n for(i=c.invariants.length-1;i>=0;i--) {\\n work[w++] = c.invariants[i].action;;\\n }\\n work[w++] = c.action;;\\n iter = c.tvars.iter();\\n while((ii = iter.nextVal()) !== null) {\\n work[w++] = ii.val;;\\n }\\n } else if(c instanceof Array && c.__ghcjsArray) {\\n // only for Haskell arrays with lifted values\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n ;\\n for(i=0;i<c.length;i++) {\\n var x = c[i];\\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) {\\n work[w++] = x;;\\n }\\n }\\n } else if(typeof c === 'object') {\\n ;\\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\\n var x = h$extensibleRetentionCallbacks[i](c, mark);\\n if(x === false) continue;\\n if(x !== true) {\\n for(j=x.length-1;j>=0;j--) {\\n work[w++] = x[j];;\\n }\\n }\\n break;\\n }\\n } // otherwise: not an object, no followable values\\n }\\n }\\n ;\\n}\",\n \"function h$follow(obj, sp) {\\n var i, ii, iter, c, work, w;\\n ;\\n var work, mark = h$gcMark;\\n if(typeof sp === 'number') {\\n work = obj.slice(0, sp+1);\\n w = sp + 1;\\n } else {\\n work = [obj];\\n w = 1;\\n }\\n while(w > 0) {\\n ;\\n c = work[--w];\\n ;\\n if(c !== null && c !== undefined && typeof c === 'object' && ((typeof c.m === 'number' && (c.m&3) !== mark) || (typeof c.m === 'object' && c.m !== null && typeof c.m.m === 'number' && (c.m.m&3) !== mark))) {\\n var doMark = false;\\n var cf = c.f;\\n ;\\n if(typeof cf === 'function' && (typeof c.m === 'number' || typeof c.m === 'object')) {\\n ;\\n // only change the two least significant bits for heap objects\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n // dynamic references\\n var d = c.d2;\\n switch(cf.size) {\\n case 0: break;\\n case 1: work[w++] = c.d1;; break;\\n case 2: { work[w++] = c.d1; work[w++] = d; }; break;\\n case 3: var d3=c.d2; { work[w++] = c.d1; work[w++] = d3.d1; work[w++] = d3.d2; }; break;\\n case 4: var d4=c.d2; { work[w++] = c.d1; work[w++] = d4.d1; work[w++] = d4.d2; work[w++] = d4.d3; }; break;\\n case 5: var d5=c.d2; { work[w++] = c.d1; work[w++] = d5.d1; work[w++] = d5.d2; work[w++] = d5.d3; }; work[w++] = d5.d4;; break;\\n case 6: var d6=c.d2; { work[w++] = c.d1; work[w++] = d6.d1; work[w++] = d6.d2; work[w++] = d6.d3; }; { work[w++] = d6.d4; work[w++] = d6.d5; }; break;\\n case 7: var d7=c.d2; { work[w++] = c.d1; work[w++] = d7.d1; work[w++] = d7.d2; work[w++] = d7.d3; }; { work[w++] = d7.d4; work[w++] = d7.d5; work[w++] = d7.d6; }; break;\\n case 8: var d8=c.d2; { work[w++] = c.d1; work[w++] = d8.d1; work[w++] = d8.d2; work[w++] = d8.d3; }; { work[w++] = d8.d4; work[w++] = d8.d5; work[w++] = d8.d6; work[w++] = d8.d7; }; break;\\n case 9: var d9=c.d2; { work[w++] = c.d1; work[w++] = d9.d1; work[w++] = d9.d2; work[w++] = d9.d3; }; { work[w++] = d9.d4; work[w++] = d9.d5; work[w++] = d9.d6; work[w++] = d9.d7; }; work[w++] = d9.d8;; break;\\n case 10: var d10=c.d2; { work[w++] = c.d1; work[w++] = d10.d1; work[w++] = d10.d2; work[w++] = d10.d3; }; { work[w++] = d10.d4; work[w++] = d10.d5; work[w++] = d10.d6; work[w++] = d10.d7; }; { work[w++] = d10.d8; work[w++] = d10.d9; }; break;\\n case 11: var d11=c.d2; { work[w++] = c.d1; work[w++] = d11.d1; work[w++] = d11.d2; work[w++] = d11.d3; }; { work[w++] = d11.d4; work[w++] = d11.d5; work[w++] = d11.d6; work[w++] = d11.d7; }; { work[w++] = d11.d8; work[w++] = d11.d9; work[w++] = d11.d10; }; break;\\n case 12: var d12=c.d2; { work[w++] = c.d1; work[w++] = d12.d1; work[w++] = d12.d2; work[w++] = d12.d3; }; { work[w++] = d12.d4; work[w++] = d12.d5; work[w++] = d12.d6; work[w++] = d12.d7; }; { work[w++] = d12.d8; work[w++] = d12.d9; work[w++] = d12.d10; work[w++] = d12.d11; }; break;\\n default: w = h$followObjGen(c,work,w);\\n }\\n // static references\\n var s = cf.s;\\n if(s !== null) {\\n ;\\n for(var i=0;i<s.length;i++) work[w++] = s[i];;\\n }\\n } else if(c instanceof h$FastWeak) {\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n if(c.ticket !== null && !((typeof c.ticket.m === 'number' && (c.ticket.m & 3) === mark) || (typeof c.ticket.m === 'object' && ((c.ticket.m.m & 3) === mark)))) {\\n c.ticket = null; // If the ticket isn't reachable, this will let it get cleaned up by the JS gc; if it is reachable, it'll fill this back in\\n }\\n } else if(c instanceof h$FastWeakTicket) {\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n if(!((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) {\\n work[w++] = c.val;;\\n }\\n if(((typeof c.weak.m === 'number' && (c.weak.m & 3) === mark) || (typeof c.weak.m === 'object' && ((c.weak.m.m & 3) === mark)))) {\\n // In this case, the weak side has been marked first, which means it's been cleared; restore it\\n c.weak.ticket = c;\\n }\\n } else if(c instanceof h$FastWeakBag) {\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n var j = 0; // j should always be equal to the number of not-yet-necessarily-dead tickets that have been traversed; this should always be less than or equal to i\\n for(i = 0; i < c.tickets.length; i++) {\\n // Any nulls left in the array prior to checking on the tickets must be tickets that died in the last GC, so we ignore them\\n if(c.tickets[i] !== null) {\\n if(j !== i) {\\n c.tickets[i].pos = j;\\n }\\n if(!((typeof c.tickets[i].m === 'number' && (c.tickets[i].m & 3) === mark) || (typeof c.tickets[i].m === 'object' && ((c.tickets[i].m.m & 3) === mark)))) {\\n // If the ticket isn't reachable, this will let it get cleaned up by the JS gc; if it is reachable, it'll fill this back in\\n c.tickets[j] = null;\\n } else if(j !== i) {\\n // We need to move the item\\n c.tickets[j] = c.tickets[i];\\n } // If it's marked and not moving, don't do anything\\n j++;\\n }\\n }\\n c.tickets.length = j; // Shrink the array if any nulls have been dropped\\n } else if(c instanceof h$FastWeakBagTicket) {\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n if(!((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) {\\n work[w++] = c.val;;\\n }\\n if(((typeof c.bag.m === 'number' && (c.bag.m & 3) === mark) || (typeof c.bag.m === 'object' && ((c.bag.m.m & 3) === mark)))) {\\n // In this case, the weak side has been marked first, which means it's been cleared; restore it\\n c.bag.tickets[c.pos] = c;\\n }\\n } else if(c instanceof h$Weak) {\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n } else if(c instanceof h$MVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n iter = c.writers.iter();\\n while((ii = iter()) !== null) {\\n work[w++] = ii[1];; // value\\n work[w++] = ii[0];; // thread\\n }\\n iter = c.readers.iter();\\n while((ii = iter()) !== null) {\\n work[w++] = ii;;\\n }\\n if(c.waiters) {\\n for(i=c.waiters.length-1;i>=0;i--) {\\n work[w++] = c.waiters[i];;\\n }\\n }\\n if(c.val !== null && !((typeof c.val.m === 'number' && (c.val.m & 3) === mark) || (typeof c.val.m === 'object' && ((c.val.m.m & 3) === mark)))) work[w++] = c.val;;\\n } else if(c instanceof h$MutVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n } else if(c instanceof h$TVar) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n work[w++] = c.val;;\\n iter = c.blocked.iter();\\n while((ii = iter.next()) !== null) {\\n work[w++] = ii;;\\n }\\n if(c.invariants) {\\n iter = c.invariants.iter();\\n while((ii = iter.next()) !== null) {\\n work[w++] = ii;;\\n }\\n }\\n } else if(c instanceof h$Thread) {\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n if(c.stack) {\\n for(i=c.sp;i>=0;i--) {\\n work[w++] = c.stack[i];;\\n }\\n }\\n for(i=0;i<c.excep.length;i++) {\\n work[w++] = c.excep[i];;\\n }\\n } else if(c instanceof h$Transaction) {\\n // - the accessed TVar values don't need to be marked\\n // - parents are also on the stack, so they should've been marked already\\n ;\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n for(i=c.invariants.length-1;i>=0;i--) {\\n work[w++] = c.invariants[i].action;;\\n }\\n work[w++] = c.action;;\\n iter = c.tvars.iter();\\n while((ii = iter.nextVal()) !== null) {\\n work[w++] = ii.val;;\\n }\\n } else if(c instanceof Array && c.__ghcjsArray) {\\n // only for Haskell arrays with lifted values\\n if(typeof c.m === 'number') c.m = (c.m&-4)|mark; else c.m.m = (c.m.m & -4)|mark;;\\n ;\\n for(i=0;i<c.length;i++) {\\n var x = c[i];\\n if(typeof x === 'object' && x !== null && !((typeof x.m === 'number' && (x.m & 3) === mark) || (typeof x.m === 'object' && ((x.m.m & 3) === mark)))) {\\n work[w++] = x;;\\n }\\n }\\n } else if(typeof c === 'object') {\\n ;\\n for(i=h$extensibleRetentionCallbacks.length-1;i>=0;i--) {\\n var x = h$extensibleRetentionCallbacks[i](c, mark);\\n if(x === false) continue;\\n if(x !== true) {\\n for(j=x.length-1;j>=0;j--) {\\n work[w++] = x[j];;\\n }\\n }\\n break;\\n }\\n } // otherwise: not an object, no followable values\\n }\\n }\\n ;\\n}\",\n \"function bi_windup(s) {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"performGC() {\\n if (this.yolo || this.heapAlloc.liveSize() < (this.gcThreshold * rtsConstants.mblock_size)) {\\n // Garbage collection is skipped. This happens in yolo mode,\\n // or when the total number of \\\"live\\\" blocks is below the given threshold\\n // (by \\\"live\\\", we mean allocated and not yet freed - see HeapAlloc.liveSize).\\n // This avoids a lot of GC invocations\\n // (see {@link https://github.com/tweag/asterius/pull/379}).\\n this.updateNursery();\\n return;\\n }\\n this.reentrancyGuard.enter(1);\\n\\n // Set the current generation number to 1, so that\\n // closures are evacuated in the older generation.\\n // Also, only major collections for now.\\n this.heapAlloc.setGenerationNo(1);\\n\\n // Evacuate TSOs\\n for (const [_, tso_info] of this.scheduler.tsos) {\\n tso_info.addr = this.evacuateClosure(tso_info.addr);\\n }\\n\\n // Evacuate stable pointers\\n for (const [sp, c] of this.stablePtrManager.spt.entries()) {\\n this.stablePtrManager.spt.set(sp, this.evacuateClosure(c));\\n }\\n\\n // Stage the movement of stable pointers.\\n // Step 1: Move all the pointers\\n // Step 2: Update the pointer -> stablepointer mapping\\n // We cannot do this at the same time, since moving the pointer while\\n // we walk the ptr2stable map can yield an infinite loop:\\n // eg. (ptr:0 stablename: 42) --MOVE--> (ptr:1 stablename:42) --MOVE--> (ptr:2 stablename:42) ...\\n let ptr2stableMoved = new Map();\\n for (const [ptr, stable] of this.stableNameManager.ptr2stable.entries()) {\\n const ptrMoved = this.evacuateClosure(ptr);\\n const stableMoved = this.evacuateClosure(stable);\\n ptr2stableMoved.set(ptrMoved, stableMoved);\\n }\\n this.stableNameManager.ptr2stable = ptr2stableMoved;\\n\\n // do the rest of the scavenging work\\n this.scavengeLoop();\\n\\n // update the ret pointer in the complete TSOs\\n for (const [_, tso_info] of this.scheduler.tsos) {\\n if (tso_info.ret) {\\n const tso = tso_info.addr;\\n const stackobj = (\\n this.memory.i32Load(tso + rtsConstants.offset_StgTSO_stackobj)\\n );\\n const sp = (\\n this.memory.i32Load(stackobj + rtsConstants.offset_StgStack_sp)\\n );\\n tso_info.ret = (this.memory.i32Load(sp + 4));\\n }\\n }\\n\\n // mark unused blocks\\n this.heapAlloc.handleLiveness(this.liveBlocks, this.deadBlocks);\\n // set current generation back to 0\\n this.heapAlloc.setGenerationNo(0);\\n // allocate a new nursery\\n this.updateNursery();\\n // garbage collect unused JSVals\\n this.components.jsvalManager = this.liveJSValManager;\\n // cleanup\\n this.nonMovedObjects.clear();\\n this.liveBlocks.clear();\\n this.deadBlocks.clear();\\n this.liveJSValManager = new JSValManager(this.components);\\n this.reentrancyGuard.exit(1);\\n }\",\n \"park_vehicle(vehicle) {\\n //Initial Loop through the list of parking slots\\n for(var i=0 ; i<this.sizes.length; i++) {\\n //check if the slot is occupied and if the vehicle size is SMALL\\n //Small vehicles can park either of the three, Small, Medium, Large Parking Slot\\n if(vehicle.vehicle_size === 'S' && !this.sizes[i].occupied) {\\n //check if where would be the vehicle coming from entry point 1;\\n if(vehicle.entry_point === 1) {\\n // calculate for the closest distance from where the vehicle is coming from\\n var currDistance = Math.abs(1 - this.map[0].entry_point1);\\n var newDistance = Math.abs(1 - this.map[i].entry_point1);\\n // check if the new distance is less than the curr distance if so park the vehicle\\n // else park the vehicle with the lowest distance from the entry point of the vehicle\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n //check if where would be the vehicle coming from entry point 2;\\n else if(vehicle.entry_point == 2) {\\n // calculate for the closest distance from where the vehicle is coming from\\n var currDistance = Math.abs(1 - this.map[0].entry_point2);\\n var newDistance = Math.abs(1 - this.map[i].entry_point2);\\n // check if the new distance is less than the curr distance if so park the vehicle\\n // else park the vehicle with the lowest distance from the entry point of the vehicle\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n //check if where would be the vehicle coming from entry point 3;\\n else if(vehicle.entry_point == 3) {\\n // calculate for the closest distance from where the vehicle is coming from\\n var currDistance = Math.abs(1 - this.map[0].entry_point3);\\n var newDistance = Math.abs(1 - this.map[i].entry_point3);\\n // check if the new distance is less than the curr distance if so park the vehicle\\n // else park the vehicle with the lowest distance from the entry point of the vehicle\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n }\\n //check the size of the vehicle and if the parking slot is occupied\\n else if (vehicle.vehicle_size === 'M' && !this.sizes[i].occupied) {\\n //if the vehicle size is medium it can only be parked at medium slot and large slot\\n if(this.sizes[i].slot_size === MEDIUM_SLOT || this.sizes[i].slot_size === LARGE_SLOT) {\\n if(vehicle.entry_point === 1) {\\n var currDistance = Math.abs(1 - this.map[0].entry_point1);\\n var newDistance = Math.abs(1 - this.map[i].entry_point1);\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n else if(vehicle.entry_point == 2) {\\n var currDistance = Math.abs(1 - this.map[0].entry_point2);\\n var newDistance = Math.abs(1 - this.map[i].entry_point2);\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n else if(vehicle.entry_point == 3) {\\n var currDistance = Math.abs(1 - this.map[0].entry_point3);\\n var newDistance = Math.abs(1 - this.map[i].entry_point3);\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n // if there is no more available slot for the vehicle to parked\\n // return no avaialable parking slot\\n } else {\\n return 'No available Parking Slot'\\n }\\n }\\n //checks if the vehicle size is Large and if the parking slot is occupied\\n //Large vehicles can only be parked at Large Parking Slot\\n else if (vehicle.vehicle_size === 'L' && !this.sizes[i].occupied) {\\n if(this.sizes[i].slot_size === LARGE_SLOT) {\\n if(vehicle.entry_point === 1) {\\n var currDistance = Math.abs(1 - this.map[0].entry_point1);\\n var newDistance = Math.abs(1 - this.map[i].entry_point1);\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n else if(vehicle.entry_point == 2) {\\n var currDistance = Math.abs(1 - this.map[0].entry_point2);\\n var newDistance = Math.abs(1 - this.map[i].entry_point2);\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n else if(vehicle.entry_point == 3) {\\n var currDistance = Math.abs(1 - this.map[0].entry_point3);\\n var newDistance = Math.abs(1 - this.map[i].entry_point3);\\n if(newDistance < currDistance) {\\n currDistance = newDistance;\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n } else {\\n this.sizes[i].occupied = true;\\n this.sizes[i].charge = 40;\\n this.sizes[i].time_in = new Date()\\n this.sizes[i].vehicle = vehicle;\\n return [this.map[i], this.sizes[i]]\\n }\\n }\\n } else {\\n return 'No available Parking Slot'\\n }\\n } \\n }\\n }\",\n \"function bi_windup(s) {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n }\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\",\n \"function bi_windup(s)\\n{\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.50616634","0.49353954","0.49187168","0.4819843","0.4819843","0.47982058","0.47443765","0.47317523","0.47197354","0.47161573","0.47159427","0.4697439","0.46973792","0.46959123","0.46869344","0.4674198","0.46555442","0.46497506","0.46371117","0.46344137","0.46228456","0.4621153","0.46173185","0.46074134","0.46046096","0.46046096","0.46046096","0.46046096","0.46046096","0.46046096","0.46046096","0.46046096","0.4594286","0.45922467","0.457537","0.4574721","0.45684367","0.4564086","0.4556318","0.4556318","0.4556318","0.45513034","0.45182282","0.45146713","0.4500033","0.44964495","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857","0.44879857"],"string":"[\n \"0.50616634\",\n \"0.49353954\",\n \"0.49187168\",\n \"0.4819843\",\n \"0.4819843\",\n \"0.47982058\",\n \"0.47443765\",\n \"0.47317523\",\n \"0.47197354\",\n \"0.47161573\",\n \"0.47159427\",\n \"0.4697439\",\n \"0.46973792\",\n \"0.46959123\",\n \"0.46869344\",\n \"0.4674198\",\n \"0.46555442\",\n \"0.46497506\",\n \"0.46371117\",\n \"0.46344137\",\n \"0.46228456\",\n \"0.4621153\",\n \"0.46173185\",\n \"0.46074134\",\n \"0.46046096\",\n \"0.46046096\",\n \"0.46046096\",\n \"0.46046096\",\n \"0.46046096\",\n \"0.46046096\",\n \"0.46046096\",\n \"0.46046096\",\n \"0.4594286\",\n \"0.45922467\",\n \"0.457537\",\n \"0.4574721\",\n \"0.45684367\",\n \"0.4564086\",\n \"0.4556318\",\n \"0.4556318\",\n \"0.4556318\",\n \"0.45513034\",\n \"0.45182282\",\n \"0.45146713\",\n \"0.4500033\",\n \"0.44964495\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\",\n \"0.44879857\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4682,"cells":{"query":{"kind":"string","value":"Tools This processes a JS string into a Cline array of numbers, 0terminated. For LLVMoriginating strings, see parser.js:parseLLVMString function"},"document":{"kind":"string","value":"function intArrayFromString(stringy, dontAddNull, length /* optional */) {\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\n if (length) {\n ret.length = length;\n }\n if (!dontAddNull) {\n ret.push(0);\n }\n return ret;\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 intArrayFromString(stringy, dontAddNull, length /* optional */ ) {\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\n if (length) {\n ret.length = length;\n }\n if (!dontAddNull) {\n ret.push(0);\n }\n return ret;\n }","function intArrayFromString(stringy, dontAddNull, length /* optional */ ) {\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\n if (length) {\n ret.length = length;\n }\n if (!dontAddNull) {\n ret.push(0);\n }\n return ret;\n}","function intArrayFromString(stringy, dontAddNull, length /* optional */ ) {\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\n if (length) {\n ret.length = length;\n }\n if (!dontAddNull) {\n ret.push(0);\n }\n return ret;\n}","parseCSIBuffer() {\n var entries = [];\n var currentEntry = \"\";\n for (let c of this.csiBuffer) {\n if (c == ';') {\n if (currentEntry.length == 0) {\n entries.push(0);\n }\n entries.push(Number(currentEntry));\n currentEntry = \"\";\n }\n else if (c.charCodeAt(0) <= 0x39) {\n currentEntry += c;\n }\n else {\n return [];\n }\n }\n\n if (currentEntry.length != 0) {\n entries.push(Number(currentEntry));\n }\n else {\n entries.push(0);\n }\n\n return entries;\n }","function caml_lex_array(s) {\n s = s.getFullBytes();\n var a = [], l = s.length / 2;\n for (var i = 0; i < l; i++)\n a[i] = (s.charCodeAt(2 * i) | (s.charCodeAt(2 * i + 1) << 8)) << 16 >> 16;\n return a;\n}","function codeScript(nums) {\n let result = [];\n let n = nums.toString().split('');\n n.forEach((d, i) => (n[i + 1]) ? result.push(n[i + 1]) : result.push(n.shift()));\n return Number(result.join(''));\n}","function h$jsstringLines1(n, x) {\n ;\n var m = n, l = x.length;\n if(n >= l) return -1;\n while(m < l) {\n if(x.charCodeAt(m++) === 10) {\n // found newline\n if(n > 0 && n === l-1) return -1; // it was the last character\n var r1 = (m-n<=1) ? \"\" : x.substr(n,m-n-1);\n { h$ret1 = (r1); return (m); };\n }\n }\n // end of string\n { h$ret1 = (x.substr(n)); return (m); };\n}","function h$jsstringLines1(n, x) {\n ;\n var m = n, l = x.length;\n if(n >= l) return -1;\n while(m < l) {\n if(x.charCodeAt(m++) === 10) {\n // found newline\n if(n > 0 && n === l-1) return -1; // it was the last character\n var r1 = (m-n<=1) ? \"\" : x.substr(n,m-n-1);\n { h$ret1 = (r1); return (m); };\n }\n }\n // end of string\n { h$ret1 = (x.substr(n)); return (m); };\n}","function h$jsstringLines1(n, x) {\n ;\n var m = n, l = x.length;\n if(n >= l) return -1;\n while(m < l) {\n if(x.charCodeAt(m++) === 10) {\n // found newline\n if(n > 0 && n === l-1) return -1; // it was the last character\n var r1 = (m-n<=1) ? \"\" : x.substr(n,m-n-1);\n { h$ret1 = (r1); return (m); };\n }\n }\n // end of string\n { h$ret1 = (x.substr(n)); return (m); };\n}","function h$jsstringLines1(n, x) {\n ;\n var m = n, l = x.length;\n if(n >= l) return -1;\n while(m < l) {\n if(x.charCodeAt(m++) === 10) {\n // found newline\n if(n > 0 && n === l-1) return -1; // it was the last character\n var r1 = (m-n<=1) ? \"\" : x.substr(n,m-n-1);\n { h$ret1 = (r1); return (m); };\n }\n }\n // end of string\n { h$ret1 = (x.substr(n)); return (m); };\n}","function h$jsstringLines1(n, x) {\n ;\n var m = n, l = x.length;\n if(n >= l) return -1;\n while(m < l) {\n if(x.charCodeAt(m++) === 10) {\n // found newline\n if(n > 0 && n === l-1) return -1; // it was the last character\n var r1 = (m-n<=1) ? \"\" : x.substr(n,m-n-1);\n { h$ret1 = (r1); return (m); };\n }\n }\n // end of string\n { h$ret1 = (x.substr(n)); return (m); };\n}","_parseDataLine(line){\n line = line.replace(/#/g,1).replace(/\\+/g,2).replace(/\\s/g,0).split('');\n return line;\n }","function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_1__[\"Token\"](_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_3__[\"TokenKind\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString_mjs__WEBPACK_IMPORTED_MODULE_2__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}","function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_1__[\"Token\"](_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_2__[\"TokenKind\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__[\"dedentBlockStringValue\"])(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\"syntaxError\"])(source, position, 'Unterminated string.');\n}","function parseSourceMapInput(str){return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/,''));}","function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_0__.Token(_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_1__.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0,_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, 'Unterminated string.');\n}","function readBlockString(source, start, line, col, prev, lexer) {\n var body = source.body;\n var position = start + 3;\n var chunkStart = position;\n var code = 0;\n var rawValue = '';\n\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\n // Closing Triple-Quote (\"\"\")\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\n rawValue += body.slice(chunkStart, position);\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_0__.Token(_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_1__.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0,_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__.dedentBlockStringValue)(rawValue));\n } // SourceCharacter\n\n\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, \"Invalid character within String: \".concat(printCharCode(code), \".\"));\n }\n\n if (code === 10) {\n // new line\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n } else if (code === 13) {\n // carriage return\n if (body.charCodeAt(position + 1) === 10) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n } else if ( // Escape Triple-Quote (\\\"\"\")\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\n rawValue += body.slice(chunkStart, position) + '\"\"\"';\n position += 4;\n chunkStart = position;\n } else {\n ++position;\n }\n }\n\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, 'Unterminated string.');\n}","function addLineNumbers( string ) {\n\n\tvar lines = string.split( '\\n' );\n\n\tfor ( var i = 0; i < lines.length; i ++ ) {\n\n\t\tlines[ i ] = ( i + 1 ) + ': ' + lines[ i ];\n\n\t}\n\n\treturn lines.join( '\\n' );\n\n}","function ParseLine(j,line,localcontext,SyntaxText)\n {\n var IsInSingleLineCommentString = false;\n var IsInStringLiteral = false;\n var ReservedWordCharCount = 0;\n var SavedIsInMultiLineCommentString=localcontext.IsInMultiLineCommentString;\n \n for (var i =0; i < line.length; i++)\n {\n //---------------------------------------------------------\n // Find start and end of comments and asm blocks\n //---------------------------------------------------------\n \n if (IsInStringLiteral==false)\n {\n // find multi line comment markers\n if (IsInSingleLineCommentString == false)\n {\n // Note there are two types of multi line marker and they need to be matched up\n if ((localcontext.IsInAltMultiLineCommentString == false)&&(localcontext.IsInASMMultiLineCommentString == false))\n {\n if(line[i] == EndOfMultiLineComment)\n { localcontext.IsInMultiLineCommentString = false; }\n if (line[i] == StartOfMultiLineComment)\n { localcontext.IsInMultiLineCommentString = true;}\n };\n if (localcontext.IsInAltMultiLineCommentString == true)\n {\n if((line[i] == \"*\")&&(line[i+1] == \")\"))\n { localcontext.IsInMultiLineCommentString = false;\n localcontext.IsInAltMultiLineCommentString = false;\n }\n };\n \n if (localcontext.IsInASMMultiLineCommentString == true)\n {\n if((line[i] == \"e\")&&(line[i+1] == \"n\")&&(line[i+2] == \"d\")&&(line[i+3] == \";\") )\n { localcontext.IsInMultiLineCommentString = false;\n localcontext.IsInASMMultiLineCommentString = false;\n }\n };\n \n if (localcontext.IsInMultiLineCommentString == false)\n {\n if((line[i] == \"(\")&&(line[i+1] == \"*\"))\n { localcontext.IsInMultiLineCommentString = true;\n localcontext.IsInAltMultiLineCommentString = true;\n }\n \n if((line[i-4] == \" \")&&(line[i-3] == \"a\")&&(line[i-2] == \"s\")&&(line[i-1] == \"m\")&&(line[i] == \" \") )\n { localcontext.IsInMultiLineCommentString = true;\n localcontext.IsInASMMultiLineCommentString = true;\n }\n }\n }\n \n if (localcontext.IsInMultiLineCommentString == false)\n {\n // find single line comment marker pair \"//\"\n if((line[i] == StartOfSingleLineCommentdelimiter)&&(line[i + 1] == StartOfSingleLineCommentdelimiter))\n { IsInSingleLineCommentString = true };\n }\n }\n \n //---------------------------------------------------------\n // mark the chars with the appropriate colour highlighting\n //---------------------------------------------------------\n \n if ((localcontext.IsInMultiLineCommentString == true)||(IsInSingleLineCommentString == true))\n { SyntaxText.newgreenline = SyntaxText.newgreenline + line[i] }\n else { SyntaxText.newgreenline = SyntaxText.newgreenline + \" \" };\n \n if ((localcontext.IsInMultiLineCommentString == false) && (IsInSingleLineCommentString == false)&& (IsInStringLiteral == false)&&(ReservedWordCharCount<1))\n { SyntaxText.newblackline = SyntaxText.newblackline + line[i] }\n else { SyntaxText.newblackline = SyntaxText.newblackline + \" \" };\n \n if ((localcontext.IsInMultiLineCommentString == false) && (IsInSingleLineCommentString == false) && (IsInStringLiteral == false)&&(ReservedWordCharCount>0))\n { SyntaxText.newboldline = SyntaxText.newboldline + line[i]}\n else { SyntaxText.newboldline = SyntaxText.newboldline + \" \" };\n \n if (IsInStringLiteral == true)\n { SyntaxText.newblueline = SyntaxText.newblueline + line[i] }\n else { SyntaxText.newblueline = SyntaxText.newblueline + \" \" } ;\n \n //---------------------------------------------------------\n // Find strings and reserved words\n //---------------------------------------------------------\n \n if ((localcontext.IsInMultiLineCommentString == false) && (IsInSingleLineCommentString == false))\n {\n // find start and end of string\n if(line[i] == StringDelimiter)\n {\n if (IsInStringLiteral == false)\n {\n IsInStringLiteral = true;\n }\n else { IsInStringLiteral = false };\n }\n \n // find reserved words\n if (ReservedWordCharCount > 0) { ReservedWordCharCount = ReservedWordCharCount - 1; };\n var lowercaseline = line.toLowerCase() + \" \";\n if ((IsInStringLiteral == false)&& isDelimiter(line[i])\n && (lowercaseline.charCodeAt(i + 1) > 96) && (lowercaseline.charCodeAt(i + 1) < 123)) // space follwed by a lower case letter\n {\n var charindex = lowercaseline.charCodeAt(i + 1) - 96;\n ReservedWordCharCount = matchReservedWord(lowercaseline, i + 1, charindex);\n }\n }\n }\n var MultilineChanges = true;\n if (SavedIsInMultiLineCommentString == localcontext.IsInMultiLineCommentString){MultilineChanges = false};\n localcontext.MultiLineCommentChangedStatus=MultilineChanges;\n return MultilineChanges; // true if any of the changes on this line have consequences for the next line(s)\n }","function codeScript(code){\n\tvar numberString = code.toString();\n\tvar firstNumber = numberString.charAt(0);\n\tvar otherNumbers = numberString.slice(1,code.length);\n\tvar completeCode = otherNumbers+\"\"+firstNumber;\n\tcoding = completeCode;\n\tconsole.log(completeCode);\n}","function parse(stackString) {\n var lines = stackString.split('\\n');\n return lines.reduce(function (stack, line) {\n var parseResult = parseChrome(line) || parseWinjs(line) || parseGecko(line) || parseNode(line) || parseJSC(line);\n\n if (parseResult) {\n stack.push(parseResult);\n }\n\n return stack;\n }, []);\n }","function litToCode(lines, lang) {\n const retLines = []\n const markdownIndented = /^([ ]{4}|[ ]{0,3}\\t)/\n let inCode = lines[0] && markdownIndented.exec(lines[0])\n\n /** Remembering that a source code line are those without leading \" \":\n * add a comment marker at the beginning of each non-code line\n * Take out the leading \" \" from every code line\n **/\n for (const [i, line] of lines.entries()) {\n /**\n Empty lines are a special case:\n - in code, they must stay blank.\n - In doc, they myst include the comment marker\n **/\n const emptyLine = /^\\s*$/.test(line)\n /* Non-empty lines are added depending on them being code or doc. */\n if (!emptyLine) {\n inCode = markdownIndented.exec(line)\n retLines[i] = inCode\n ? line.slice(inCode[0].length)\n : lang.symbol + ' ' + line\n /* The concept of \"empty\" changes whether we are in code or not */\n } else {\n retLines[i] = inCode ? '' : lang.symbol\n }\n }\n return retLines\n}","function split_linebreaks(s) {\n\t //return s.split(/\\x0d\\x0a|\\x0a/);\n\t\n\t s = s.replace(acorn.allLineBreaks, '\\n');\n\t var out = [],\n\t idx = s.indexOf(\"\\n\");\n\t while (idx !== -1) {\n\t out.push(s.substring(0, idx));\n\t s = s.substring(idx + 1);\n\t idx = s.indexOf(\"\\n\");\n\t }\n\t if (s.length) {\n\t out.push(s);\n\t }\n\t return out;\n\t }","function parseraw(s) {\n const m = s.match(/^n(\\d+)h(\\d+)c(\\d+)p(\\w+)$/)\n if (m===null) return [2, 0, 0, 1/2]\n return [parseInt(m[1]), parseInt(m[2]), parseInt(m[3]), pdec(m[4])]\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, \"\"));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''))\n }","function $fe91$var$decodeCodePointsArray(codePoints) {\n var len = codePoints.length;\n\n if (len <= $fe91$var$MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints); // avoid extra slice()\n } // Decode in chunks to avoid \"call stack size exceeded\".\n\n\n var res = '';\n var i = 0;\n\n while (i < len) {\n res += String.fromCharCode.apply(String, codePoints.slice(i, i += $fe91$var$MAX_ARGUMENTS_LENGTH));\n }\n\n return res;\n}","static fromString(str) {\n var strMsg = function(strMsg) { return parseInt(strMsg, 16); }\n // .{8} => matches any character (except for line terminators)\n // {8} => Matches exactly 8 times\n // /g => global. All matches (don't return after first match)\n var [upper, lower] = str.match(/.{8}/g).map(strMsg);\n return new jsLong(upper, lower);\n }","function caml_array_of_string (s) {\n if (s.t != 4 /* ARRAY */) caml_convert_string_to_array(s);\n return s.c;\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}","function _decodeStackLine ( str )\n\t{\n\t\tvar text, index, name;\n\n\t\ttext = \"\";\n\n\t\tif ( str.search( \".js\" ) !== -1 )\t// Code lines\n\t\t{\n\t\t\tindex = str.lastIndexOf( \"/\" ) + 1;\n\t\t\tname = str.substr( index ).replace( /^[\\s\\(\\)]+|[\\s\\(\\)]+$/g, '' );\n\n\t\t\t// Remove the column from the line\n\n\t\t\tif ( name.split( \":\" ).length === 3 )\n\t\t\t{\n\t\t\t\tname = name.substr( 0, name.lastIndexOf( \":\" ) );\n\t\t\t}\n\t\t\tif ( name !== \"\" )\n\t\t\t{\n\t\t\t\ttext += ( \" \" + name + \"\\n\" );\n\t\t\t}\n\t\t}\n\n\t\treturn text;\n\t}","function _decodeStackLine ( str )\n\t{\n\t\tvar text, index, name;\n\n\t\ttext = \"\";\n\n\t\tif ( str.search( \".js\" ) !== -1 )\t// Code lines\n\t\t{\n\t\t\tindex = str.lastIndexOf( \"/\" ) + 1;\n\t\t\tname = str.substr( index ).replace( /^[\\s\\(\\)]+|[\\s\\(\\)]+$/g, '' );\n\n\t\t\t// Remove the column from the line\n\n\t\t\tif ( name.split( \":\" ).length === 3 )\n\t\t\t{\n\t\t\t\tname = name.substr( 0, name.lastIndexOf( \":\" ) );\n\t\t\t}\n\t\t\tif ( name !== \"\" )\n\t\t\t{\n\t\t\t\ttext += ( \" \" + name + \"\\n\" );\n\t\t\t}\n\t\t}\n\n\t\treturn text;\n\t}","function getCodePointsFromString(str) {\n return _toConsumableArray(str).map(function (each) {\n return each.codePointAt(0);\n });\n} // Gets the next emoji (from the start of a string)","parse() {\n // Parse line number.\n this.lineNumber = this.readNumber();\n if (this.lineNumber === undefined) {\n return \"Missing line number: \" + this.line;\n }\n this.result.push(z80_base_1.lo(this.lineNumber));\n this.result.push(z80_base_1.hi(this.lineNumber));\n // We only trim at the start, so there could be only spaces here, but that's not allowed.\n if (this.line.substr(this.pos).trim() === \"\") {\n return \"Empty line \" + this.lineNumber;\n }\n // Skip single optional whitespace\n if (this.pos < this.line.length && BasicParser.isWhitespace(this.line.charCodeAt(this.pos))) {\n this.pos++;\n }\n while (this.pos < this.line.length) {\n let ch = this.line.charCodeAt(this.pos);\n // Lower case anything outside of strings.\n if (ch >= 0x61 && ch < 0x61 + 26) {\n ch -= 0x20;\n }\n // Handle single-quote comment.\n if (ch === SINGLE_QUOTE) {\n // Single quote is the start of a comment, but it's encoded in a backward-compatible\n // way with several tokens.\n this.result.push(COLON, REM, REMQUOT);\n this.pos++;\n // We're done, copy the rest of the line.\n break;\n }\n // Handle string.\n if (ch === DOUBLE_QUOTE) {\n this.result.push(ch);\n this.pos++;\n while (this.pos < this.line.length) {\n ch = this.line.charCodeAt(this.pos++);\n this.result.push(ch);\n if (ch === DOUBLE_QUOTE) {\n break;\n }\n }\n }\n else {\n // See if it should be a token.\n const token = this.readToken();\n if (token === undefined) {\n // Just a regular letter.\n this.result.push(ch);\n this.pos++;\n }\n else {\n // Prefix ELSE with colon for backward compatibility.\n if (token === ELSE && this.result[this.result.length - 1] !== COLON) {\n this.result.push(COLON);\n }\n this.result.push(token);\n this.pos += TOKENS[token - FIRST_TOKEN].length;\n if (token === REM) {\n // We're done, copy the rest of the line.\n break;\n }\n if (token === DATA) {\n // Copy to end of statement.\n let inString = false;\n while (this.pos < this.line.length) {\n ch = this.line.charCodeAt(this.pos);\n if (ch === DOUBLE_QUOTE) {\n inString = !inString;\n }\n else if (ch === COLON && !inString) {\n break;\n }\n this.result.push(ch);\n this.pos++;\n }\n }\n }\n }\n }\n // Copy rest of line (for comments).\n while (this.pos < this.line.length) {\n this.result.push(this.line.charCodeAt(this.pos++));\n }\n // End-of-line marker.\n this.result.push(0);\n return new Uint8Array(this.result);\n }","function split_linebreaks(s) {\n\t //return s.split(/\\x0d\\x0a|\\x0a/);\n\n\t s = s.replace(acorn.allLineBreaks, '\\n');\n\t var out = [],\n\t idx = s.indexOf(\"\\n\");\n\t while (idx !== -1) {\n\t out.push(s.substring(0, idx));\n\t s = s.substring(idx + 1);\n\t idx = s.indexOf(\"\\n\");\n\t }\n\t if (s.length) {\n\t out.push(s);\n\t }\n\t return out;\n\t }","function stringToNumbers(args) {\n var config = getConfig(args);\n var numbers = config.input.split(\"\\n\");\n return splitOnDelimiters(numbers, config.delimiters);\n}","function lisp_parse(string) {\n lisp_assert(lisp_is_native_string(string));\n var result = lisp_program_syntax(ps(string));\n if (result.remaining.index === string.length) {\n return result.ast;\n } else {\n lisp_simple_error(\"Parse error at index: \" + result.remaining.index);\n }\n}","function parseSourceMapInput(str) {\n\t return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n\t}","function parseSourceMapInput(str) {\n\t return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n\t}","function parseSourceMapInput(str) {\n\t return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n\t}","function interpret(code, input = [], string_out = undefined) {\n \n // Define useful function(s)\n \n var to_id = function(char) {\n return [1, 0, 0, -1][\"[.,]\".indexOf(char)];\n };\n \n // Validate and format input\n \n switch (typeof input) {\n case \"number\":\n input = [BigInt(Math.trunc(input || 0))];\n break;\n case \"bigint\":\n input = [input];\n break;\n case \"string\":\n string_out = string_out === undefined ? true : string_out;\n input = input.split(\"\").map(c => BigInt(c.codePointAt(0))).reverse();\n break;\n case \"boolean\":\n input = [input ? 1 : 0];\n break;\n default:\n if (!Array.isArray(input))\n throw \"Invalid input\";\n input = [].concat.apply([], input.map((i, n) => {\n switch (typeof i) {\n case \"number\":\n return [BigInt(Math.trunc(i || 0))];\n case \"bigint\":\n return [i];\n case \"string\":\n return i.split(\"\").map(c => BigInt(c.codePointAt(0))).reverse();\n case \"boolean\":\n return [i ? 1 : 0];\n default:\n throw \"Invalid input: input[\" + n + \"]\";\n }\n })).reverse();\n }\n \n // Remove comments and detect unbalanced brackets\n \n code = code.replace(/[^[.,\\]]+/g, \"\");\n \n {\n let depth = 0;\n \n for (let i = 0; i < code.length; i++) {\n depth += to_id(code[i]);\n \n if (depth < 0)\n throw \"Unbalanced brackets\";\n }\n \n if (depth)\n throw \"Unbalanced brackets\";\n }\n \n // Ensure code is wrapped in brackets\n \n for (let d = 0, i = 0; i < code.length - 1; i++) {\n d += to_id(code[i]);\n\n if (!d) {\n code = \"[\" + code + \"]\";\n break;\n }\n }\n \n // Interpret\n \n var ptr = 0;\n var blocks = [];\n var last = 0n;\n var loop = [];\n var queue = [...input];\n \n var parent = function() {\n var result = blocks;\n var next = result[result.length - 1];\n \n while (Array.isArray(next[next.length - 1])) {\n result = result[result.length - 1];\n next = next[next.length - 1];\n }\n \n return result;\n };\n \n var block = function() {\n var result = blocks;\n \n while (Array.isArray(result[result.length - 1]))\n result = result[result.length - 1];\n \n return result;\n };\n \n var alternative = function(data) {\n if (data === undefined || data === null)\n return -1n;\n return data;\n };\n \n while (ptr < code.length) {\n switch (code[ptr]) {\n case \"[\":\n if (code[ptr - 1] == \",\" && last < 0) {\n \n for (let d = 0, i = ptr; i < code.length; i++) {\n d += to_id(code[i]);\n if (!d) {\n ptr = i;\n break;\n }\n }\n \n block().push(null);\n last = 0n;\n \n break;\n }\n \n if (code[ptr - 1] == \".\" && !last) {\n for (let d = 0, i = ptr; i < code.length; i++) {\n d += to_id(code[i]);\n if (!d) {\n ptr = i;\n break;\n }\n }\n\n block().push(null);\n last = 0n;\n\n break;\n }\n \n block().push([]);\n loop.push(code[ptr - 1] == \".\");\n last = 0n;\n \n break;\n case \".\":\n if (code[ptr - 1] == \"[\")\n last = 1n;\n if (code[ptr - 1] == \"]\")\n last = block().reduce((a, r) => a + (r || 0n), 0n);\n block().length = 0;\n break;\n case \",\":\n if (code[ptr - 1] == \"[\")\n last = alternative(queue.pop());\n else if (code[ptr - 1] == \"]\")\n last = alternative(block().pop());\n block.length = 0;\n if (code[ptr + 1] == \"]\" && last >= 0)\n queue.unshift(last);\n break;\n case \"]\":\n parent().pop();\n block().push(last);\n \n if (loop.pop()) {\n if (last) {\n for (let d = 0, i = ptr; i >= 0; i--) {\n d += to_id(code[i]);\n if (!d) {\n ptr = i;\n break;\n }\n }\n \n block().push([]);\n loop.push(true);\n last = 0n;\n \n break;\n }\n }\n \n last = 0n;\n \n break;\n }\n \n ptr += 1;\n }\n \n // Return output, by default formats as string if input was string\n \n queue.reverse();\n \n try {\n return string_out ? queue.map(c => String.fromCodePoint(Number(BigInt.asIntN(32, c)))).join(\"\") : queue;\n } catch (e) {\n return queue;\n }\n}"],"string":"[\n \"function intArrayFromString(stringy, dontAddNull, length /* optional */ ) {\\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\\n if (length) {\\n ret.length = length;\\n }\\n if (!dontAddNull) {\\n ret.push(0);\\n }\\n return ret;\\n }\",\n \"function intArrayFromString(stringy, dontAddNull, length /* optional */ ) {\\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\\n if (length) {\\n ret.length = length;\\n }\\n if (!dontAddNull) {\\n ret.push(0);\\n }\\n return ret;\\n}\",\n \"function intArrayFromString(stringy, dontAddNull, length /* optional */ ) {\\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\\n if (length) {\\n ret.length = length;\\n }\\n if (!dontAddNull) {\\n ret.push(0);\\n }\\n return ret;\\n}\",\n \"parseCSIBuffer() {\\n var entries = [];\\n var currentEntry = \\\"\\\";\\n for (let c of this.csiBuffer) {\\n if (c == ';') {\\n if (currentEntry.length == 0) {\\n entries.push(0);\\n }\\n entries.push(Number(currentEntry));\\n currentEntry = \\\"\\\";\\n }\\n else if (c.charCodeAt(0) <= 0x39) {\\n currentEntry += c;\\n }\\n else {\\n return [];\\n }\\n }\\n\\n if (currentEntry.length != 0) {\\n entries.push(Number(currentEntry));\\n }\\n else {\\n entries.push(0);\\n }\\n\\n return entries;\\n }\",\n \"function caml_lex_array(s) {\\n s = s.getFullBytes();\\n var a = [], l = s.length / 2;\\n for (var i = 0; i < l; i++)\\n a[i] = (s.charCodeAt(2 * i) | (s.charCodeAt(2 * i + 1) << 8)) << 16 >> 16;\\n return a;\\n}\",\n \"function codeScript(nums) {\\n let result = [];\\n let n = nums.toString().split('');\\n n.forEach((d, i) => (n[i + 1]) ? result.push(n[i + 1]) : result.push(n.shift()));\\n return Number(result.join(''));\\n}\",\n \"function h$jsstringLines1(n, x) {\\n ;\\n var m = n, l = x.length;\\n if(n >= l) return -1;\\n while(m < l) {\\n if(x.charCodeAt(m++) === 10) {\\n // found newline\\n if(n > 0 && n === l-1) return -1; // it was the last character\\n var r1 = (m-n<=1) ? \\\"\\\" : x.substr(n,m-n-1);\\n { h$ret1 = (r1); return (m); };\\n }\\n }\\n // end of string\\n { h$ret1 = (x.substr(n)); return (m); };\\n}\",\n \"function h$jsstringLines1(n, x) {\\n ;\\n var m = n, l = x.length;\\n if(n >= l) return -1;\\n while(m < l) {\\n if(x.charCodeAt(m++) === 10) {\\n // found newline\\n if(n > 0 && n === l-1) return -1; // it was the last character\\n var r1 = (m-n<=1) ? \\\"\\\" : x.substr(n,m-n-1);\\n { h$ret1 = (r1); return (m); };\\n }\\n }\\n // end of string\\n { h$ret1 = (x.substr(n)); return (m); };\\n}\",\n \"function h$jsstringLines1(n, x) {\\n ;\\n var m = n, l = x.length;\\n if(n >= l) return -1;\\n while(m < l) {\\n if(x.charCodeAt(m++) === 10) {\\n // found newline\\n if(n > 0 && n === l-1) return -1; // it was the last character\\n var r1 = (m-n<=1) ? \\\"\\\" : x.substr(n,m-n-1);\\n { h$ret1 = (r1); return (m); };\\n }\\n }\\n // end of string\\n { h$ret1 = (x.substr(n)); return (m); };\\n}\",\n \"function h$jsstringLines1(n, x) {\\n ;\\n var m = n, l = x.length;\\n if(n >= l) return -1;\\n while(m < l) {\\n if(x.charCodeAt(m++) === 10) {\\n // found newline\\n if(n > 0 && n === l-1) return -1; // it was the last character\\n var r1 = (m-n<=1) ? \\\"\\\" : x.substr(n,m-n-1);\\n { h$ret1 = (r1); return (m); };\\n }\\n }\\n // end of string\\n { h$ret1 = (x.substr(n)); return (m); };\\n}\",\n \"function h$jsstringLines1(n, x) {\\n ;\\n var m = n, l = x.length;\\n if(n >= l) return -1;\\n while(m < l) {\\n if(x.charCodeAt(m++) === 10) {\\n // found newline\\n if(n > 0 && n === l-1) return -1; // it was the last character\\n var r1 = (m-n<=1) ? \\\"\\\" : x.substr(n,m-n-1);\\n { h$ret1 = (r1); return (m); };\\n }\\n }\\n // end of string\\n { h$ret1 = (x.substr(n)); return (m); };\\n}\",\n \"_parseDataLine(line){\\n line = line.replace(/#/g,1).replace(/\\\\+/g,2).replace(/\\\\s/g,0).split('');\\n return line;\\n }\",\n \"function readBlockString(source, start, line, col, prev, lexer) {\\n var body = source.body;\\n var position = start + 3;\\n var chunkStart = position;\\n var code = 0;\\n var rawValue = '';\\n\\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\\n // Closing Triple-Quote (\\\"\\\"\\\")\\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\\n rawValue += body.slice(chunkStart, position);\\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_1__[\\\"Token\\\"](_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_3__[\\\"TokenKind\\\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString_mjs__WEBPACK_IMPORTED_MODULE_2__[\\\"dedentBlockStringValue\\\"])(rawValue));\\n } // SourceCharacter\\n\\n\\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"syntaxError\\\"])(source, position, \\\"Invalid character within String: \\\".concat(printCharCode(code), \\\".\\\"));\\n }\\n\\n if (code === 10) {\\n // new line\\n ++position;\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if (code === 13) {\\n // carriage return\\n if (body.charCodeAt(position + 1) === 10) {\\n position += 2;\\n } else {\\n ++position;\\n }\\n\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if ( // Escape Triple-Quote (\\\\\\\"\\\"\\\")\\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\\n rawValue += body.slice(chunkStart, position) + '\\\"\\\"\\\"';\\n position += 4;\\n chunkStart = position;\\n } else {\\n ++position;\\n }\\n }\\n\\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"syntaxError\\\"])(source, position, 'Unterminated string.');\\n}\",\n \"function readBlockString(source, start, line, col, prev, lexer) {\\n var body = source.body;\\n var position = start + 3;\\n var chunkStart = position;\\n var code = 0;\\n var rawValue = '';\\n\\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\\n // Closing Triple-Quote (\\\"\\\"\\\")\\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\\n rawValue += body.slice(chunkStart, position);\\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_1__[\\\"Token\\\"](_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_2__[\\\"TokenKind\\\"].BLOCK_STRING, start, position + 3, line, col, prev, Object(_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__[\\\"dedentBlockStringValue\\\"])(rawValue));\\n } // SourceCharacter\\n\\n\\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"syntaxError\\\"])(source, position, \\\"Invalid character within String: \\\".concat(printCharCode(code), \\\".\\\"));\\n }\\n\\n if (code === 10) {\\n // new line\\n ++position;\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if (code === 13) {\\n // carriage return\\n if (body.charCodeAt(position + 1) === 10) {\\n position += 2;\\n } else {\\n ++position;\\n }\\n\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if ( // Escape Triple-Quote (\\\\\\\"\\\"\\\")\\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\\n rawValue += body.slice(chunkStart, position) + '\\\"\\\"\\\"';\\n position += 4;\\n chunkStart = position;\\n } else {\\n ++position;\\n }\\n }\\n\\n throw Object(_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"syntaxError\\\"])(source, position, 'Unterminated string.');\\n}\",\n \"function parseSourceMapInput(str){return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/,''));}\",\n \"function readBlockString(source, start, line, col, prev, lexer) {\\n var body = source.body;\\n var position = start + 3;\\n var chunkStart = position;\\n var code = 0;\\n var rawValue = '';\\n\\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\\n // Closing Triple-Quote (\\\"\\\"\\\")\\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\\n rawValue += body.slice(chunkStart, position);\\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_0__.Token(_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_1__.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0,_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__.dedentBlockStringValue)(rawValue));\\n } // SourceCharacter\\n\\n\\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, \\\"Invalid character within String: \\\".concat(printCharCode(code), \\\".\\\"));\\n }\\n\\n if (code === 10) {\\n // new line\\n ++position;\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if (code === 13) {\\n // carriage return\\n if (body.charCodeAt(position + 1) === 10) {\\n position += 2;\\n } else {\\n ++position;\\n }\\n\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if ( // Escape Triple-Quote (\\\\\\\"\\\"\\\")\\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\\n rawValue += body.slice(chunkStart, position) + '\\\"\\\"\\\"';\\n position += 4;\\n chunkStart = position;\\n } else {\\n ++position;\\n }\\n }\\n\\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, 'Unterminated string.');\\n}\",\n \"function readBlockString(source, start, line, col, prev, lexer) {\\n var body = source.body;\\n var position = start + 3;\\n var chunkStart = position;\\n var code = 0;\\n var rawValue = '';\\n\\n while (position < body.length && !isNaN(code = body.charCodeAt(position))) {\\n // Closing Triple-Quote (\\\"\\\"\\\")\\n if (code === 34 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34) {\\n rawValue += body.slice(chunkStart, position);\\n return new _ast_mjs__WEBPACK_IMPORTED_MODULE_0__.Token(_tokenKind_mjs__WEBPACK_IMPORTED_MODULE_1__.TokenKind.BLOCK_STRING, start, position + 3, line, col, prev, (0,_blockString_mjs__WEBPACK_IMPORTED_MODULE_3__.dedentBlockStringValue)(rawValue));\\n } // SourceCharacter\\n\\n\\n if (code < 0x0020 && code !== 0x0009 && code !== 0x000a && code !== 0x000d) {\\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, \\\"Invalid character within String: \\\".concat(printCharCode(code), \\\".\\\"));\\n }\\n\\n if (code === 10) {\\n // new line\\n ++position;\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if (code === 13) {\\n // carriage return\\n if (body.charCodeAt(position + 1) === 10) {\\n position += 2;\\n } else {\\n ++position;\\n }\\n\\n ++lexer.line;\\n lexer.lineStart = position;\\n } else if ( // Escape Triple-Quote (\\\\\\\"\\\"\\\")\\n code === 92 && body.charCodeAt(position + 1) === 34 && body.charCodeAt(position + 2) === 34 && body.charCodeAt(position + 3) === 34) {\\n rawValue += body.slice(chunkStart, position) + '\\\"\\\"\\\"';\\n position += 4;\\n chunkStart = position;\\n } else {\\n ++position;\\n }\\n }\\n\\n throw (0,_error_syntaxError_mjs__WEBPACK_IMPORTED_MODULE_2__.syntaxError)(source, position, 'Unterminated string.');\\n}\",\n \"function addLineNumbers( string ) {\\n\\n\\tvar lines = string.split( '\\\\n' );\\n\\n\\tfor ( var i = 0; i < lines.length; i ++ ) {\\n\\n\\t\\tlines[ i ] = ( i + 1 ) + ': ' + lines[ i ];\\n\\n\\t}\\n\\n\\treturn lines.join( '\\\\n' );\\n\\n}\",\n \"function ParseLine(j,line,localcontext,SyntaxText)\\n {\\n var IsInSingleLineCommentString = false;\\n var IsInStringLiteral = false;\\n var ReservedWordCharCount = 0;\\n var SavedIsInMultiLineCommentString=localcontext.IsInMultiLineCommentString;\\n \\n for (var i =0; i < line.length; i++)\\n {\\n //---------------------------------------------------------\\n // Find start and end of comments and asm blocks\\n //---------------------------------------------------------\\n \\n if (IsInStringLiteral==false)\\n {\\n // find multi line comment markers\\n if (IsInSingleLineCommentString == false)\\n {\\n // Note there are two types of multi line marker and they need to be matched up\\n if ((localcontext.IsInAltMultiLineCommentString == false)&&(localcontext.IsInASMMultiLineCommentString == false))\\n {\\n if(line[i] == EndOfMultiLineComment)\\n { localcontext.IsInMultiLineCommentString = false; }\\n if (line[i] == StartOfMultiLineComment)\\n { localcontext.IsInMultiLineCommentString = true;}\\n };\\n if (localcontext.IsInAltMultiLineCommentString == true)\\n {\\n if((line[i] == \\\"*\\\")&&(line[i+1] == \\\")\\\"))\\n { localcontext.IsInMultiLineCommentString = false;\\n localcontext.IsInAltMultiLineCommentString = false;\\n }\\n };\\n \\n if (localcontext.IsInASMMultiLineCommentString == true)\\n {\\n if((line[i] == \\\"e\\\")&&(line[i+1] == \\\"n\\\")&&(line[i+2] == \\\"d\\\")&&(line[i+3] == \\\";\\\") )\\n { localcontext.IsInMultiLineCommentString = false;\\n localcontext.IsInASMMultiLineCommentString = false;\\n }\\n };\\n \\n if (localcontext.IsInMultiLineCommentString == false)\\n {\\n if((line[i] == \\\"(\\\")&&(line[i+1] == \\\"*\\\"))\\n { localcontext.IsInMultiLineCommentString = true;\\n localcontext.IsInAltMultiLineCommentString = true;\\n }\\n \\n if((line[i-4] == \\\" \\\")&&(line[i-3] == \\\"a\\\")&&(line[i-2] == \\\"s\\\")&&(line[i-1] == \\\"m\\\")&&(line[i] == \\\" \\\") )\\n { localcontext.IsInMultiLineCommentString = true;\\n localcontext.IsInASMMultiLineCommentString = true;\\n }\\n }\\n }\\n \\n if (localcontext.IsInMultiLineCommentString == false)\\n {\\n // find single line comment marker pair \\\"//\\\"\\n if((line[i] == StartOfSingleLineCommentdelimiter)&&(line[i + 1] == StartOfSingleLineCommentdelimiter))\\n { IsInSingleLineCommentString = true };\\n }\\n }\\n \\n //---------------------------------------------------------\\n // mark the chars with the appropriate colour highlighting\\n //---------------------------------------------------------\\n \\n if ((localcontext.IsInMultiLineCommentString == true)||(IsInSingleLineCommentString == true))\\n { SyntaxText.newgreenline = SyntaxText.newgreenline + line[i] }\\n else { SyntaxText.newgreenline = SyntaxText.newgreenline + \\\" \\\" };\\n \\n if ((localcontext.IsInMultiLineCommentString == false) && (IsInSingleLineCommentString == false)&& (IsInStringLiteral == false)&&(ReservedWordCharCount<1))\\n { SyntaxText.newblackline = SyntaxText.newblackline + line[i] }\\n else { SyntaxText.newblackline = SyntaxText.newblackline + \\\" \\\" };\\n \\n if ((localcontext.IsInMultiLineCommentString == false) && (IsInSingleLineCommentString == false) && (IsInStringLiteral == false)&&(ReservedWordCharCount>0))\\n { SyntaxText.newboldline = SyntaxText.newboldline + line[i]}\\n else { SyntaxText.newboldline = SyntaxText.newboldline + \\\" \\\" };\\n \\n if (IsInStringLiteral == true)\\n { SyntaxText.newblueline = SyntaxText.newblueline + line[i] }\\n else { SyntaxText.newblueline = SyntaxText.newblueline + \\\" \\\" } ;\\n \\n //---------------------------------------------------------\\n // Find strings and reserved words\\n //---------------------------------------------------------\\n \\n if ((localcontext.IsInMultiLineCommentString == false) && (IsInSingleLineCommentString == false))\\n {\\n // find start and end of string\\n if(line[i] == StringDelimiter)\\n {\\n if (IsInStringLiteral == false)\\n {\\n IsInStringLiteral = true;\\n }\\n else { IsInStringLiteral = false };\\n }\\n \\n // find reserved words\\n if (ReservedWordCharCount > 0) { ReservedWordCharCount = ReservedWordCharCount - 1; };\\n var lowercaseline = line.toLowerCase() + \\\" \\\";\\n if ((IsInStringLiteral == false)&& isDelimiter(line[i])\\n && (lowercaseline.charCodeAt(i + 1) > 96) && (lowercaseline.charCodeAt(i + 1) < 123)) // space follwed by a lower case letter\\n {\\n var charindex = lowercaseline.charCodeAt(i + 1) - 96;\\n ReservedWordCharCount = matchReservedWord(lowercaseline, i + 1, charindex);\\n }\\n }\\n }\\n var MultilineChanges = true;\\n if (SavedIsInMultiLineCommentString == localcontext.IsInMultiLineCommentString){MultilineChanges = false};\\n localcontext.MultiLineCommentChangedStatus=MultilineChanges;\\n return MultilineChanges; // true if any of the changes on this line have consequences for the next line(s)\\n }\",\n \"function codeScript(code){\\n\\tvar numberString = code.toString();\\n\\tvar firstNumber = numberString.charAt(0);\\n\\tvar otherNumbers = numberString.slice(1,code.length);\\n\\tvar completeCode = otherNumbers+\\\"\\\"+firstNumber;\\n\\tcoding = completeCode;\\n\\tconsole.log(completeCode);\\n}\",\n \"function parse(stackString) {\\n var lines = stackString.split('\\\\n');\\n return lines.reduce(function (stack, line) {\\n var parseResult = parseChrome(line) || parseWinjs(line) || parseGecko(line) || parseNode(line) || parseJSC(line);\\n\\n if (parseResult) {\\n stack.push(parseResult);\\n }\\n\\n return stack;\\n }, []);\\n }\",\n \"function litToCode(lines, lang) {\\n const retLines = []\\n const markdownIndented = /^([ ]{4}|[ ]{0,3}\\\\t)/\\n let inCode = lines[0] && markdownIndented.exec(lines[0])\\n\\n /** Remembering that a source code line are those without leading \\\" \\\":\\n * add a comment marker at the beginning of each non-code line\\n * Take out the leading \\\" \\\" from every code line\\n **/\\n for (const [i, line] of lines.entries()) {\\n /**\\n Empty lines are a special case:\\n - in code, they must stay blank.\\n - In doc, they myst include the comment marker\\n **/\\n const emptyLine = /^\\\\s*$/.test(line)\\n /* Non-empty lines are added depending on them being code or doc. */\\n if (!emptyLine) {\\n inCode = markdownIndented.exec(line)\\n retLines[i] = inCode\\n ? line.slice(inCode[0].length)\\n : lang.symbol + ' ' + line\\n /* The concept of \\\"empty\\\" changes whether we are in code or not */\\n } else {\\n retLines[i] = inCode ? '' : lang.symbol\\n }\\n }\\n return retLines\\n}\",\n \"function split_linebreaks(s) {\\n\\t //return s.split(/\\\\x0d\\\\x0a|\\\\x0a/);\\n\\t\\n\\t s = s.replace(acorn.allLineBreaks, '\\\\n');\\n\\t var out = [],\\n\\t idx = s.indexOf(\\\"\\\\n\\\");\\n\\t while (idx !== -1) {\\n\\t out.push(s.substring(0, idx));\\n\\t s = s.substring(idx + 1);\\n\\t idx = s.indexOf(\\\"\\\\n\\\");\\n\\t }\\n\\t if (s.length) {\\n\\t out.push(s);\\n\\t }\\n\\t return out;\\n\\t }\",\n \"function parseraw(s) {\\n const m = s.match(/^n(\\\\d+)h(\\\\d+)c(\\\\d+)p(\\\\w+)$/)\\n if (m===null) return [2, 0, 0, 1/2]\\n return [parseInt(m[1]), parseInt(m[2]), parseInt(m[3]), pdec(m[4])]\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, \\\"\\\"));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''))\\n }\",\n \"function $fe91$var$decodeCodePointsArray(codePoints) {\\n var len = codePoints.length;\\n\\n if (len <= $fe91$var$MAX_ARGUMENTS_LENGTH) {\\n return String.fromCharCode.apply(String, codePoints); // avoid extra slice()\\n } // Decode in chunks to avoid \\\"call stack size exceeded\\\".\\n\\n\\n var res = '';\\n var i = 0;\\n\\n while (i < len) {\\n res += String.fromCharCode.apply(String, codePoints.slice(i, i += $fe91$var$MAX_ARGUMENTS_LENGTH));\\n }\\n\\n return res;\\n}\",\n \"static fromString(str) {\\n var strMsg = function(strMsg) { return parseInt(strMsg, 16); }\\n // .{8} => matches any character (except for line terminators)\\n // {8} => Matches exactly 8 times\\n // /g => global. All matches (don't return after first match)\\n var [upper, lower] = str.match(/.{8}/g).map(strMsg);\\n return new jsLong(upper, lower);\\n }\",\n \"function caml_array_of_string (s) {\\n if (s.t != 4 /* ARRAY */) caml_convert_string_to_array(s);\\n return s.c;\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function parseSourceMapInput(str) {\\n return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n}\",\n \"function _decodeStackLine ( str )\\n\\t{\\n\\t\\tvar text, index, name;\\n\\n\\t\\ttext = \\\"\\\";\\n\\n\\t\\tif ( str.search( \\\".js\\\" ) !== -1 )\\t// Code lines\\n\\t\\t{\\n\\t\\t\\tindex = str.lastIndexOf( \\\"/\\\" ) + 1;\\n\\t\\t\\tname = str.substr( index ).replace( /^[\\\\s\\\\(\\\\)]+|[\\\\s\\\\(\\\\)]+$/g, '' );\\n\\n\\t\\t\\t// Remove the column from the line\\n\\n\\t\\t\\tif ( name.split( \\\":\\\" ).length === 3 )\\n\\t\\t\\t{\\n\\t\\t\\t\\tname = name.substr( 0, name.lastIndexOf( \\\":\\\" ) );\\n\\t\\t\\t}\\n\\t\\t\\tif ( name !== \\\"\\\" )\\n\\t\\t\\t{\\n\\t\\t\\t\\ttext += ( \\\" \\\" + name + \\\"\\\\n\\\" );\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn text;\\n\\t}\",\n \"function _decodeStackLine ( str )\\n\\t{\\n\\t\\tvar text, index, name;\\n\\n\\t\\ttext = \\\"\\\";\\n\\n\\t\\tif ( str.search( \\\".js\\\" ) !== -1 )\\t// Code lines\\n\\t\\t{\\n\\t\\t\\tindex = str.lastIndexOf( \\\"/\\\" ) + 1;\\n\\t\\t\\tname = str.substr( index ).replace( /^[\\\\s\\\\(\\\\)]+|[\\\\s\\\\(\\\\)]+$/g, '' );\\n\\n\\t\\t\\t// Remove the column from the line\\n\\n\\t\\t\\tif ( name.split( \\\":\\\" ).length === 3 )\\n\\t\\t\\t{\\n\\t\\t\\t\\tname = name.substr( 0, name.lastIndexOf( \\\":\\\" ) );\\n\\t\\t\\t}\\n\\t\\t\\tif ( name !== \\\"\\\" )\\n\\t\\t\\t{\\n\\t\\t\\t\\ttext += ( \\\" \\\" + name + \\\"\\\\n\\\" );\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn text;\\n\\t}\",\n \"function getCodePointsFromString(str) {\\n return _toConsumableArray(str).map(function (each) {\\n return each.codePointAt(0);\\n });\\n} // Gets the next emoji (from the start of a string)\",\n \"parse() {\\n // Parse line number.\\n this.lineNumber = this.readNumber();\\n if (this.lineNumber === undefined) {\\n return \\\"Missing line number: \\\" + this.line;\\n }\\n this.result.push(z80_base_1.lo(this.lineNumber));\\n this.result.push(z80_base_1.hi(this.lineNumber));\\n // We only trim at the start, so there could be only spaces here, but that's not allowed.\\n if (this.line.substr(this.pos).trim() === \\\"\\\") {\\n return \\\"Empty line \\\" + this.lineNumber;\\n }\\n // Skip single optional whitespace\\n if (this.pos < this.line.length && BasicParser.isWhitespace(this.line.charCodeAt(this.pos))) {\\n this.pos++;\\n }\\n while (this.pos < this.line.length) {\\n let ch = this.line.charCodeAt(this.pos);\\n // Lower case anything outside of strings.\\n if (ch >= 0x61 && ch < 0x61 + 26) {\\n ch -= 0x20;\\n }\\n // Handle single-quote comment.\\n if (ch === SINGLE_QUOTE) {\\n // Single quote is the start of a comment, but it's encoded in a backward-compatible\\n // way with several tokens.\\n this.result.push(COLON, REM, REMQUOT);\\n this.pos++;\\n // We're done, copy the rest of the line.\\n break;\\n }\\n // Handle string.\\n if (ch === DOUBLE_QUOTE) {\\n this.result.push(ch);\\n this.pos++;\\n while (this.pos < this.line.length) {\\n ch = this.line.charCodeAt(this.pos++);\\n this.result.push(ch);\\n if (ch === DOUBLE_QUOTE) {\\n break;\\n }\\n }\\n }\\n else {\\n // See if it should be a token.\\n const token = this.readToken();\\n if (token === undefined) {\\n // Just a regular letter.\\n this.result.push(ch);\\n this.pos++;\\n }\\n else {\\n // Prefix ELSE with colon for backward compatibility.\\n if (token === ELSE && this.result[this.result.length - 1] !== COLON) {\\n this.result.push(COLON);\\n }\\n this.result.push(token);\\n this.pos += TOKENS[token - FIRST_TOKEN].length;\\n if (token === REM) {\\n // We're done, copy the rest of the line.\\n break;\\n }\\n if (token === DATA) {\\n // Copy to end of statement.\\n let inString = false;\\n while (this.pos < this.line.length) {\\n ch = this.line.charCodeAt(this.pos);\\n if (ch === DOUBLE_QUOTE) {\\n inString = !inString;\\n }\\n else if (ch === COLON && !inString) {\\n break;\\n }\\n this.result.push(ch);\\n this.pos++;\\n }\\n }\\n }\\n }\\n }\\n // Copy rest of line (for comments).\\n while (this.pos < this.line.length) {\\n this.result.push(this.line.charCodeAt(this.pos++));\\n }\\n // End-of-line marker.\\n this.result.push(0);\\n return new Uint8Array(this.result);\\n }\",\n \"function split_linebreaks(s) {\\n\\t //return s.split(/\\\\x0d\\\\x0a|\\\\x0a/);\\n\\n\\t s = s.replace(acorn.allLineBreaks, '\\\\n');\\n\\t var out = [],\\n\\t idx = s.indexOf(\\\"\\\\n\\\");\\n\\t while (idx !== -1) {\\n\\t out.push(s.substring(0, idx));\\n\\t s = s.substring(idx + 1);\\n\\t idx = s.indexOf(\\\"\\\\n\\\");\\n\\t }\\n\\t if (s.length) {\\n\\t out.push(s);\\n\\t }\\n\\t return out;\\n\\t }\",\n \"function stringToNumbers(args) {\\n var config = getConfig(args);\\n var numbers = config.input.split(\\\"\\\\n\\\");\\n return splitOnDelimiters(numbers, config.delimiters);\\n}\",\n \"function lisp_parse(string) {\\n lisp_assert(lisp_is_native_string(string));\\n var result = lisp_program_syntax(ps(string));\\n if (result.remaining.index === string.length) {\\n return result.ast;\\n } else {\\n lisp_simple_error(\\\"Parse error at index: \\\" + result.remaining.index);\\n }\\n}\",\n \"function parseSourceMapInput(str) {\\n\\t return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n\\t}\",\n \"function parseSourceMapInput(str) {\\n\\t return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n\\t}\",\n \"function parseSourceMapInput(str) {\\n\\t return JSON.parse(str.replace(/^\\\\)]}'[^\\\\n]*\\\\n/, ''));\\n\\t}\",\n \"function interpret(code, input = [], string_out = undefined) {\\n \\n // Define useful function(s)\\n \\n var to_id = function(char) {\\n return [1, 0, 0, -1][\\\"[.,]\\\".indexOf(char)];\\n };\\n \\n // Validate and format input\\n \\n switch (typeof input) {\\n case \\\"number\\\":\\n input = [BigInt(Math.trunc(input || 0))];\\n break;\\n case \\\"bigint\\\":\\n input = [input];\\n break;\\n case \\\"string\\\":\\n string_out = string_out === undefined ? true : string_out;\\n input = input.split(\\\"\\\").map(c => BigInt(c.codePointAt(0))).reverse();\\n break;\\n case \\\"boolean\\\":\\n input = [input ? 1 : 0];\\n break;\\n default:\\n if (!Array.isArray(input))\\n throw \\\"Invalid input\\\";\\n input = [].concat.apply([], input.map((i, n) => {\\n switch (typeof i) {\\n case \\\"number\\\":\\n return [BigInt(Math.trunc(i || 0))];\\n case \\\"bigint\\\":\\n return [i];\\n case \\\"string\\\":\\n return i.split(\\\"\\\").map(c => BigInt(c.codePointAt(0))).reverse();\\n case \\\"boolean\\\":\\n return [i ? 1 : 0];\\n default:\\n throw \\\"Invalid input: input[\\\" + n + \\\"]\\\";\\n }\\n })).reverse();\\n }\\n \\n // Remove comments and detect unbalanced brackets\\n \\n code = code.replace(/[^[.,\\\\]]+/g, \\\"\\\");\\n \\n {\\n let depth = 0;\\n \\n for (let i = 0; i < code.length; i++) {\\n depth += to_id(code[i]);\\n \\n if (depth < 0)\\n throw \\\"Unbalanced brackets\\\";\\n }\\n \\n if (depth)\\n throw \\\"Unbalanced brackets\\\";\\n }\\n \\n // Ensure code is wrapped in brackets\\n \\n for (let d = 0, i = 0; i < code.length - 1; i++) {\\n d += to_id(code[i]);\\n\\n if (!d) {\\n code = \\\"[\\\" + code + \\\"]\\\";\\n break;\\n }\\n }\\n \\n // Interpret\\n \\n var ptr = 0;\\n var blocks = [];\\n var last = 0n;\\n var loop = [];\\n var queue = [...input];\\n \\n var parent = function() {\\n var result = blocks;\\n var next = result[result.length - 1];\\n \\n while (Array.isArray(next[next.length - 1])) {\\n result = result[result.length - 1];\\n next = next[next.length - 1];\\n }\\n \\n return result;\\n };\\n \\n var block = function() {\\n var result = blocks;\\n \\n while (Array.isArray(result[result.length - 1]))\\n result = result[result.length - 1];\\n \\n return result;\\n };\\n \\n var alternative = function(data) {\\n if (data === undefined || data === null)\\n return -1n;\\n return data;\\n };\\n \\n while (ptr < code.length) {\\n switch (code[ptr]) {\\n case \\\"[\\\":\\n if (code[ptr - 1] == \\\",\\\" && last < 0) {\\n \\n for (let d = 0, i = ptr; i < code.length; i++) {\\n d += to_id(code[i]);\\n if (!d) {\\n ptr = i;\\n break;\\n }\\n }\\n \\n block().push(null);\\n last = 0n;\\n \\n break;\\n }\\n \\n if (code[ptr - 1] == \\\".\\\" && !last) {\\n for (let d = 0, i = ptr; i < code.length; i++) {\\n d += to_id(code[i]);\\n if (!d) {\\n ptr = i;\\n break;\\n }\\n }\\n\\n block().push(null);\\n last = 0n;\\n\\n break;\\n }\\n \\n block().push([]);\\n loop.push(code[ptr - 1] == \\\".\\\");\\n last = 0n;\\n \\n break;\\n case \\\".\\\":\\n if (code[ptr - 1] == \\\"[\\\")\\n last = 1n;\\n if (code[ptr - 1] == \\\"]\\\")\\n last = block().reduce((a, r) => a + (r || 0n), 0n);\\n block().length = 0;\\n break;\\n case \\\",\\\":\\n if (code[ptr - 1] == \\\"[\\\")\\n last = alternative(queue.pop());\\n else if (code[ptr - 1] == \\\"]\\\")\\n last = alternative(block().pop());\\n block.length = 0;\\n if (code[ptr + 1] == \\\"]\\\" && last >= 0)\\n queue.unshift(last);\\n break;\\n case \\\"]\\\":\\n parent().pop();\\n block().push(last);\\n \\n if (loop.pop()) {\\n if (last) {\\n for (let d = 0, i = ptr; i >= 0; i--) {\\n d += to_id(code[i]);\\n if (!d) {\\n ptr = i;\\n break;\\n }\\n }\\n \\n block().push([]);\\n loop.push(true);\\n last = 0n;\\n \\n break;\\n }\\n }\\n \\n last = 0n;\\n \\n break;\\n }\\n \\n ptr += 1;\\n }\\n \\n // Return output, by default formats as string if input was string\\n \\n queue.reverse();\\n \\n try {\\n return string_out ? queue.map(c => String.fromCodePoint(Number(BigInt.asIntN(32, c)))).join(\\\"\\\") : queue;\\n } catch (e) {\\n return queue;\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.58884805","0.581145","0.581145","0.5556285","0.5541743","0.55156434","0.54336584","0.54336584","0.5410302","0.5410302","0.5410302","0.5203161","0.51673627","0.5165204","0.5140153","0.51294726","0.51294726","0.51086026","0.51017606","0.50933874","0.5066978","0.5036833","0.50314856","0.50246876","0.49956045","0.49951205","0.49883798","0.49834746","0.49808908","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49806133","0.49760026","0.49760026","0.49676645","0.4954682","0.49342805","0.4931354","0.49311948","0.49260077","0.49260077","0.49260077","0.49242947"],"string":"[\n \"0.58884805\",\n \"0.581145\",\n \"0.581145\",\n \"0.5556285\",\n \"0.5541743\",\n \"0.55156434\",\n \"0.54336584\",\n \"0.54336584\",\n \"0.5410302\",\n \"0.5410302\",\n \"0.5410302\",\n \"0.5203161\",\n \"0.51673627\",\n \"0.5165204\",\n \"0.5140153\",\n \"0.51294726\",\n \"0.51294726\",\n \"0.51086026\",\n \"0.51017606\",\n \"0.50933874\",\n \"0.5066978\",\n \"0.5036833\",\n \"0.50314856\",\n \"0.50246876\",\n \"0.49956045\",\n \"0.49951205\",\n \"0.49883798\",\n \"0.49834746\",\n \"0.49808908\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49806133\",\n \"0.49760026\",\n \"0.49760026\",\n \"0.49676645\",\n \"0.4954682\",\n \"0.49342805\",\n \"0.4931354\",\n \"0.49311948\",\n \"0.49260077\",\n \"0.49260077\",\n \"0.49260077\",\n \"0.49242947\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5820682"},"document_rank":{"kind":"string","value":"30"}}},{"rowIdx":4683,"cells":{"query":{"kind":"string","value":"Write a Javascript array to somewhere in the heap"},"document":{"kind":"string","value":"function writeStringToMemory(string, buffer, dontAddNull) {\n var array = intArrayFromString(string, dontAddNull);\n var i = 0;\n while (i < array.length) {\n var chr = array[i];\n HEAP8[(((buffer)+(i))>>0)]=chr;\n i = i + 1;\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 write(array, stream) {\n array = array.slice()\n function next() {\n while(array.length)\n if(stream.write(array.shift()) === false)\n return stream.once('drain', next)\n \n stream.end()\n }\n\n next()\n}","writeValue(buffer, value) {\n assert.isBuffer(buffer);\n assert.instanceOf(value, Array);\n write_util_1.writeIterable({ type: this.type, buffer, value, length: value.length });\n }","writeArray(byteList)\n {\n this.liveFunc.writeArray(byteList);\n return YAPI_SUCCESS;\n }","function enlargeMemory() {\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\n\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\n }\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\n var oldHEAP8 = HEAP8;\n var buffer = new ArrayBuffer(TOTAL_MEMORY);\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\n HEAP8.set(oldHEAP8);\n _emscripten_replace_memory(HEAP8, HEAP16, HEAP32, HEAPU8, HEAPU16, HEAPU32, HEAPF32, HEAPF64);\n}","function enlargeMemory() {\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\n\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\n }\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\n var oldHEAP8 = HEAP8;\n var buffer = new ArrayBuffer(TOTAL_MEMORY);\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\n HEAP8.set(oldHEAP8);\n _emscripten_replace_memory(HEAP8, HEAP16, HEAP32, HEAPU8, HEAPU16, HEAPU32, HEAPF32, HEAPF64);\n}","function maxHeapify(arr){\n\n}","function BinaryHeap() {\n this.array = [];\n }","_pushArrayBuffer(gen, obj) {\n return gen._pushTypedArray(gen, new Uint8Array(obj));\n }","_pushArrayBuffer(gen, obj) {\n\t return gen._pushBuffer(gen, Buffer$5.from(obj))\n\t }","function enlargeMemory() {\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\n\n var OLD_TOTAL_MEMORY = TOTAL_MEMORY;\n\n\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\n }\n\n TOTAL_MEMORY = Math.max(TOTAL_MEMORY, 16*1024*1024);\n\n\n\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\n\n\n if (ArrayBuffer.transfer) {\n buffer = ArrayBuffer.transfer(buffer, TOTAL_MEMORY);\n } else {\n var oldHEAP8 = HEAP8;\n buffer = new ArrayBuffer(TOTAL_MEMORY);\n }\n Module['buffer'] = buffer;\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\n if (!ArrayBuffer.transfer) {\n HEAP8.set(oldHEAP8);\n }\n var success = _emscripten_replace_memory(buffer);\n assert(success);\n\n\n}","push(value){\n if(this.length >= this._capacity){\n this._resize((this.length + 1)* MyArray.SIZE_RATIO);\n }\n Memory.set(this.ptr + this.length, value);\n this.length++;\n }","function Heap(){\n this.heap = [];\n}","stringify(){\n // save the data to an array\n let temp = Array.apply(null, {length: this.size});\n let curr = this.startNode;\n for (let i = 0; i < temp.length; i++) {\n temp[i] = curr.myVal;\n curr = curr.myNext;\n }\n\n return JSON.stringify(temp);\n }","function enlargeMemory() {\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\n assert(DYNAMICTOP >= TOTAL_MEMORY);\n assert(TOTAL_MEMORY > 4); // So the loop below will not be infinite\n\n var OLD_TOTAL_MEMORY = TOTAL_MEMORY;\n\n\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\n }\n\n TOTAL_MEMORY = Math.max(TOTAL_MEMORY, 16*1024*1024);\n\n Module.printErr('Warning: Enlarging memory arrays, this is not fast! ' + [OLD_TOTAL_MEMORY, TOTAL_MEMORY]);\n\n\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\n\n var start = Date.now();\n\n if (ArrayBuffer.transfer) {\n buffer = ArrayBuffer.transfer(buffer, TOTAL_MEMORY);\n } else {\n var oldHEAP8 = HEAP8;\n buffer = new ArrayBuffer(TOTAL_MEMORY);\n }\n Module['buffer'] = buffer;\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\n if (!ArrayBuffer.transfer) {\n HEAP8.set(oldHEAP8);\n }\n var success = _emscripten_replace_memory(buffer);\n assert(success);\n\n Module.printErr('enlarged memory arrays from ' + OLD_TOTAL_MEMORY + ' to ' + TOTAL_MEMORY + ', took ' + (Date.now() - start) + ' ms (has ArrayBuffer.transfer? ' + (!!ArrayBuffer.transfer) + ')');\n\n}","writeBack(base, data) {\r\n console.log(\"DEBUG Memory.writeBack(base=\" + base + \", data=...)\")\r\n for(let i = 0; i < data.length; i++) {\r\n let adr = base + i\r\n this.data[adr] = data[i]\r\n\t if(this.observer) {\r\n this.observer.memoryChanged(adr)\r\n\t }\r\n }\r\n }","push(val) {\n this._storage[this._length] = val; \\\n this._length++;\n }","function enlargeMemory() {\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\n assert(DYNAMICTOP >= TOTAL_MEMORY);\n assert(TOTAL_MEMORY > 4); // So the loop below will not be infinite\n\n var OLD_TOTAL_MEMORY = TOTAL_MEMORY;\n\n\n var LIMIT = Math.pow(2, 31); // 2GB is a practical maximum, as we use signed ints as pointers\n // and JS engines seem unhappy to give us 2GB arrays currently\n if (DYNAMICTOP >= LIMIT) return false;\n\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\n if (TOTAL_MEMORY < LIMIT/2) {\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY); // double until 1GB\n } else {\n var last = TOTAL_MEMORY;\n TOTAL_MEMORY = alignMemoryPage((3*TOTAL_MEMORY + LIMIT)/4); // add smaller increments towards 2GB, which we cannot reach\n if (TOTAL_MEMORY <= last) return false;\n }\n }\n\n TOTAL_MEMORY = Math.max(TOTAL_MEMORY, 16*1024*1024);\n\n if (TOTAL_MEMORY >= LIMIT) return false;\n\n Module.printErr('Warning: Enlarging memory arrays, this is not fast! ' + [OLD_TOTAL_MEMORY, TOTAL_MEMORY]);\n\n\n var start = Date.now();\n\n try {\n if (ArrayBuffer.transfer) {\n buffer = ArrayBuffer.transfer(buffer, TOTAL_MEMORY);\n } else {\n var oldHEAP8 = HEAP8;\n buffer = new ArrayBuffer(TOTAL_MEMORY);\n }\n } catch(e) {\n return false;\n }\n\n var success = _emscripten_replace_memory(buffer);\n if (!success) return false;\n\n // everything worked\n\n Module['buffer'] = buffer;\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\n if (!ArrayBuffer.transfer) {\n HEAP8.set(oldHEAP8);\n }\n\n Module.printErr('enlarged memory arrays from ' + OLD_TOTAL_MEMORY + ' to ' + TOTAL_MEMORY + ', took ' + (Date.now() - start) + ' ms (has ArrayBuffer.transfer? ' + (!!ArrayBuffer.transfer) + ')');\n\n return true;\n}","push(value) {\n if (this.length >= this._capacity) {\n this._resize((this.length + 1) * Array.SIZE_RATIO);\n }\n memory.set(this.ptr + this.length, value);\n this.length++;\n }","function augment (arr) {\n arr._isBuffer = true\n\n // save reference to original Uint8Array get/set methods before overwriting\n arr._get = arr.get\n arr._set = arr.set\n\n // deprecated, will be removed in node 0.13+\n arr.get = BP.get\n arr.set = BP.set\n\n arr.write = BP.write\n arr.toString = BP.toString\n arr.toLocaleString = BP.toString\n arr.toJSON = BP.toJSON\n arr.copy = BP.copy\n arr.slice = BP.slice\n arr.readUInt8 = BP.readUInt8\n arr.readUInt16LE = BP.readUInt16LE\n arr.readUInt16BE = BP.readUInt16BE\n arr.readUInt32LE = BP.readUInt32LE\n arr.readUInt32BE = BP.readUInt32BE\n arr.readInt8 = BP.readInt8\n arr.readInt16LE = BP.readInt16LE\n arr.readInt16BE = BP.readInt16BE\n arr.readInt32LE = BP.readInt32LE\n arr.readInt32BE = BP.readInt32BE\n arr.readFloatLE = BP.readFloatLE\n arr.readFloatBE = BP.readFloatBE\n arr.readDoubleLE = BP.readDoubleLE\n arr.readDoubleBE = BP.readDoubleBE\n arr.writeUInt8 = BP.writeUInt8\n arr.writeUInt16LE = BP.writeUInt16LE\n arr.writeUInt16BE = BP.writeUInt16BE\n arr.writeUInt32LE = BP.writeUInt32LE\n arr.writeUInt32BE = BP.writeUInt32BE\n arr.writeInt8 = BP.writeInt8\n arr.writeInt16LE = BP.writeInt16LE\n arr.writeInt16BE = BP.writeInt16BE\n arr.writeInt32LE = BP.writeInt32LE\n arr.writeInt32BE = BP.writeInt32BE\n arr.writeFloatLE = BP.writeFloatLE\n arr.writeFloatBE = BP.writeFloatBE\n arr.writeDoubleLE = BP.writeDoubleLE\n arr.writeDoubleBE = BP.writeDoubleBE\n arr.fill = BP.fill\n arr.inspect = BP.inspect\n arr.toArrayBuffer = BP.toArrayBuffer\n\n return arr\n}","function augment (arr) {\n arr._isBuffer = true\n\n // save reference to original Uint8Array get/set methods before overwriting\n arr._get = arr.get\n arr._set = arr.set\n\n // deprecated, will be removed in node 0.13+\n arr.get = BP.get\n arr.set = BP.set\n\n arr.write = BP.write\n arr.toString = BP.toString\n arr.toLocaleString = BP.toString\n arr.toJSON = BP.toJSON\n arr.copy = BP.copy\n arr.slice = BP.slice\n arr.readUInt8 = BP.readUInt8\n arr.readUInt16LE = BP.readUInt16LE\n arr.readUInt16BE = BP.readUInt16BE\n arr.readUInt32LE = BP.readUInt32LE\n arr.readUInt32BE = BP.readUInt32BE\n arr.readInt8 = BP.readInt8\n arr.readInt16LE = BP.readInt16LE\n arr.readInt16BE = BP.readInt16BE\n arr.readInt32LE = BP.readInt32LE\n arr.readInt32BE = BP.readInt32BE\n arr.readFloatLE = BP.readFloatLE\n arr.readFloatBE = BP.readFloatBE\n arr.readDoubleLE = BP.readDoubleLE\n arr.readDoubleBE = BP.readDoubleBE\n arr.writeUInt8 = BP.writeUInt8\n arr.writeUInt16LE = BP.writeUInt16LE\n arr.writeUInt16BE = BP.writeUInt16BE\n arr.writeUInt32LE = BP.writeUInt32LE\n arr.writeUInt32BE = BP.writeUInt32BE\n arr.writeInt8 = BP.writeInt8\n arr.writeInt16LE = BP.writeInt16LE\n arr.writeInt16BE = BP.writeInt16BE\n arr.writeInt32LE = BP.writeInt32LE\n arr.writeInt32BE = BP.writeInt32BE\n arr.writeFloatLE = BP.writeFloatLE\n arr.writeFloatBE = BP.writeFloatBE\n arr.writeDoubleLE = BP.writeDoubleLE\n arr.writeDoubleBE = BP.writeDoubleBE\n arr.fill = BP.fill\n arr.inspect = BP.inspect\n arr.toArrayBuffer = BP.toArrayBuffer\n\n return arr\n}","function augment (arr) {\n arr._isBuffer = true\n\n // save reference to original Uint8Array get/set methods before overwriting\n arr._get = arr.get\n arr._set = arr.set\n\n // deprecated, will be removed in node 0.13+\n arr.get = BP.get\n arr.set = BP.set\n\n arr.write = BP.write\n arr.toString = BP.toString\n arr.toLocaleString = BP.toString\n arr.toJSON = BP.toJSON\n arr.copy = BP.copy\n arr.slice = BP.slice\n arr.readUInt8 = BP.readUInt8\n arr.readUInt16LE = BP.readUInt16LE\n arr.readUInt16BE = BP.readUInt16BE\n arr.readUInt32LE = BP.readUInt32LE\n arr.readUInt32BE = BP.readUInt32BE\n arr.readInt8 = BP.readInt8\n arr.readInt16LE = BP.readInt16LE\n arr.readInt16BE = BP.readInt16BE\n arr.readInt32LE = BP.readInt32LE\n arr.readInt32BE = BP.readInt32BE\n arr.readFloatLE = BP.readFloatLE\n arr.readFloatBE = BP.readFloatBE\n arr.readDoubleLE = BP.readDoubleLE\n arr.readDoubleBE = BP.readDoubleBE\n arr.writeUInt8 = BP.writeUInt8\n arr.writeUInt16LE = BP.writeUInt16LE\n arr.writeUInt16BE = BP.writeUInt16BE\n arr.writeUInt32LE = BP.writeUInt32LE\n arr.writeUInt32BE = BP.writeUInt32BE\n arr.writeInt8 = BP.writeInt8\n arr.writeInt16LE = BP.writeInt16LE\n arr.writeInt16BE = BP.writeInt16BE\n arr.writeInt32LE = BP.writeInt32LE\n arr.writeInt32BE = BP.writeInt32BE\n arr.writeFloatLE = BP.writeFloatLE\n arr.writeFloatBE = BP.writeFloatBE\n arr.writeDoubleLE = BP.writeDoubleLE\n arr.writeDoubleBE = BP.writeDoubleBE\n arr.fill = BP.fill\n arr.inspect = BP.inspect\n arr.toArrayBuffer = BP.toArrayBuffer\n\n return arr\n}","insert(value) {\n\t\tthis.heap.push(value);\n\t\t// calling heapify function to reconstruct array to heap property\n\t\tthis.heapify();\n\t}","_pushArray(gen, obj, opts) {\n\t opts = {\n\t indefinite: false,\n\t ...opts\n\t };\n\t const len = obj.length;\n\t if (opts.indefinite) {\n\t if (!gen._pushUInt8((MT$1.ARRAY << 5) | NUMBYTES.INDEFINITE)) {\n\t return false\n\t }\n\t } else if (!gen._pushInt(len, MT$1.ARRAY)) {\n\t return false\n\t }\n\t for (let j = 0; j < len; j++) {\n\t if (!gen.pushAny(obj[j])) {\n\t return false\n\t }\n\t }\n\t if (opts.indefinite) {\n\t if (!gen.push(BREAK)) {\n\t return false\n\t }\n\t }\n\t return true\n\t }","_pushArray(gen, obj, opts) {\n opts = {\n indefinite: false,\n ...opts\n };\n const len = obj.length;\n if(opts.indefinite) {\n if(!gen._pushUInt8((MT.ARRAY << 5) | NUMBYTES.INDEFINITE)) {\n return false;\n }\n } else if(!gen._pushInt(len, MT.ARRAY)) {\n return false;\n }\n for(let j = 0; j < len; j++) {\n if(!gen.pushAny(obj[j])) {\n return false;\n }\n }\n if(opts.indefinite) {\n if(!gen.push(BREAK)) {\n return false;\n }\n }\n return true;\n }","push(value) {\n this.storage[this.length] = value;\n this.length++;\n }","_emitArray(arr) {\n for (let i = arr.length - 1; i >= 0; i--) {\n this.emitPush(arr[i]);\n }\n return this.emitPush(arr.length).emit(OpCode.PACK);\n }","buildHeap(array) {\n const firstParentIdx = Math.floor((array.length - 2) / 2);\n for (let currentIdx = firstParentIdx; currentIdx >= 0; currentIdx--) {\n this.siftDown(currentIdx, array.length - 1, array);\n }\n return array;\n }","push(value) {\n if (this.size + 1 > this.elements.length) {\n const newArray = new PlainArray(Math.max(this.size * 2, 3))\n for (let i = 0; i < this.size; i++) {\n newArray.set(i, this.elements.get(i))\n }\n this.elements = newArray\n }\n this.elements.set(this.size, value)\n this.size += 1\n }","arrayToSmartBuf(arr) {\n const w = this.wasm\n const buf = this.arrayToBuf(arr)\n if (buf.ptr) {\n setTimeout(() => {\n w._free(buf.ptr)\n buf.len = 0\n buf.ptr = null\n }, 0)\n }\n return buf\n }","push(value){\r\n this.top += 1;\r\n this.storage[this.top] = value;\r\n }","insert(val) {\n this.array.push(val);\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// push value to end of array (add node to farthest bottom left of tree)\n\n this.siftUp(this.array.length - 1);\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// continuously swap value toward front of array to maintain maxHeap property\n }","push(val) {\n // If the value we want to push is greater or equal to the array's capacity\n if ( this.length >= this._capacity ) {\n // We increase the size of the array to 1 larger than it's length and add our size ratio constant\n this._resize((this.length + 1) + Array.SIZE_RATIO);\n };\n // Set the new value into memory at the end of where the array currently lies in memory\n memory.set(this.ptr + this.length, val);\n // Increase our length property\n this.length++;\n }","function DynamicBytes() {\n\tvar buffer = [];\n\tvar iterator = 0;\n\tvar eod = false;\n\t\n\tvar self = this;\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 4 bytes each\n\tself.Export32Bytes = function() {\n\t\tvar data = Int32Array.from(buffer);\n\t\tvar bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn bytes;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 2 bytes each\n\tself.Export16Bytes = function() {\n\t\tvar data = Int16Array.from(buffer);\n\t\tvar bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn bytes;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 1 byte each\n\tself.Export8Bytes = function() {\n\t\tvar data = Uint8Array.from(buffer);\n\t\t//var bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn data;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Just export the array as is\n\tself.ExportCharArray = function() {\n\t\treturn buffer;\n\t}\n\t//--------------------------------------------------------------------------------\n\t// Export the array in a fully binary, non-human readable form\n\tself.ExportAsBin = function() {\n\t\tvar rtrn = \"\";\n\t\tfor(var i = 0; i < buffer.length; i++) {\n\t\t\trtrn += String.fromCharCode(buffer[i]);\n\t\t\t//rtrn += buffer[i];\n\t\t}\n\t\t\n\t\treturn rtrn;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Import a non-typed array as is\n\tself.appendCharArray = function(array) {\n\t\tbuffer = array;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Import any kind of array, adding to the end of the current array\n\tself.append = function(array) {\n\t\tfor(var i = 0; i < array.length; i++) {\n\t\t\tbuffer[buffer.length] = array[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Add a single value to the end of the array\n\tself.push_back = function(value) {\n\t\tbuffer[buffer.length] = value;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 32-bit number and convert it into 4 bytes, adding to the end\n\t// of the array\n\tself.push_back32 = function(value) {\n\t\tvar data = new Int32Array(1);\n\t\tdata[0] = value;\n\t\tdata = new Int8Array(data.buffer);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 16-bit number and convert it into 2 bytes, adding to the end\n\t// of the array\n\tself.push_back16 = function(value) {\n\t\tvar data = new Int16Array(1);\n\t\tdata[0] = value;\n\t\tdata = new Int8Array(data.buffer);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 8-bit number and convert it into 1 bytes, adding to the end\n\t// of the array\n\tself.push_back8 = function(value) {\n\t\tvar data = new Int8Array(1);\n\t\tdata[0] = value;\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 4 bytes or values in the array and convert them into\n\t// a single digit.\n\tself.get32 = function() {\n\t\tvar data = new Int8Array(4);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int32Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 2 bytes or values in the array and convert them into\n\t// a single digit.\n\tself.get16 = function() {\n\t\tvar data = new Int8Array(2);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int16Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 1 byte or value in the array and convert them into\n\t// a single digit.\n\tself.get8 = function() {\n\t\tvar data = new Int8Array(1);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int8Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Grab the next X amount of bytes in the array and return it as a single array\n\tself.getUBytes = function(amount) {\n\t\tvar data = new Uint8Array(amount);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn data;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Clear the array\n\tself.clear = function() {\n\t\tbuffer = [];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Return the length of the array\n\tself.length = function() {\n\t\treturn buffer.length;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Return the iterator to the beginning\n\tself.rewind = function() {\n\t\titerator = 0;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Returns true if the iterator has reached the End of Data.\n\tself.eod = function() {\n\t\treturn eod;\n\t}\n}","function callee(array) {\n array.push('stuff');\n}","function writeData() {\n Office.context.document.setSelectedDataAsync(MyArray, {coercionType: 'matrix'});\n}","function arraypush(thearray,value) {\r\n\tthearray[ getarraysize(thearray) ] = value;\r\n}","function jsNewArray() {\n var arr = [];\n return arr;\n}","function push(arr) {\n var args = [];\n for (var _i = 1; _i < arguments.length; _i++) {\n args[_i - 1] = arguments[_i];\n }\n arr = arr.concat(flatten.apply(void 0, args));\n return {\n array: arr,\n val: arr.length\n };\n}","push(value) {\n if(this.length >= this._capacity) {\n this._resize((this.length + 1) * this.ARRAY_SIZE_RATIO)\n }\n memory.set(this.ptr + this.length, value)\n this.length++\n }","write(data) {\n this.buffer.push(data)\n }","function refArray(arr) {\n arr.push(6);\n console.log('List = ' + JSON.stringify(arr));\n arr = [];\n console.log('List = ' + JSON.stringify(arr));\n}","insert(value) {\n // Insert value to the end of array\n // Perform siftUp to correct position of value in the heap tree\n this.heap.push(value);\n this.siftUp(this.heap.length - 1, this.heap);\n }","function writeToMem(dat, at, size) {\n\tif(size > 32) {\n\t\talert(\"Too large\");\n\t\treturn;\n\t}\n\n\tvar bdata = extend((dat >>> 0).toString(2), 32).slice(-size);\n\tfor(var i = at, j = 0 ; j < size ; i++, j++) {\n\t\tmem[i] = Number(bdata[j]);\n\t\tmem.changed[i] = true;\n\t}\n\n\tinstateMemory(mem.currBitView);\t\t\t\t//reinstate changed memory\n}","function writemyfile(thearray){\n\n fs.writeFile('chicagocrimes.json',JSON.stringify(thearray),(err) => {\n\n if (err) throw err;\n\n });\n}","static writeObject(obj) {\n return [];\n }","function setLocalStorageArray(index,array){\n var string = JSON.stringify(array);\n localStorage.setItem(index,string);\n }","function update_array()\n{\n array_size=inp_as.value;\n generate_array();\n}","function _putArrayToIndexedDB(array, callback) {\n var x = 0;\n if(array.length == 0) {\n callback();\n return;\n }\n function loopArray(array) {\n _putToIndexedDB(array[x],function(){\n x++;\n if(x < array.length) { loopArray(array); }\n else { callback(); }\n });\n };\n loopArray(array);\n }","_pushTypedArray(gen, obj) {\n\t // see https://tools.ietf.org/html/rfc8746\n\n\t let typ = 0b01000000;\n\t let sz = obj.BYTES_PER_ELEMENT;\n\t const {name} = obj.constructor;\n\n\t if (name.startsWith('Float')) {\n\t typ |= 0b00010000;\n\t sz /= 2;\n\t } else if (!name.includes('U')) {\n\t typ |= 0b00001000;\n\t }\n\t if (name.includes('Clamped') || ((sz !== 1) && !utils$q.isBigEndian())) {\n\t typ |= 0b00000100;\n\t }\n\t typ |= {\n\t 1: 0b00,\n\t 2: 0b01,\n\t 4: 0b10,\n\t 8: 0b11\n\t }[sz];\n\t if (!gen._pushTag(typ)) {\n\t return false\n\t }\n\t return gen._pushBuffer(\n\t gen,\n\t Buffer$5.from(obj.buffer, obj.byteOffset, obj.byteLength)\n\t )\n\t }","static heapInMemory() {\n return this.inMemory(function () {\n return new Heap();\n }, (heap) => {\n return heap.array;\n }, (array) => {\n return new Heap(array);\n });\n }","function saveArray(key, value) {\n localStorage.setItem(key, JSON.stringify(value));\n}","constructor() {\n\t\tthis.heap = [];\n\t}","_pushBuffer(gen, obj) {\n return gen._pushTypedArray(gen, obj);\n }","function Array() {}","function heapify(arr) {\n if (arr.length < 1) return arr\n for (let i = arr.length - 1; i >= 0; i--) {\n minHeapify(arr, i)\n }\n return arr\n}","function cPush() {\r\n if (cStep < cPushArray.length) \r\n cPushArray.length = cStep;\r\n cStep++;\r\n cPushArray.push(document.getElementById('canvas-real').toDataURL());\r\n}","function setArray(array){\r\n localStorage.setItem('list', JSON.stringify(array));\r\n}","function _gc() {\n\tfor (var i=0; i<0x100; i++) {\n\t\tnew Uint32Array(0x400*0x400);\n\t}\n}","push(value) {\n //if the length is greater than the capacity currently then resize\n if (this.length >= this._capacity) {\n this._resize((this.length + 1) * Array.SIZE_RATIO);\n }\n //otherwise, set the new array length and the values\n newMem.set(this.ptr + this.length, value);\n //increase the length counter\n this.length++;\n }","function writeData() {\n console.log(JSON.stringify(allButtonData));\n buttonData = [];\n allButtonData = []; \n}","function testArrayPush(arr) {\n arr.push(100);\n console.log(arr);\n}","_pushTypedArray(gen, obj) {\n if(obj instanceof Uint8Array) {\n // treat Uint8Array as a simple byte string\n return gen._pushByteString(\n gen, new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength));\n }\n\n // see https://tools.ietf.org/html/rfc8746\n\n let typ = 0b01000000;\n let sz = obj.BYTES_PER_ELEMENT;\n const {name} = obj.constructor;\n\n if(name.startsWith('Float')) {\n typ |= 0b00010000;\n sz /= 2;\n } else if(!name.includes('U')) {\n typ |= 0b00001000;\n }\n if(name.includes('Clamped') || ((sz !== 1) && !util.isBigEndian())) {\n typ |= 0b00000100;\n }\n typ |= {\n 1: 0b00,\n 2: 0b01,\n 4: 0b10,\n 8: 0b11\n }[sz];\n if(!gen._pushTag(typ)) {\n return false;\n }\n return gen._pushByteString(\n gen, new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength));\n }","push(value) {\n this.array.push(value);\n }","push(value) {\n this.array.push(value);\n }","pushStrArray(strArray) {\n // this.pushInt(strArray.length) // array size\n // let dst = 0\n // let view = new Uint8Array(this.buff, this.offset)\n // for (let i = 0; i < strArray.length; ++i) {\n // let str = strArray[i]\n // let ec = new TextEncoder().encode(str)\n // for (let i = 0; i < ec.length; ++i) {\n // view[dst++] = ec[i]\n // }\n // view[dst++] = 0\n // }\n // this.offset += dst\n\n if (!this.dv) return\n this.pushInt(strArray.length) // array size\n for (let i = 0; i < strArray.length; ++i) {\n const str = strArray[i]\n let ec = new TextEncoder().encode(str)\n for (let k = 0; (k < ec.length) && (this.offset < this.byteLength); ++k) {\n this.dv.setUint8(this.offset++, ec[k])\n }\n if (this.offset < this.byteLength)\n this.dv.setUint8(this.offset++, 0)\n } \n }","add(val) {\n this.buffer.push(val);\n this.buffer = this.buffer.slice(-this.size);\n }","function push(element){\n\tthis.dataStore[this.top++] = element;\n}","function setArray(key, array) {\n localStorage.setItem(key, JSON.stringify(array));\n}","function maintahu(){\n Array.SIZE_RATIO = 3;\n let arr = new Array();\n arr.push(\"tahuina\");\n console.log(arr);\n console.log(arr.get(0));\n}","function createLocalHistory(array, storage){\n\tfor (var i = 0; i < array.length; i++)\n\t\tstorage.setItem(array[i],\"0\");\n}","set_data(data) {\n this.wasmInstance.exports.opa_heap_ptr_set(this.baseHeapPtr);\n this.wasmInstance.exports.opa_heap_top_set(this.baseHeapTop);\n this.dataAddr = _loadJSON(this.wasmInstance, this.mem, data);\n this.dataHeapPtr = this.wasmInstance.exports.opa_heap_ptr_get();\n this.dataHeapTop = this.wasmInstance.exports.opa_heap_top_get();\n }","function AddToArray(array, data, maxLenght)\n{\n\n array.push(data);\n\n if(array.length > maxLenght)\n {\n for(var i = 1; i < array.length - 1; i++)\n {\n for(var j = 0; j < array[i].length; j++)\n {\n array[i][j] = array[i + 1][j]\n }\n }\n array.pop()\n }\n}","function push_(item,a){// Handle resursion stop at leaf level.\nif(a.height===0){if(a.table.length<M){var newA={ctor:'_Array',height:0,table:a.table.slice()};newA.table.push(item);return newA;}else{return null;}}// Recursively push\nvar pushed=push_(item,botRight(a));// There was space in the bottom right tree, so the slot will\n// be updated.\nif(pushed!==null){var newA=nodeCopy(a);newA.table[newA.table.length-1]=pushed;newA.lengths[newA.lengths.length-1]++;return newA;}// When there was no space left, check if there is space left\n// for a new slot with a tree which contains only the item\n// at the bottom.\nif(a.table.length<M){var newSlot=create(item,a.height-1);var newA=nodeCopy(a);newA.table.push(newSlot);newA.lengths.push(newA.lengths[newA.lengths.length-1]+length(newSlot));return newA;}else{return null;}}// Converts an array into a list of elements.","insert(node) {\n this.data.set(node, new Array())\n }","function writeStringToMemory(string, buffer, dontAddNull) {\n var array = intArrayFromString(string, dontAddNull);\n var i = 0;\n while (i < array.length) {\n var chr = array[i];\n HEAP8[((buffer)+(i))]=chr\n i = i + 1;\n }\n}","function writeStringToMemory(string, buffer, dontAddNull) {\n var array = intArrayFromString(string, dontAddNull);\n var i = 0;\n while (i < array.length) {\n var chr = array[i];\n HEAP8[((buffer)+(i))]=chr\n i = i + 1;\n }\n}","function writeStringToMemory(string, buffer, dontAddNull) {\n var array = intArrayFromString(string, dontAddNull);\n var i = 0;\n while (i < array.length) {\n var chr = array[i];\n HEAP8[((buffer)+(i))]=chr\n i = i + 1;\n }\n}","function writeBlock(bufferArray) {\r\n const cb = FFI.Callback('int', [FPDF_FILEWRITE_ptr, voidPtr, 'int'], \r\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\r\n (fpdfFilewritePtr, dataPtr, size) => {\r\n const buff = Ref.reinterpret(dataPtr, size, 0);\r\n bufferArray.push(Buffer.from(buff));\r\n return size;\r\n });\r\n return cb;\r\n}","function writeToLocalStorage() {\n //clear data array\n data = [];\n //push tempData string into the array\n data.push(`${tempData.innerHTML}`);\n //update the local storage\n updateLocalStorage();\n}","function memoryPush(process, value) {\n process.registers.rsp -= 8n;\n writeMemoryBytes(process, process.registers.rsp, value, 8);\n}","function heapslot_to_objectelements(Addr) {\n // static ObjectElements* fromElements(HeapSlot* elems) {\n // return reinterpret_cast<ObjectElements*>(uintptr_t(elems) - sizeof(ObjectElements));\n // }\n const ObjectElementsSize = host.getModuleType(Module, 'js::ObjectElements').size;\n const ObjectElements = host.createPointerObject(\n Addr.subtract(ObjectElementsSize),\n Module,\n 'js::ObjectElements*'\n );\n\n return ObjectElements;\n}","function writeUint8Array(array, callback) {\n\n upload_state.encrypted += array.length;\n\n if (array.length > 0)\n {\n // logic to make dataqueue items UPLOAD_SIZE long\n var n = dataqueue.length-1;\n if (n<0 || dataqueue[n].length === UPLOAD_SIZE)\n {\n dataqueue.push(array); // start new block\n }\n else if (dataqueue[n].length + array.length <= UPLOAD_SIZE)\n {\n // append too block\n var q = dataqueue[n];\n dataqueue[n] = new Uint8Array(dataqueue[n].length + array.length);\n dataqueue[n].set(q,0);\n dataqueue[n].set(array, q.length);\n }\n else\n {\n // append + start new\n var needed_bytes = UPLOAD_SIZE - dataqueue[n].length;\n var q = dataqueue[n];\n var new1 = array.slice(0, needed_bytes);\n var new2 = array.slice(needed_bytes);\n dataqueue[n] = new Uint8Array(UPLOAD_SIZE);\n dataqueue[n].set(q,0);\n dataqueue[n].set(new1,q.length);\n dataqueue.push(new2);\n }\n trigger_upload();\n }\n\n // we only callback when we're not too busy\n // otherwise we wait to prevent too much mem usage\n function trycallback()\n {\n if (dataqueue.length > MAX_QUEUE_LEN)\n window.setTimeout(trycallback, 2000);\n else\n callback();\n }\n trycallback();\n }","push (element) {\n this.dataStore[this.top++] = element\n }","function executeWithArrLength()\n{\n arr.length=0; //Empty the array\n for (var i = 0; i < 15000000; i++) { //repopulate the array\n arr[i]=Math.random();\n }\n}","function enlargeMemory() {\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\n}","function enlargeMemory() {\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\n}","function enlargeMemory() {\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\n}","function enlargeMemory() {\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\n}","push(item) {\r\n this.array[this.array.length] = item;\r\n }","_addDimensionToJSArray(dimensions) {\n const that = this;\n\n if (that.arrayIndexingMode === 'LabVIEW') {\n that.value = [that.value];\n }\n else {\n if (dimensions === undefined) {\n dimensions = that.dimensions - 1;\n }\n\n const recursion = function (arr, level) {\n for (let i = 0; i < arr.length; i++) {\n if (level !== dimensions) {\n recursion(arr[i], level + 1);\n }\n else {\n arr[i] = [arr[i]];\n }\n }\n };\n\n recursion(that.value, 1);\n }\n }","function push(arr, newItem){\n[arr.length] = newItem;\n console.log(arr)\n}","function MjArray() {\n}","insert(data) {\r\n\t\tconst size = this.heap.length;\r\n\r\n\t\tif (size === 0) {\r\n\t\t\tthis.heap.push(data);\r\n\t\t} else {\r\n\t\t\tthis.heap.push(data);\r\n\r\n\t\t\tfor (let i = parseInt(this.heap.length / 2 - 1); i >= 0; i--) {\r\n\t\t\t\tthis.maxHeapify(this.heap, this.heap.length, i);\r\n\t\t\t}\r\n\t\t}\r\n\t}","function writeUint32Array(nums, array, offset) {\n offset = offset || 0;\n\n for (var i = 0; i < nums.length; i++) {\n for (var j = 0; j < 4; j++) {\n array[i * 4 + j + offset] = (nums[i] >>> (8 * j)) & 0xFF;\n }\n }\n}","function push(element) {\n this.dataStore[this.top++] = element;\n}","function push(element) {\n this.dataStore[this.top++] = element;\n}","constructor(){\n this.heap = [];\n this.count = 0;\n }","constructor(){\n this.heap = [];\n this.count = 0;\n }","function backup(queueArray) {\n\tfs.writeFile('./db.json', JSON.stringify({queue: queueArray}));\n}","function heapSortInPlace(array){\n for(let i = 1; i < array.length; i++){\n MaxHeap.heapifyUp(array, i);\n }\n\n let temp;\n for(let j = array.length - 1; 0 < j; j--){\n temp = array[0];\n array[0] = array[j];\n array[j] = temp;\n\n // j is the length of array\n MaxHeap.heapifyDown(array, 0, j);\n }\n\n return array;\n}","read_array() {\n // Get array size.\n let size = this.read_varint32();\n\n // Allocate array.\n let array = new Array(size);\n this.refs.push(array);\n\n // Read array elements.\n for (let i = 0; i < size; ++i) {\n array[i] = this.read();\n }\n\n return array;\n }"],"string":"[\n \"function write(array, stream) {\\n array = array.slice()\\n function next() {\\n while(array.length)\\n if(stream.write(array.shift()) === false)\\n return stream.once('drain', next)\\n \\n stream.end()\\n }\\n\\n next()\\n}\",\n \"writeValue(buffer, value) {\\n assert.isBuffer(buffer);\\n assert.instanceOf(value, Array);\\n write_util_1.writeIterable({ type: this.type, buffer, value, length: value.length });\\n }\",\n \"writeArray(byteList)\\n {\\n this.liveFunc.writeArray(byteList);\\n return YAPI_SUCCESS;\\n }\",\n \"function enlargeMemory() {\\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\\n\\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\\n }\\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\\n var oldHEAP8 = HEAP8;\\n var buffer = new ArrayBuffer(TOTAL_MEMORY);\\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\\n HEAP8.set(oldHEAP8);\\n _emscripten_replace_memory(HEAP8, HEAP16, HEAP32, HEAPU8, HEAPU16, HEAPU32, HEAPF32, HEAPF64);\\n}\",\n \"function enlargeMemory() {\\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\\n\\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\\n }\\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\\n var oldHEAP8 = HEAP8;\\n var buffer = new ArrayBuffer(TOTAL_MEMORY);\\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\\n HEAP8.set(oldHEAP8);\\n _emscripten_replace_memory(HEAP8, HEAP16, HEAP32, HEAPU8, HEAPU16, HEAPU32, HEAPF32, HEAPF64);\\n}\",\n \"function maxHeapify(arr){\\n\\n}\",\n \"function BinaryHeap() {\\n this.array = [];\\n }\",\n \"_pushArrayBuffer(gen, obj) {\\n return gen._pushTypedArray(gen, new Uint8Array(obj));\\n }\",\n \"_pushArrayBuffer(gen, obj) {\\n\\t return gen._pushBuffer(gen, Buffer$5.from(obj))\\n\\t }\",\n \"function enlargeMemory() {\\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\\n\\n var OLD_TOTAL_MEMORY = TOTAL_MEMORY;\\n\\n\\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\\n }\\n\\n TOTAL_MEMORY = Math.max(TOTAL_MEMORY, 16*1024*1024);\\n\\n\\n\\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\\n\\n\\n if (ArrayBuffer.transfer) {\\n buffer = ArrayBuffer.transfer(buffer, TOTAL_MEMORY);\\n } else {\\n var oldHEAP8 = HEAP8;\\n buffer = new ArrayBuffer(TOTAL_MEMORY);\\n }\\n Module['buffer'] = buffer;\\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\\n if (!ArrayBuffer.transfer) {\\n HEAP8.set(oldHEAP8);\\n }\\n var success = _emscripten_replace_memory(buffer);\\n assert(success);\\n\\n\\n}\",\n \"push(value){\\n if(this.length >= this._capacity){\\n this._resize((this.length + 1)* MyArray.SIZE_RATIO);\\n }\\n Memory.set(this.ptr + this.length, value);\\n this.length++;\\n }\",\n \"function Heap(){\\n this.heap = [];\\n}\",\n \"stringify(){\\n // save the data to an array\\n let temp = Array.apply(null, {length: this.size});\\n let curr = this.startNode;\\n for (let i = 0; i < temp.length; i++) {\\n temp[i] = curr.myVal;\\n curr = curr.myNext;\\n }\\n\\n return JSON.stringify(temp);\\n }\",\n \"function enlargeMemory() {\\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\\n assert(DYNAMICTOP >= TOTAL_MEMORY);\\n assert(TOTAL_MEMORY > 4); // So the loop below will not be infinite\\n\\n var OLD_TOTAL_MEMORY = TOTAL_MEMORY;\\n\\n\\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY);\\n }\\n\\n TOTAL_MEMORY = Math.max(TOTAL_MEMORY, 16*1024*1024);\\n\\n Module.printErr('Warning: Enlarging memory arrays, this is not fast! ' + [OLD_TOTAL_MEMORY, TOTAL_MEMORY]);\\n\\n\\n assert(TOTAL_MEMORY <= Math.pow(2, 30)); // 2^30==1GB is a practical maximum - 2^31 is already close to possible negative numbers etc.\\n\\n var start = Date.now();\\n\\n if (ArrayBuffer.transfer) {\\n buffer = ArrayBuffer.transfer(buffer, TOTAL_MEMORY);\\n } else {\\n var oldHEAP8 = HEAP8;\\n buffer = new ArrayBuffer(TOTAL_MEMORY);\\n }\\n Module['buffer'] = buffer;\\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\\n if (!ArrayBuffer.transfer) {\\n HEAP8.set(oldHEAP8);\\n }\\n var success = _emscripten_replace_memory(buffer);\\n assert(success);\\n\\n Module.printErr('enlarged memory arrays from ' + OLD_TOTAL_MEMORY + ' to ' + TOTAL_MEMORY + ', took ' + (Date.now() - start) + ' ms (has ArrayBuffer.transfer? ' + (!!ArrayBuffer.transfer) + ')');\\n\\n}\",\n \"writeBack(base, data) {\\r\\n console.log(\\\"DEBUG Memory.writeBack(base=\\\" + base + \\\", data=...)\\\")\\r\\n for(let i = 0; i < data.length; i++) {\\r\\n let adr = base + i\\r\\n this.data[adr] = data[i]\\r\\n\\t if(this.observer) {\\r\\n this.observer.memoryChanged(adr)\\r\\n\\t }\\r\\n }\\r\\n }\",\n \"push(val) {\\n this._storage[this._length] = val; \\\\\\n this._length++;\\n }\",\n \"function enlargeMemory() {\\n // TOTAL_MEMORY is the current size of the actual array, and DYNAMICTOP is the new top.\\n assert(DYNAMICTOP >= TOTAL_MEMORY);\\n assert(TOTAL_MEMORY > 4); // So the loop below will not be infinite\\n\\n var OLD_TOTAL_MEMORY = TOTAL_MEMORY;\\n\\n\\n var LIMIT = Math.pow(2, 31); // 2GB is a practical maximum, as we use signed ints as pointers\\n // and JS engines seem unhappy to give us 2GB arrays currently\\n if (DYNAMICTOP >= LIMIT) return false;\\n\\n while (TOTAL_MEMORY <= DYNAMICTOP) { // Simple heuristic.\\n if (TOTAL_MEMORY < LIMIT/2) {\\n TOTAL_MEMORY = alignMemoryPage(2*TOTAL_MEMORY); // double until 1GB\\n } else {\\n var last = TOTAL_MEMORY;\\n TOTAL_MEMORY = alignMemoryPage((3*TOTAL_MEMORY + LIMIT)/4); // add smaller increments towards 2GB, which we cannot reach\\n if (TOTAL_MEMORY <= last) return false;\\n }\\n }\\n\\n TOTAL_MEMORY = Math.max(TOTAL_MEMORY, 16*1024*1024);\\n\\n if (TOTAL_MEMORY >= LIMIT) return false;\\n\\n Module.printErr('Warning: Enlarging memory arrays, this is not fast! ' + [OLD_TOTAL_MEMORY, TOTAL_MEMORY]);\\n\\n\\n var start = Date.now();\\n\\n try {\\n if (ArrayBuffer.transfer) {\\n buffer = ArrayBuffer.transfer(buffer, TOTAL_MEMORY);\\n } else {\\n var oldHEAP8 = HEAP8;\\n buffer = new ArrayBuffer(TOTAL_MEMORY);\\n }\\n } catch(e) {\\n return false;\\n }\\n\\n var success = _emscripten_replace_memory(buffer);\\n if (!success) return false;\\n\\n // everything worked\\n\\n Module['buffer'] = buffer;\\n Module['HEAP8'] = HEAP8 = new Int8Array(buffer);\\n Module['HEAP16'] = HEAP16 = new Int16Array(buffer);\\n Module['HEAP32'] = HEAP32 = new Int32Array(buffer);\\n Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);\\n Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);\\n Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);\\n Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);\\n Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);\\n if (!ArrayBuffer.transfer) {\\n HEAP8.set(oldHEAP8);\\n }\\n\\n Module.printErr('enlarged memory arrays from ' + OLD_TOTAL_MEMORY + ' to ' + TOTAL_MEMORY + ', took ' + (Date.now() - start) + ' ms (has ArrayBuffer.transfer? ' + (!!ArrayBuffer.transfer) + ')');\\n\\n return true;\\n}\",\n \"push(value) {\\n if (this.length >= this._capacity) {\\n this._resize((this.length + 1) * Array.SIZE_RATIO);\\n }\\n memory.set(this.ptr + this.length, value);\\n this.length++;\\n }\",\n \"function augment (arr) {\\n arr._isBuffer = true\\n\\n // save reference to original Uint8Array get/set methods before overwriting\\n arr._get = arr.get\\n arr._set = arr.set\\n\\n // deprecated, will be removed in node 0.13+\\n arr.get = BP.get\\n arr.set = BP.set\\n\\n arr.write = BP.write\\n arr.toString = BP.toString\\n arr.toLocaleString = BP.toString\\n arr.toJSON = BP.toJSON\\n arr.copy = BP.copy\\n arr.slice = BP.slice\\n arr.readUInt8 = BP.readUInt8\\n arr.readUInt16LE = BP.readUInt16LE\\n arr.readUInt16BE = BP.readUInt16BE\\n arr.readUInt32LE = BP.readUInt32LE\\n arr.readUInt32BE = BP.readUInt32BE\\n arr.readInt8 = BP.readInt8\\n arr.readInt16LE = BP.readInt16LE\\n arr.readInt16BE = BP.readInt16BE\\n arr.readInt32LE = BP.readInt32LE\\n arr.readInt32BE = BP.readInt32BE\\n arr.readFloatLE = BP.readFloatLE\\n arr.readFloatBE = BP.readFloatBE\\n arr.readDoubleLE = BP.readDoubleLE\\n arr.readDoubleBE = BP.readDoubleBE\\n arr.writeUInt8 = BP.writeUInt8\\n arr.writeUInt16LE = BP.writeUInt16LE\\n arr.writeUInt16BE = BP.writeUInt16BE\\n arr.writeUInt32LE = BP.writeUInt32LE\\n arr.writeUInt32BE = BP.writeUInt32BE\\n arr.writeInt8 = BP.writeInt8\\n arr.writeInt16LE = BP.writeInt16LE\\n arr.writeInt16BE = BP.writeInt16BE\\n arr.writeInt32LE = BP.writeInt32LE\\n arr.writeInt32BE = BP.writeInt32BE\\n arr.writeFloatLE = BP.writeFloatLE\\n arr.writeFloatBE = BP.writeFloatBE\\n arr.writeDoubleLE = BP.writeDoubleLE\\n arr.writeDoubleBE = BP.writeDoubleBE\\n arr.fill = BP.fill\\n arr.inspect = BP.inspect\\n arr.toArrayBuffer = BP.toArrayBuffer\\n\\n return arr\\n}\",\n \"function augment (arr) {\\n arr._isBuffer = true\\n\\n // save reference to original Uint8Array get/set methods before overwriting\\n arr._get = arr.get\\n arr._set = arr.set\\n\\n // deprecated, will be removed in node 0.13+\\n arr.get = BP.get\\n arr.set = BP.set\\n\\n arr.write = BP.write\\n arr.toString = BP.toString\\n arr.toLocaleString = BP.toString\\n arr.toJSON = BP.toJSON\\n arr.copy = BP.copy\\n arr.slice = BP.slice\\n arr.readUInt8 = BP.readUInt8\\n arr.readUInt16LE = BP.readUInt16LE\\n arr.readUInt16BE = BP.readUInt16BE\\n arr.readUInt32LE = BP.readUInt32LE\\n arr.readUInt32BE = BP.readUInt32BE\\n arr.readInt8 = BP.readInt8\\n arr.readInt16LE = BP.readInt16LE\\n arr.readInt16BE = BP.readInt16BE\\n arr.readInt32LE = BP.readInt32LE\\n arr.readInt32BE = BP.readInt32BE\\n arr.readFloatLE = BP.readFloatLE\\n arr.readFloatBE = BP.readFloatBE\\n arr.readDoubleLE = BP.readDoubleLE\\n arr.readDoubleBE = BP.readDoubleBE\\n arr.writeUInt8 = BP.writeUInt8\\n arr.writeUInt16LE = BP.writeUInt16LE\\n arr.writeUInt16BE = BP.writeUInt16BE\\n arr.writeUInt32LE = BP.writeUInt32LE\\n arr.writeUInt32BE = BP.writeUInt32BE\\n arr.writeInt8 = BP.writeInt8\\n arr.writeInt16LE = BP.writeInt16LE\\n arr.writeInt16BE = BP.writeInt16BE\\n arr.writeInt32LE = BP.writeInt32LE\\n arr.writeInt32BE = BP.writeInt32BE\\n arr.writeFloatLE = BP.writeFloatLE\\n arr.writeFloatBE = BP.writeFloatBE\\n arr.writeDoubleLE = BP.writeDoubleLE\\n arr.writeDoubleBE = BP.writeDoubleBE\\n arr.fill = BP.fill\\n arr.inspect = BP.inspect\\n arr.toArrayBuffer = BP.toArrayBuffer\\n\\n return arr\\n}\",\n \"function augment (arr) {\\n arr._isBuffer = true\\n\\n // save reference to original Uint8Array get/set methods before overwriting\\n arr._get = arr.get\\n arr._set = arr.set\\n\\n // deprecated, will be removed in node 0.13+\\n arr.get = BP.get\\n arr.set = BP.set\\n\\n arr.write = BP.write\\n arr.toString = BP.toString\\n arr.toLocaleString = BP.toString\\n arr.toJSON = BP.toJSON\\n arr.copy = BP.copy\\n arr.slice = BP.slice\\n arr.readUInt8 = BP.readUInt8\\n arr.readUInt16LE = BP.readUInt16LE\\n arr.readUInt16BE = BP.readUInt16BE\\n arr.readUInt32LE = BP.readUInt32LE\\n arr.readUInt32BE = BP.readUInt32BE\\n arr.readInt8 = BP.readInt8\\n arr.readInt16LE = BP.readInt16LE\\n arr.readInt16BE = BP.readInt16BE\\n arr.readInt32LE = BP.readInt32LE\\n arr.readInt32BE = BP.readInt32BE\\n arr.readFloatLE = BP.readFloatLE\\n arr.readFloatBE = BP.readFloatBE\\n arr.readDoubleLE = BP.readDoubleLE\\n arr.readDoubleBE = BP.readDoubleBE\\n arr.writeUInt8 = BP.writeUInt8\\n arr.writeUInt16LE = BP.writeUInt16LE\\n arr.writeUInt16BE = BP.writeUInt16BE\\n arr.writeUInt32LE = BP.writeUInt32LE\\n arr.writeUInt32BE = BP.writeUInt32BE\\n arr.writeInt8 = BP.writeInt8\\n arr.writeInt16LE = BP.writeInt16LE\\n arr.writeInt16BE = BP.writeInt16BE\\n arr.writeInt32LE = BP.writeInt32LE\\n arr.writeInt32BE = BP.writeInt32BE\\n arr.writeFloatLE = BP.writeFloatLE\\n arr.writeFloatBE = BP.writeFloatBE\\n arr.writeDoubleLE = BP.writeDoubleLE\\n arr.writeDoubleBE = BP.writeDoubleBE\\n arr.fill = BP.fill\\n arr.inspect = BP.inspect\\n arr.toArrayBuffer = BP.toArrayBuffer\\n\\n return arr\\n}\",\n \"insert(value) {\\n\\t\\tthis.heap.push(value);\\n\\t\\t// calling heapify function to reconstruct array to heap property\\n\\t\\tthis.heapify();\\n\\t}\",\n \"_pushArray(gen, obj, opts) {\\n\\t opts = {\\n\\t indefinite: false,\\n\\t ...opts\\n\\t };\\n\\t const len = obj.length;\\n\\t if (opts.indefinite) {\\n\\t if (!gen._pushUInt8((MT$1.ARRAY << 5) | NUMBYTES.INDEFINITE)) {\\n\\t return false\\n\\t }\\n\\t } else if (!gen._pushInt(len, MT$1.ARRAY)) {\\n\\t return false\\n\\t }\\n\\t for (let j = 0; j < len; j++) {\\n\\t if (!gen.pushAny(obj[j])) {\\n\\t return false\\n\\t }\\n\\t }\\n\\t if (opts.indefinite) {\\n\\t if (!gen.push(BREAK)) {\\n\\t return false\\n\\t }\\n\\t }\\n\\t return true\\n\\t }\",\n \"_pushArray(gen, obj, opts) {\\n opts = {\\n indefinite: false,\\n ...opts\\n };\\n const len = obj.length;\\n if(opts.indefinite) {\\n if(!gen._pushUInt8((MT.ARRAY << 5) | NUMBYTES.INDEFINITE)) {\\n return false;\\n }\\n } else if(!gen._pushInt(len, MT.ARRAY)) {\\n return false;\\n }\\n for(let j = 0; j < len; j++) {\\n if(!gen.pushAny(obj[j])) {\\n return false;\\n }\\n }\\n if(opts.indefinite) {\\n if(!gen.push(BREAK)) {\\n return false;\\n }\\n }\\n return true;\\n }\",\n \"push(value) {\\n this.storage[this.length] = value;\\n this.length++;\\n }\",\n \"_emitArray(arr) {\\n for (let i = arr.length - 1; i >= 0; i--) {\\n this.emitPush(arr[i]);\\n }\\n return this.emitPush(arr.length).emit(OpCode.PACK);\\n }\",\n \"buildHeap(array) {\\n const firstParentIdx = Math.floor((array.length - 2) / 2);\\n for (let currentIdx = firstParentIdx; currentIdx >= 0; currentIdx--) {\\n this.siftDown(currentIdx, array.length - 1, array);\\n }\\n return array;\\n }\",\n \"push(value) {\\n if (this.size + 1 > this.elements.length) {\\n const newArray = new PlainArray(Math.max(this.size * 2, 3))\\n for (let i = 0; i < this.size; i++) {\\n newArray.set(i, this.elements.get(i))\\n }\\n this.elements = newArray\\n }\\n this.elements.set(this.size, value)\\n this.size += 1\\n }\",\n \"arrayToSmartBuf(arr) {\\n const w = this.wasm\\n const buf = this.arrayToBuf(arr)\\n if (buf.ptr) {\\n setTimeout(() => {\\n w._free(buf.ptr)\\n buf.len = 0\\n buf.ptr = null\\n }, 0)\\n }\\n return buf\\n }\",\n \"push(value){\\r\\n this.top += 1;\\r\\n this.storage[this.top] = value;\\r\\n }\",\n \"insert(val) {\\n this.array.push(val);\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// push value to end of array (add node to farthest bottom left of tree)\\n\\n this.siftUp(this.array.length - 1);\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// continuously swap value toward front of array to maintain maxHeap property\\n }\",\n \"push(val) {\\n // If the value we want to push is greater or equal to the array's capacity\\n if ( this.length >= this._capacity ) {\\n // We increase the size of the array to 1 larger than it's length and add our size ratio constant\\n this._resize((this.length + 1) + Array.SIZE_RATIO);\\n };\\n // Set the new value into memory at the end of where the array currently lies in memory\\n memory.set(this.ptr + this.length, val);\\n // Increase our length property\\n this.length++;\\n }\",\n \"function DynamicBytes() {\\n\\tvar buffer = [];\\n\\tvar iterator = 0;\\n\\tvar eod = false;\\n\\t\\n\\tvar self = this;\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 4 bytes each\\n\\tself.Export32Bytes = function() {\\n\\t\\tvar data = Int32Array.from(buffer);\\n\\t\\tvar bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn bytes;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 2 bytes each\\n\\tself.Export16Bytes = function() {\\n\\t\\tvar data = Int16Array.from(buffer);\\n\\t\\tvar bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn bytes;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 1 byte each\\n\\tself.Export8Bytes = function() {\\n\\t\\tvar data = Uint8Array.from(buffer);\\n\\t\\t//var bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn data;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Just export the array as is\\n\\tself.ExportCharArray = function() {\\n\\t\\treturn buffer;\\n\\t}\\n\\t//--------------------------------------------------------------------------------\\n\\t// Export the array in a fully binary, non-human readable form\\n\\tself.ExportAsBin = function() {\\n\\t\\tvar rtrn = \\\"\\\";\\n\\t\\tfor(var i = 0; i < buffer.length; i++) {\\n\\t\\t\\trtrn += String.fromCharCode(buffer[i]);\\n\\t\\t\\t//rtrn += buffer[i];\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn rtrn;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Import a non-typed array as is\\n\\tself.appendCharArray = function(array) {\\n\\t\\tbuffer = array;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Import any kind of array, adding to the end of the current array\\n\\tself.append = function(array) {\\n\\t\\tfor(var i = 0; i < array.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = array[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Add a single value to the end of the array\\n\\tself.push_back = function(value) {\\n\\t\\tbuffer[buffer.length] = value;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 32-bit number and convert it into 4 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back32 = function(value) {\\n\\t\\tvar data = new Int32Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\tdata = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 16-bit number and convert it into 2 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back16 = function(value) {\\n\\t\\tvar data = new Int16Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\tdata = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 8-bit number and convert it into 1 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back8 = function(value) {\\n\\t\\tvar data = new Int8Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 4 bytes or values in the array and convert them into\\n\\t// a single digit.\\n\\tself.get32 = function() {\\n\\t\\tvar data = new Int8Array(4);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int32Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 2 bytes or values in the array and convert them into\\n\\t// a single digit.\\n\\tself.get16 = function() {\\n\\t\\tvar data = new Int8Array(2);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int16Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 1 byte or value in the array and convert them into\\n\\t// a single digit.\\n\\tself.get8 = function() {\\n\\t\\tvar data = new Int8Array(1);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Grab the next X amount of bytes in the array and return it as a single array\\n\\tself.getUBytes = function(amount) {\\n\\t\\tvar data = new Uint8Array(amount);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn data;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Clear the array\\n\\tself.clear = function() {\\n\\t\\tbuffer = [];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Return the length of the array\\n\\tself.length = function() {\\n\\t\\treturn buffer.length;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Return the iterator to the beginning\\n\\tself.rewind = function() {\\n\\t\\titerator = 0;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Returns true if the iterator has reached the End of Data.\\n\\tself.eod = function() {\\n\\t\\treturn eod;\\n\\t}\\n}\",\n \"function callee(array) {\\n array.push('stuff');\\n}\",\n \"function writeData() {\\n Office.context.document.setSelectedDataAsync(MyArray, {coercionType: 'matrix'});\\n}\",\n \"function arraypush(thearray,value) {\\r\\n\\tthearray[ getarraysize(thearray) ] = value;\\r\\n}\",\n \"function jsNewArray() {\\n var arr = [];\\n return arr;\\n}\",\n \"function push(arr) {\\n var args = [];\\n for (var _i = 1; _i < arguments.length; _i++) {\\n args[_i - 1] = arguments[_i];\\n }\\n arr = arr.concat(flatten.apply(void 0, args));\\n return {\\n array: arr,\\n val: arr.length\\n };\\n}\",\n \"push(value) {\\n if(this.length >= this._capacity) {\\n this._resize((this.length + 1) * this.ARRAY_SIZE_RATIO)\\n }\\n memory.set(this.ptr + this.length, value)\\n this.length++\\n }\",\n \"write(data) {\\n this.buffer.push(data)\\n }\",\n \"function refArray(arr) {\\n arr.push(6);\\n console.log('List = ' + JSON.stringify(arr));\\n arr = [];\\n console.log('List = ' + JSON.stringify(arr));\\n}\",\n \"insert(value) {\\n // Insert value to the end of array\\n // Perform siftUp to correct position of value in the heap tree\\n this.heap.push(value);\\n this.siftUp(this.heap.length - 1, this.heap);\\n }\",\n \"function writeToMem(dat, at, size) {\\n\\tif(size > 32) {\\n\\t\\talert(\\\"Too large\\\");\\n\\t\\treturn;\\n\\t}\\n\\n\\tvar bdata = extend((dat >>> 0).toString(2), 32).slice(-size);\\n\\tfor(var i = at, j = 0 ; j < size ; i++, j++) {\\n\\t\\tmem[i] = Number(bdata[j]);\\n\\t\\tmem.changed[i] = true;\\n\\t}\\n\\n\\tinstateMemory(mem.currBitView);\\t\\t\\t\\t//reinstate changed memory\\n}\",\n \"function writemyfile(thearray){\\n\\n fs.writeFile('chicagocrimes.json',JSON.stringify(thearray),(err) => {\\n\\n if (err) throw err;\\n\\n });\\n}\",\n \"static writeObject(obj) {\\n return [];\\n }\",\n \"function setLocalStorageArray(index,array){\\n var string = JSON.stringify(array);\\n localStorage.setItem(index,string);\\n }\",\n \"function update_array()\\n{\\n array_size=inp_as.value;\\n generate_array();\\n}\",\n \"function _putArrayToIndexedDB(array, callback) {\\n var x = 0;\\n if(array.length == 0) {\\n callback();\\n return;\\n }\\n function loopArray(array) {\\n _putToIndexedDB(array[x],function(){\\n x++;\\n if(x < array.length) { loopArray(array); }\\n else { callback(); }\\n });\\n };\\n loopArray(array);\\n }\",\n \"_pushTypedArray(gen, obj) {\\n\\t // see https://tools.ietf.org/html/rfc8746\\n\\n\\t let typ = 0b01000000;\\n\\t let sz = obj.BYTES_PER_ELEMENT;\\n\\t const {name} = obj.constructor;\\n\\n\\t if (name.startsWith('Float')) {\\n\\t typ |= 0b00010000;\\n\\t sz /= 2;\\n\\t } else if (!name.includes('U')) {\\n\\t typ |= 0b00001000;\\n\\t }\\n\\t if (name.includes('Clamped') || ((sz !== 1) && !utils$q.isBigEndian())) {\\n\\t typ |= 0b00000100;\\n\\t }\\n\\t typ |= {\\n\\t 1: 0b00,\\n\\t 2: 0b01,\\n\\t 4: 0b10,\\n\\t 8: 0b11\\n\\t }[sz];\\n\\t if (!gen._pushTag(typ)) {\\n\\t return false\\n\\t }\\n\\t return gen._pushBuffer(\\n\\t gen,\\n\\t Buffer$5.from(obj.buffer, obj.byteOffset, obj.byteLength)\\n\\t )\\n\\t }\",\n \"static heapInMemory() {\\n return this.inMemory(function () {\\n return new Heap();\\n }, (heap) => {\\n return heap.array;\\n }, (array) => {\\n return new Heap(array);\\n });\\n }\",\n \"function saveArray(key, value) {\\n localStorage.setItem(key, JSON.stringify(value));\\n}\",\n \"constructor() {\\n\\t\\tthis.heap = [];\\n\\t}\",\n \"_pushBuffer(gen, obj) {\\n return gen._pushTypedArray(gen, obj);\\n }\",\n \"function Array() {}\",\n \"function heapify(arr) {\\n if (arr.length < 1) return arr\\n for (let i = arr.length - 1; i >= 0; i--) {\\n minHeapify(arr, i)\\n }\\n return arr\\n}\",\n \"function cPush() {\\r\\n if (cStep < cPushArray.length) \\r\\n cPushArray.length = cStep;\\r\\n cStep++;\\r\\n cPushArray.push(document.getElementById('canvas-real').toDataURL());\\r\\n}\",\n \"function setArray(array){\\r\\n localStorage.setItem('list', JSON.stringify(array));\\r\\n}\",\n \"function _gc() {\\n\\tfor (var i=0; i<0x100; i++) {\\n\\t\\tnew Uint32Array(0x400*0x400);\\n\\t}\\n}\",\n \"push(value) {\\n //if the length is greater than the capacity currently then resize\\n if (this.length >= this._capacity) {\\n this._resize((this.length + 1) * Array.SIZE_RATIO);\\n }\\n //otherwise, set the new array length and the values\\n newMem.set(this.ptr + this.length, value);\\n //increase the length counter\\n this.length++;\\n }\",\n \"function writeData() {\\n console.log(JSON.stringify(allButtonData));\\n buttonData = [];\\n allButtonData = []; \\n}\",\n \"function testArrayPush(arr) {\\n arr.push(100);\\n console.log(arr);\\n}\",\n \"_pushTypedArray(gen, obj) {\\n if(obj instanceof Uint8Array) {\\n // treat Uint8Array as a simple byte string\\n return gen._pushByteString(\\n gen, new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength));\\n }\\n\\n // see https://tools.ietf.org/html/rfc8746\\n\\n let typ = 0b01000000;\\n let sz = obj.BYTES_PER_ELEMENT;\\n const {name} = obj.constructor;\\n\\n if(name.startsWith('Float')) {\\n typ |= 0b00010000;\\n sz /= 2;\\n } else if(!name.includes('U')) {\\n typ |= 0b00001000;\\n }\\n if(name.includes('Clamped') || ((sz !== 1) && !util.isBigEndian())) {\\n typ |= 0b00000100;\\n }\\n typ |= {\\n 1: 0b00,\\n 2: 0b01,\\n 4: 0b10,\\n 8: 0b11\\n }[sz];\\n if(!gen._pushTag(typ)) {\\n return false;\\n }\\n return gen._pushByteString(\\n gen, new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength));\\n }\",\n \"push(value) {\\n this.array.push(value);\\n }\",\n \"push(value) {\\n this.array.push(value);\\n }\",\n \"pushStrArray(strArray) {\\n // this.pushInt(strArray.length) // array size\\n // let dst = 0\\n // let view = new Uint8Array(this.buff, this.offset)\\n // for (let i = 0; i < strArray.length; ++i) {\\n // let str = strArray[i]\\n // let ec = new TextEncoder().encode(str)\\n // for (let i = 0; i < ec.length; ++i) {\\n // view[dst++] = ec[i]\\n // }\\n // view[dst++] = 0\\n // }\\n // this.offset += dst\\n\\n if (!this.dv) return\\n this.pushInt(strArray.length) // array size\\n for (let i = 0; i < strArray.length; ++i) {\\n const str = strArray[i]\\n let ec = new TextEncoder().encode(str)\\n for (let k = 0; (k < ec.length) && (this.offset < this.byteLength); ++k) {\\n this.dv.setUint8(this.offset++, ec[k])\\n }\\n if (this.offset < this.byteLength)\\n this.dv.setUint8(this.offset++, 0)\\n } \\n }\",\n \"add(val) {\\n this.buffer.push(val);\\n this.buffer = this.buffer.slice(-this.size);\\n }\",\n \"function push(element){\\n\\tthis.dataStore[this.top++] = element;\\n}\",\n \"function setArray(key, array) {\\n localStorage.setItem(key, JSON.stringify(array));\\n}\",\n \"function maintahu(){\\n Array.SIZE_RATIO = 3;\\n let arr = new Array();\\n arr.push(\\\"tahuina\\\");\\n console.log(arr);\\n console.log(arr.get(0));\\n}\",\n \"function createLocalHistory(array, storage){\\n\\tfor (var i = 0; i < array.length; i++)\\n\\t\\tstorage.setItem(array[i],\\\"0\\\");\\n}\",\n \"set_data(data) {\\n this.wasmInstance.exports.opa_heap_ptr_set(this.baseHeapPtr);\\n this.wasmInstance.exports.opa_heap_top_set(this.baseHeapTop);\\n this.dataAddr = _loadJSON(this.wasmInstance, this.mem, data);\\n this.dataHeapPtr = this.wasmInstance.exports.opa_heap_ptr_get();\\n this.dataHeapTop = this.wasmInstance.exports.opa_heap_top_get();\\n }\",\n \"function AddToArray(array, data, maxLenght)\\n{\\n\\n array.push(data);\\n\\n if(array.length > maxLenght)\\n {\\n for(var i = 1; i < array.length - 1; i++)\\n {\\n for(var j = 0; j < array[i].length; j++)\\n {\\n array[i][j] = array[i + 1][j]\\n }\\n }\\n array.pop()\\n }\\n}\",\n \"function push_(item,a){// Handle resursion stop at leaf level.\\nif(a.height===0){if(a.table.length<M){var newA={ctor:'_Array',height:0,table:a.table.slice()};newA.table.push(item);return newA;}else{return null;}}// Recursively push\\nvar pushed=push_(item,botRight(a));// There was space in the bottom right tree, so the slot will\\n// be updated.\\nif(pushed!==null){var newA=nodeCopy(a);newA.table[newA.table.length-1]=pushed;newA.lengths[newA.lengths.length-1]++;return newA;}// When there was no space left, check if there is space left\\n// for a new slot with a tree which contains only the item\\n// at the bottom.\\nif(a.table.length<M){var newSlot=create(item,a.height-1);var newA=nodeCopy(a);newA.table.push(newSlot);newA.lengths.push(newA.lengths[newA.lengths.length-1]+length(newSlot));return newA;}else{return null;}}// Converts an array into a list of elements.\",\n \"insert(node) {\\n this.data.set(node, new Array())\\n }\",\n \"function writeStringToMemory(string, buffer, dontAddNull) {\\n var array = intArrayFromString(string, dontAddNull);\\n var i = 0;\\n while (i < array.length) {\\n var chr = array[i];\\n HEAP8[((buffer)+(i))]=chr\\n i = i + 1;\\n }\\n}\",\n \"function writeStringToMemory(string, buffer, dontAddNull) {\\n var array = intArrayFromString(string, dontAddNull);\\n var i = 0;\\n while (i < array.length) {\\n var chr = array[i];\\n HEAP8[((buffer)+(i))]=chr\\n i = i + 1;\\n }\\n}\",\n \"function writeStringToMemory(string, buffer, dontAddNull) {\\n var array = intArrayFromString(string, dontAddNull);\\n var i = 0;\\n while (i < array.length) {\\n var chr = array[i];\\n HEAP8[((buffer)+(i))]=chr\\n i = i + 1;\\n }\\n}\",\n \"function writeBlock(bufferArray) {\\r\\n const cb = FFI.Callback('int', [FPDF_FILEWRITE_ptr, voidPtr, 'int'], \\r\\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\\r\\n (fpdfFilewritePtr, dataPtr, size) => {\\r\\n const buff = Ref.reinterpret(dataPtr, size, 0);\\r\\n bufferArray.push(Buffer.from(buff));\\r\\n return size;\\r\\n });\\r\\n return cb;\\r\\n}\",\n \"function writeToLocalStorage() {\\n //clear data array\\n data = [];\\n //push tempData string into the array\\n data.push(`${tempData.innerHTML}`);\\n //update the local storage\\n updateLocalStorage();\\n}\",\n \"function memoryPush(process, value) {\\n process.registers.rsp -= 8n;\\n writeMemoryBytes(process, process.registers.rsp, value, 8);\\n}\",\n \"function heapslot_to_objectelements(Addr) {\\n // static ObjectElements* fromElements(HeapSlot* elems) {\\n // return reinterpret_cast<ObjectElements*>(uintptr_t(elems) - sizeof(ObjectElements));\\n // }\\n const ObjectElementsSize = host.getModuleType(Module, 'js::ObjectElements').size;\\n const ObjectElements = host.createPointerObject(\\n Addr.subtract(ObjectElementsSize),\\n Module,\\n 'js::ObjectElements*'\\n );\\n\\n return ObjectElements;\\n}\",\n \"function writeUint8Array(array, callback) {\\n\\n upload_state.encrypted += array.length;\\n\\n if (array.length > 0)\\n {\\n // logic to make dataqueue items UPLOAD_SIZE long\\n var n = dataqueue.length-1;\\n if (n<0 || dataqueue[n].length === UPLOAD_SIZE)\\n {\\n dataqueue.push(array); // start new block\\n }\\n else if (dataqueue[n].length + array.length <= UPLOAD_SIZE)\\n {\\n // append too block\\n var q = dataqueue[n];\\n dataqueue[n] = new Uint8Array(dataqueue[n].length + array.length);\\n dataqueue[n].set(q,0);\\n dataqueue[n].set(array, q.length);\\n }\\n else\\n {\\n // append + start new\\n var needed_bytes = UPLOAD_SIZE - dataqueue[n].length;\\n var q = dataqueue[n];\\n var new1 = array.slice(0, needed_bytes);\\n var new2 = array.slice(needed_bytes);\\n dataqueue[n] = new Uint8Array(UPLOAD_SIZE);\\n dataqueue[n].set(q,0);\\n dataqueue[n].set(new1,q.length);\\n dataqueue.push(new2);\\n }\\n trigger_upload();\\n }\\n\\n // we only callback when we're not too busy\\n // otherwise we wait to prevent too much mem usage\\n function trycallback()\\n {\\n if (dataqueue.length > MAX_QUEUE_LEN)\\n window.setTimeout(trycallback, 2000);\\n else\\n callback();\\n }\\n trycallback();\\n }\",\n \"push (element) {\\n this.dataStore[this.top++] = element\\n }\",\n \"function executeWithArrLength()\\n{\\n arr.length=0; //Empty the array\\n for (var i = 0; i < 15000000; i++) { //repopulate the array\\n arr[i]=Math.random();\\n }\\n}\",\n \"function enlargeMemory() {\\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\\n}\",\n \"function enlargeMemory() {\\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\\n}\",\n \"function enlargeMemory() {\\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\\n}\",\n \"function enlargeMemory() {\\n abort('Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value, or (2) set Module.TOTAL_MEMORY before the program runs.');\\n}\",\n \"push(item) {\\r\\n this.array[this.array.length] = item;\\r\\n }\",\n \"_addDimensionToJSArray(dimensions) {\\n const that = this;\\n\\n if (that.arrayIndexingMode === 'LabVIEW') {\\n that.value = [that.value];\\n }\\n else {\\n if (dimensions === undefined) {\\n dimensions = that.dimensions - 1;\\n }\\n\\n const recursion = function (arr, level) {\\n for (let i = 0; i < arr.length; i++) {\\n if (level !== dimensions) {\\n recursion(arr[i], level + 1);\\n }\\n else {\\n arr[i] = [arr[i]];\\n }\\n }\\n };\\n\\n recursion(that.value, 1);\\n }\\n }\",\n \"function push(arr, newItem){\\n[arr.length] = newItem;\\n console.log(arr)\\n}\",\n \"function MjArray() {\\n}\",\n \"insert(data) {\\r\\n\\t\\tconst size = this.heap.length;\\r\\n\\r\\n\\t\\tif (size === 0) {\\r\\n\\t\\t\\tthis.heap.push(data);\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tthis.heap.push(data);\\r\\n\\r\\n\\t\\t\\tfor (let i = parseInt(this.heap.length / 2 - 1); i >= 0; i--) {\\r\\n\\t\\t\\t\\tthis.maxHeapify(this.heap, this.heap.length, i);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"function writeUint32Array(nums, array, offset) {\\n offset = offset || 0;\\n\\n for (var i = 0; i < nums.length; i++) {\\n for (var j = 0; j < 4; j++) {\\n array[i * 4 + j + offset] = (nums[i] >>> (8 * j)) & 0xFF;\\n }\\n }\\n}\",\n \"function push(element) {\\n this.dataStore[this.top++] = element;\\n}\",\n \"function push(element) {\\n this.dataStore[this.top++] = element;\\n}\",\n \"constructor(){\\n this.heap = [];\\n this.count = 0;\\n }\",\n \"constructor(){\\n this.heap = [];\\n this.count = 0;\\n }\",\n \"function backup(queueArray) {\\n\\tfs.writeFile('./db.json', JSON.stringify({queue: queueArray}));\\n}\",\n \"function heapSortInPlace(array){\\n for(let i = 1; i < array.length; i++){\\n MaxHeap.heapifyUp(array, i);\\n }\\n\\n let temp;\\n for(let j = array.length - 1; 0 < j; j--){\\n temp = array[0];\\n array[0] = array[j];\\n array[j] = temp;\\n\\n // j is the length of array\\n MaxHeap.heapifyDown(array, 0, j);\\n }\\n\\n return array;\\n}\",\n \"read_array() {\\n // Get array size.\\n let size = this.read_varint32();\\n\\n // Allocate array.\\n let array = new Array(size);\\n this.refs.push(array);\\n\\n // Read array elements.\\n for (let i = 0; i < size; ++i) {\\n array[i] = this.read();\\n }\\n\\n return array;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5939622","0.59226626","0.5787374","0.57775414","0.57775414","0.571348","0.5663694","0.5645978","0.56428266","0.5637981","0.5614834","0.56105554","0.55599105","0.555978","0.55525315","0.5546563","0.5522782","0.5521473","0.5513374","0.5513374","0.5513374","0.5505615","0.54982644","0.54768413","0.54526144","0.5437047","0.54247695","0.5420539","0.5418317","0.5408094","0.5401891","0.53893393","0.537717","0.5372792","0.53626686","0.5361201","0.53376377","0.53364277","0.5325131","0.53149563","0.5308113","0.5292047","0.52826244","0.5270696","0.5263785","0.52482206","0.5233128","0.5218029","0.5213455","0.52126294","0.52094144","0.51961243","0.5173318","0.51719964","0.51625514","0.5157294","0.5156376","0.5148939","0.5148412","0.5135517","0.5129214","0.512729","0.5124696","0.5124696","0.5116449","0.5109241","0.5106603","0.5102503","0.50992477","0.50927645","0.50888646","0.5083785","0.5079557","0.5077478","0.5077124","0.5077124","0.5077124","0.50659734","0.5059896","0.5059011","0.50551623","0.50484604","0.5043785","0.50433064","0.50338846","0.50338846","0.50338846","0.50338846","0.5033659","0.5027001","0.5026321","0.5021096","0.5012756","0.50073195","0.5004207","0.5004207","0.5000212","0.5000212","0.4996018","0.49851134","0.49845213"],"string":"[\n \"0.5939622\",\n \"0.59226626\",\n \"0.5787374\",\n \"0.57775414\",\n \"0.57775414\",\n \"0.571348\",\n \"0.5663694\",\n \"0.5645978\",\n \"0.56428266\",\n \"0.5637981\",\n \"0.5614834\",\n \"0.56105554\",\n \"0.55599105\",\n \"0.555978\",\n \"0.55525315\",\n \"0.5546563\",\n \"0.5522782\",\n \"0.5521473\",\n \"0.5513374\",\n \"0.5513374\",\n \"0.5513374\",\n \"0.5505615\",\n \"0.54982644\",\n \"0.54768413\",\n \"0.54526144\",\n \"0.5437047\",\n \"0.54247695\",\n \"0.5420539\",\n \"0.5418317\",\n \"0.5408094\",\n \"0.5401891\",\n \"0.53893393\",\n \"0.537717\",\n \"0.5372792\",\n \"0.53626686\",\n \"0.5361201\",\n \"0.53376377\",\n \"0.53364277\",\n \"0.5325131\",\n \"0.53149563\",\n \"0.5308113\",\n \"0.5292047\",\n \"0.52826244\",\n \"0.5270696\",\n \"0.5263785\",\n \"0.52482206\",\n \"0.5233128\",\n \"0.5218029\",\n \"0.5213455\",\n \"0.52126294\",\n \"0.52094144\",\n \"0.51961243\",\n \"0.5173318\",\n \"0.51719964\",\n \"0.51625514\",\n \"0.5157294\",\n \"0.5156376\",\n \"0.5148939\",\n \"0.5148412\",\n \"0.5135517\",\n \"0.5129214\",\n \"0.512729\",\n \"0.5124696\",\n \"0.5124696\",\n \"0.5116449\",\n \"0.5109241\",\n \"0.5106603\",\n \"0.5102503\",\n \"0.50992477\",\n \"0.50927645\",\n \"0.50888646\",\n \"0.5083785\",\n \"0.5079557\",\n \"0.5077478\",\n \"0.5077124\",\n \"0.5077124\",\n \"0.5077124\",\n \"0.50659734\",\n \"0.5059896\",\n \"0.5059011\",\n \"0.50551623\",\n \"0.50484604\",\n \"0.5043785\",\n \"0.50433064\",\n \"0.50338846\",\n \"0.50338846\",\n \"0.50338846\",\n \"0.50338846\",\n \"0.5033659\",\n \"0.5027001\",\n \"0.5026321\",\n \"0.5021096\",\n \"0.5012756\",\n \"0.50073195\",\n \"0.5004207\",\n \"0.5004207\",\n \"0.5000212\",\n \"0.5000212\",\n \"0.4996018\",\n \"0.49851134\",\n \"0.49845213\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4684,"cells":{"query":{"kind":"string","value":"Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse."},"document":{"kind":"string","value":"function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\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 LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\nthis.lengthKnown = false;\nthis.chunks = []; // Loaded chunks. Index is the chunk number\n}","function LazyUint8Array() {\r\n this.lengthKnown = false;\r\n this.chunks = []; // Loaded chunks. Index is the chunk number\r\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }","u8_array() {\n let len = this.varint();\n\n this.throw_if_less_than(len);\n let data = this.buffer.subarray(this.pos, this.pos + len);\n this.pos += len;\n return data;\n }","function getUint8Array(data, i, len) {\n \"use strict\";\n var rv;\n if(typeof i === 'undefined') {\n rv = new Uint8Array(data);\n return rv instanceof Uint8Array ? rv : new unsafeWindow.Uint8Array(data);\n }\n rv = new Uint8Array(data, i, len);\n return rv instanceof Uint8Array ? rv : new unsafeWindow.Uint8Array(data, i, len);\n}","async bytes() {\n this.throwIfDisposed();\n const data = await trackerFn().read(this.dataId);\n if (this.dtype === 'string') {\n return data;\n }\n else {\n return new Uint8Array(data.buffer);\n }\n }","alloc(size, fill, encoding) {\n return new Uint8Array(size);\n }","get data() {\n DEBUG && debugAssert(this._data);\n return new Uint8Array(\n this._data.buffer.slice(this._dataIdx, this._dataIdx + this._dataLen)\n );\n }","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","arrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","async arrayBuffer() {\n\t\tconst {buffer, byteOffset, byteLength} = await consumeBody(this);\n\t\treturn buffer.slice(byteOffset, byteOffset + byteLength);\n\t}","_getBuffer(n) {\n const ret = Buffer.allocUnsafe(n);\n const retLen = n;\n let p = this.head;\n let c = 0;\n do {\n const buf = p.data;\n if (n > buf.length) {\n TypedArrayPrototypeSet(ret, buf, retLen - n);\n n -= buf.length;\n } else {\n if (n === buf.length) {\n TypedArrayPrototypeSet(ret, buf, retLen - n);\n ++c;\n if (p.next) this.head = p.next;else this.head = this.tail = null;\n } else {\n TypedArrayPrototypeSet(ret, new Uint8Array(buf.buffer, buf.byteOffset, n), retLen - n);\n this.head = p;\n p.data = buf.slice(n);\n }\n break;\n }\n ++c;\n } while ((p = p.next) !== null);\n this.length -= c;\n return ret;\n }","getBytes() {\n return Promise.all(this._dataHolders).then((multipleDataBytes) => {\n if (multipleDataBytes.length === 1) {\n return multipleDataBytes[0];\n }\n else {\n return concat_1.concatUint8Arrays(...multipleDataBytes);\n }\n });\n }","readUint8 () {\n return this.uint8arr[this.pos++]\n }","arrayBuffer() {\n\t\treturn consumeBody$1.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t}","function getBlobDataAtOnce() {\r\n byteNumbers = new Array(byteCharacters.length);\r\n\r\n for (var i = 0; i < byteCharacters.length; i++) {\r\n byteNumbers[i] = byteCharacters.charCodeAt(i);\r\n }\r\n\r\n byteArray = new Uint8Array(byteNumbers);\r\n\r\n return [byteArray];\r\n }","toUint8Array() {\n let [pausePoint] = this.pausePoints;\n if (pausePoint === undefined)\n pausePoint = this.size;\n return new Uint8Array(this.buffer, 0, pausePoint);\n }","function createByteContainer() {\n if (HAS_BUFFER)\n return new Buffer(0);\n\n return new Uint8Array();\n }","function createByteContainer() {\n if (HAS_BUFFER)\n return new Buffer(0);\n\n return new Uint8Array();\n }","function toU8Array(ptr, length) {\n return HEAPU8.subarray(ptr, ptr + length);\n }","_read(size) {\n if (this.pushedBytesLength >= this.byteLength) {\n this.push(null);\n }\n if (!size) {\n size = this.readableHighWaterMark;\n }\n const outBuffers = [];\n let i = 0;\n while (i < size && this.pushedBytesLength < this.byteLength) {\n // The last buffer may be longer than the data it contains.\n const remainingDataInAllBuffers = this.byteLength - this.pushedBytesLength;\n const remainingCapacityInThisBuffer = this.buffers[this.bufferIndex].byteLength - this.byteOffsetInCurrentBuffer;\n const remaining = Math.min(remainingCapacityInThisBuffer, remainingDataInAllBuffers);\n if (remaining > size - i) {\n // chunkSize = size - i\n const end = this.byteOffsetInCurrentBuffer + size - i;\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\n this.pushedBytesLength += size - i;\n this.byteOffsetInCurrentBuffer = end;\n i = size;\n break;\n }\n else {\n // chunkSize = remaining\n const end = this.byteOffsetInCurrentBuffer + remaining;\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\n if (remaining === remainingCapacityInThisBuffer) {\n // this.buffers[this.bufferIndex] used up, shift to next one\n this.byteOffsetInCurrentBuffer = 0;\n this.bufferIndex++;\n }\n else {\n this.byteOffsetInCurrentBuffer = end;\n }\n this.pushedBytesLength += remaining;\n i += remaining;\n }\n }\n if (outBuffers.length > 1) {\n this.push(Buffer.concat(outBuffers));\n }\n else if (outBuffers.length === 1) {\n this.push(outBuffers[0]);\n }\n }","_read(size) {\n if (this.pushedBytesLength >= this.byteLength) {\n this.push(null);\n }\n if (!size) {\n size = this.readableHighWaterMark;\n }\n const outBuffers = [];\n let i = 0;\n while (i < size && this.pushedBytesLength < this.byteLength) {\n // The last buffer may be longer than the data it contains.\n const remainingDataInAllBuffers = this.byteLength - this.pushedBytesLength;\n const remainingCapacityInThisBuffer = this.buffers[this.bufferIndex].byteLength - this.byteOffsetInCurrentBuffer;\n const remaining = Math.min(remainingCapacityInThisBuffer, remainingDataInAllBuffers);\n if (remaining > size - i) {\n // chunkSize = size - i\n const end = this.byteOffsetInCurrentBuffer + size - i;\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\n this.pushedBytesLength += size - i;\n this.byteOffsetInCurrentBuffer = end;\n i = size;\n break;\n }\n else {\n // chunkSize = remaining\n const end = this.byteOffsetInCurrentBuffer + remaining;\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\n if (remaining === remainingCapacityInThisBuffer) {\n // this.buffers[this.bufferIndex] used up, shift to next one\n this.byteOffsetInCurrentBuffer = 0;\n this.bufferIndex++;\n }\n else {\n this.byteOffsetInCurrentBuffer = end;\n }\n this.pushedBytesLength += remaining;\n i += remaining;\n }\n }\n if (outBuffers.length > 1) {\n this.push(Buffer.concat(outBuffers));\n }\n else if (outBuffers.length === 1) {\n this.push(outBuffers[0]);\n }\n }","static dataArray (length = 0) {\n if (Uint8ClampedArray) {\n return new Uint8ClampedArray(length)\n }\n return new Array(length)\n }","async peek(uint8Array, offset, length) {\n const bytesRead = await this.read(uint8Array, offset, length);\n this.peekQueue.push(uint8Array.subarray(offset, offset + bytesRead)); // Put read data back to peek buffer\n return bytesRead;\n }","async readBuffer(uint8Array, options) {\n const normOptions = this.normalizeOptions(uint8Array, options);\n const skipBytes = normOptions.position - this.position;\n if (skipBytes > 0) {\n await this.ignore(skipBytes);\n return this.readBuffer(uint8Array, options);\n }\n else if (skipBytes < 0) {\n throw new Error('`options.position` must be equal or greater than `tokenizer.position`');\n }\n if (normOptions.length === 0) {\n return 0;\n }\n const bytesRead = await this.streamReader.read(uint8Array, normOptions.offset, normOptions.length);\n this.position += bytesRead;\n if ((!options || !options.mayBeLess) && bytesRead < normOptions.length) {\n throw new peek_readable_1.EndOfStreamError();\n }\n return bytesRead;\n }","function DynamicBytes() {\n\tvar buffer = [];\n\tvar iterator = 0;\n\tvar eod = false;\n\t\n\tvar self = this;\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 4 bytes each\n\tself.Export32Bytes = function() {\n\t\tvar data = Int32Array.from(buffer);\n\t\tvar bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn bytes;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 2 bytes each\n\tself.Export16Bytes = function() {\n\t\tvar data = Int16Array.from(buffer);\n\t\tvar bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn bytes;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Exports bytes. Each value in the array will use 1 byte each\n\tself.Export8Bytes = function() {\n\t\tvar data = Uint8Array.from(buffer);\n\t\t//var bytes = new Int8Array(data.buffer);\n\t\t\n\t\treturn data;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Just export the array as is\n\tself.ExportCharArray = function() {\n\t\treturn buffer;\n\t}\n\t//--------------------------------------------------------------------------------\n\t// Export the array in a fully binary, non-human readable form\n\tself.ExportAsBin = function() {\n\t\tvar rtrn = \"\";\n\t\tfor(var i = 0; i < buffer.length; i++) {\n\t\t\trtrn += String.fromCharCode(buffer[i]);\n\t\t\t//rtrn += buffer[i];\n\t\t}\n\t\t\n\t\treturn rtrn;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Import a non-typed array as is\n\tself.appendCharArray = function(array) {\n\t\tbuffer = array;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Import any kind of array, adding to the end of the current array\n\tself.append = function(array) {\n\t\tfor(var i = 0; i < array.length; i++) {\n\t\t\tbuffer[buffer.length] = array[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Add a single value to the end of the array\n\tself.push_back = function(value) {\n\t\tbuffer[buffer.length] = value;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 32-bit number and convert it into 4 bytes, adding to the end\n\t// of the array\n\tself.push_back32 = function(value) {\n\t\tvar data = new Int32Array(1);\n\t\tdata[0] = value;\n\t\tdata = new Int8Array(data.buffer);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 16-bit number and convert it into 2 bytes, adding to the end\n\t// of the array\n\tself.push_back16 = function(value) {\n\t\tvar data = new Int16Array(1);\n\t\tdata[0] = value;\n\t\tdata = new Int8Array(data.buffer);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take in a 8-bit number and convert it into 1 bytes, adding to the end\n\t// of the array\n\tself.push_back8 = function(value) {\n\t\tvar data = new Int8Array(1);\n\t\tdata[0] = value;\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tbuffer[buffer.length] = data[i];\n\t\t}\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 4 bytes or values in the array and convert them into\n\t// a single digit.\n\tself.get32 = function() {\n\t\tvar data = new Int8Array(4);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int32Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 2 bytes or values in the array and convert them into\n\t// a single digit.\n\tself.get16 = function() {\n\t\tvar data = new Int8Array(2);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int16Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Take the next 1 byte or value in the array and convert them into\n\t// a single digit.\n\tself.get8 = function() {\n\t\tvar data = new Int8Array(1);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvar rtrn = new Int8Array(data.buffer);\n\t\t\n\t\treturn rtrn[0];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Grab the next X amount of bytes in the array and return it as a single array\n\tself.getUBytes = function(amount) {\n\t\tvar data = new Uint8Array(amount);\n\t\t\n\t\tfor(var i = 0; i < data.length; i++) {\n\t\t\tdata[i] = buffer[iterator];\n\t\t\titerator++;\n\t\t\t\n\t\t\tif(iterator == buffer.length) {\n\t\t\t\teod = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn data;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Clear the array\n\tself.clear = function() {\n\t\tbuffer = [];\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Return the length of the array\n\tself.length = function() {\n\t\treturn buffer.length;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Return the iterator to the beginning\n\tself.rewind = function() {\n\t\titerator = 0;\n\t}\n\t\n\t//--------------------------------------------------------------------------------\n\t// Returns true if the iterator has reached the End of Data.\n\tself.eod = function() {\n\t\treturn eod;\n\t}\n}","function __getArrayBuffer(ptr) {\n const buffer = memory.buffer;\n const length = new Uint32Array(buffer)[ptr + SIZE_OFFSET >>> 2];\n return buffer.slice(ptr, ptr + length);\n }"],"string":"[\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\nthis.lengthKnown = false;\\nthis.chunks = []; // Loaded chunks. Index is the chunk number\\n}\",\n \"function LazyUint8Array() {\\r\\n this.lengthKnown = false;\\r\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\r\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"function LazyUint8Array() {\\n this.lengthKnown = false;\\n this.chunks = []; // Loaded chunks. Index is the chunk number\\n }\",\n \"u8_array() {\\n let len = this.varint();\\n\\n this.throw_if_less_than(len);\\n let data = this.buffer.subarray(this.pos, this.pos + len);\\n this.pos += len;\\n return data;\\n }\",\n \"function getUint8Array(data, i, len) {\\n \\\"use strict\\\";\\n var rv;\\n if(typeof i === 'undefined') {\\n rv = new Uint8Array(data);\\n return rv instanceof Uint8Array ? rv : new unsafeWindow.Uint8Array(data);\\n }\\n rv = new Uint8Array(data, i, len);\\n return rv instanceof Uint8Array ? rv : new unsafeWindow.Uint8Array(data, i, len);\\n}\",\n \"async bytes() {\\n this.throwIfDisposed();\\n const data = await trackerFn().read(this.dataId);\\n if (this.dtype === 'string') {\\n return data;\\n }\\n else {\\n return new Uint8Array(data.buffer);\\n }\\n }\",\n \"alloc(size, fill, encoding) {\\n return new Uint8Array(size);\\n }\",\n \"get data() {\\n DEBUG && debugAssert(this._data);\\n return new Uint8Array(\\n this._data.buffer.slice(this._dataIdx, this._dataIdx + this._dataLen)\\n );\\n }\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"async arrayBuffer() {\\n\\t\\tconst {buffer, byteOffset, byteLength} = await consumeBody(this);\\n\\t\\treturn buffer.slice(byteOffset, byteOffset + byteLength);\\n\\t}\",\n \"_getBuffer(n) {\\n const ret = Buffer.allocUnsafe(n);\\n const retLen = n;\\n let p = this.head;\\n let c = 0;\\n do {\\n const buf = p.data;\\n if (n > buf.length) {\\n TypedArrayPrototypeSet(ret, buf, retLen - n);\\n n -= buf.length;\\n } else {\\n if (n === buf.length) {\\n TypedArrayPrototypeSet(ret, buf, retLen - n);\\n ++c;\\n if (p.next) this.head = p.next;else this.head = this.tail = null;\\n } else {\\n TypedArrayPrototypeSet(ret, new Uint8Array(buf.buffer, buf.byteOffset, n), retLen - n);\\n this.head = p;\\n p.data = buf.slice(n);\\n }\\n break;\\n }\\n ++c;\\n } while ((p = p.next) !== null);\\n this.length -= c;\\n return ret;\\n }\",\n \"getBytes() {\\n return Promise.all(this._dataHolders).then((multipleDataBytes) => {\\n if (multipleDataBytes.length === 1) {\\n return multipleDataBytes[0];\\n }\\n else {\\n return concat_1.concatUint8Arrays(...multipleDataBytes);\\n }\\n });\\n }\",\n \"readUint8 () {\\n return this.uint8arr[this.pos++]\\n }\",\n \"arrayBuffer() {\\n\\t\\treturn consumeBody$1.call(this).then(function (buf) {\\n\\t\\t\\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\\n\\t\\t});\\n\\t}\",\n \"function getBlobDataAtOnce() {\\r\\n byteNumbers = new Array(byteCharacters.length);\\r\\n\\r\\n for (var i = 0; i < byteCharacters.length; i++) {\\r\\n byteNumbers[i] = byteCharacters.charCodeAt(i);\\r\\n }\\r\\n\\r\\n byteArray = new Uint8Array(byteNumbers);\\r\\n\\r\\n return [byteArray];\\r\\n }\",\n \"toUint8Array() {\\n let [pausePoint] = this.pausePoints;\\n if (pausePoint === undefined)\\n pausePoint = this.size;\\n return new Uint8Array(this.buffer, 0, pausePoint);\\n }\",\n \"function createByteContainer() {\\n if (HAS_BUFFER)\\n return new Buffer(0);\\n\\n return new Uint8Array();\\n }\",\n \"function createByteContainer() {\\n if (HAS_BUFFER)\\n return new Buffer(0);\\n\\n return new Uint8Array();\\n }\",\n \"function toU8Array(ptr, length) {\\n return HEAPU8.subarray(ptr, ptr + length);\\n }\",\n \"_read(size) {\\n if (this.pushedBytesLength >= this.byteLength) {\\n this.push(null);\\n }\\n if (!size) {\\n size = this.readableHighWaterMark;\\n }\\n const outBuffers = [];\\n let i = 0;\\n while (i < size && this.pushedBytesLength < this.byteLength) {\\n // The last buffer may be longer than the data it contains.\\n const remainingDataInAllBuffers = this.byteLength - this.pushedBytesLength;\\n const remainingCapacityInThisBuffer = this.buffers[this.bufferIndex].byteLength - this.byteOffsetInCurrentBuffer;\\n const remaining = Math.min(remainingCapacityInThisBuffer, remainingDataInAllBuffers);\\n if (remaining > size - i) {\\n // chunkSize = size - i\\n const end = this.byteOffsetInCurrentBuffer + size - i;\\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\\n this.pushedBytesLength += size - i;\\n this.byteOffsetInCurrentBuffer = end;\\n i = size;\\n break;\\n }\\n else {\\n // chunkSize = remaining\\n const end = this.byteOffsetInCurrentBuffer + remaining;\\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\\n if (remaining === remainingCapacityInThisBuffer) {\\n // this.buffers[this.bufferIndex] used up, shift to next one\\n this.byteOffsetInCurrentBuffer = 0;\\n this.bufferIndex++;\\n }\\n else {\\n this.byteOffsetInCurrentBuffer = end;\\n }\\n this.pushedBytesLength += remaining;\\n i += remaining;\\n }\\n }\\n if (outBuffers.length > 1) {\\n this.push(Buffer.concat(outBuffers));\\n }\\n else if (outBuffers.length === 1) {\\n this.push(outBuffers[0]);\\n }\\n }\",\n \"_read(size) {\\n if (this.pushedBytesLength >= this.byteLength) {\\n this.push(null);\\n }\\n if (!size) {\\n size = this.readableHighWaterMark;\\n }\\n const outBuffers = [];\\n let i = 0;\\n while (i < size && this.pushedBytesLength < this.byteLength) {\\n // The last buffer may be longer than the data it contains.\\n const remainingDataInAllBuffers = this.byteLength - this.pushedBytesLength;\\n const remainingCapacityInThisBuffer = this.buffers[this.bufferIndex].byteLength - this.byteOffsetInCurrentBuffer;\\n const remaining = Math.min(remainingCapacityInThisBuffer, remainingDataInAllBuffers);\\n if (remaining > size - i) {\\n // chunkSize = size - i\\n const end = this.byteOffsetInCurrentBuffer + size - i;\\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\\n this.pushedBytesLength += size - i;\\n this.byteOffsetInCurrentBuffer = end;\\n i = size;\\n break;\\n }\\n else {\\n // chunkSize = remaining\\n const end = this.byteOffsetInCurrentBuffer + remaining;\\n outBuffers.push(this.buffers[this.bufferIndex].slice(this.byteOffsetInCurrentBuffer, end));\\n if (remaining === remainingCapacityInThisBuffer) {\\n // this.buffers[this.bufferIndex] used up, shift to next one\\n this.byteOffsetInCurrentBuffer = 0;\\n this.bufferIndex++;\\n }\\n else {\\n this.byteOffsetInCurrentBuffer = end;\\n }\\n this.pushedBytesLength += remaining;\\n i += remaining;\\n }\\n }\\n if (outBuffers.length > 1) {\\n this.push(Buffer.concat(outBuffers));\\n }\\n else if (outBuffers.length === 1) {\\n this.push(outBuffers[0]);\\n }\\n }\",\n \"static dataArray (length = 0) {\\n if (Uint8ClampedArray) {\\n return new Uint8ClampedArray(length)\\n }\\n return new Array(length)\\n }\",\n \"async peek(uint8Array, offset, length) {\\n const bytesRead = await this.read(uint8Array, offset, length);\\n this.peekQueue.push(uint8Array.subarray(offset, offset + bytesRead)); // Put read data back to peek buffer\\n return bytesRead;\\n }\",\n \"async readBuffer(uint8Array, options) {\\n const normOptions = this.normalizeOptions(uint8Array, options);\\n const skipBytes = normOptions.position - this.position;\\n if (skipBytes > 0) {\\n await this.ignore(skipBytes);\\n return this.readBuffer(uint8Array, options);\\n }\\n else if (skipBytes < 0) {\\n throw new Error('`options.position` must be equal or greater than `tokenizer.position`');\\n }\\n if (normOptions.length === 0) {\\n return 0;\\n }\\n const bytesRead = await this.streamReader.read(uint8Array, normOptions.offset, normOptions.length);\\n this.position += bytesRead;\\n if ((!options || !options.mayBeLess) && bytesRead < normOptions.length) {\\n throw new peek_readable_1.EndOfStreamError();\\n }\\n return bytesRead;\\n }\",\n \"function DynamicBytes() {\\n\\tvar buffer = [];\\n\\tvar iterator = 0;\\n\\tvar eod = false;\\n\\t\\n\\tvar self = this;\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 4 bytes each\\n\\tself.Export32Bytes = function() {\\n\\t\\tvar data = Int32Array.from(buffer);\\n\\t\\tvar bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn bytes;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 2 bytes each\\n\\tself.Export16Bytes = function() {\\n\\t\\tvar data = Int16Array.from(buffer);\\n\\t\\tvar bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn bytes;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Exports bytes. Each value in the array will use 1 byte each\\n\\tself.Export8Bytes = function() {\\n\\t\\tvar data = Uint8Array.from(buffer);\\n\\t\\t//var bytes = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn data;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Just export the array as is\\n\\tself.ExportCharArray = function() {\\n\\t\\treturn buffer;\\n\\t}\\n\\t//--------------------------------------------------------------------------------\\n\\t// Export the array in a fully binary, non-human readable form\\n\\tself.ExportAsBin = function() {\\n\\t\\tvar rtrn = \\\"\\\";\\n\\t\\tfor(var i = 0; i < buffer.length; i++) {\\n\\t\\t\\trtrn += String.fromCharCode(buffer[i]);\\n\\t\\t\\t//rtrn += buffer[i];\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn rtrn;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Import a non-typed array as is\\n\\tself.appendCharArray = function(array) {\\n\\t\\tbuffer = array;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Import any kind of array, adding to the end of the current array\\n\\tself.append = function(array) {\\n\\t\\tfor(var i = 0; i < array.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = array[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Add a single value to the end of the array\\n\\tself.push_back = function(value) {\\n\\t\\tbuffer[buffer.length] = value;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 32-bit number and convert it into 4 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back32 = function(value) {\\n\\t\\tvar data = new Int32Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\tdata = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 16-bit number and convert it into 2 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back16 = function(value) {\\n\\t\\tvar data = new Int16Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\tdata = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take in a 8-bit number and convert it into 1 bytes, adding to the end\\n\\t// of the array\\n\\tself.push_back8 = function(value) {\\n\\t\\tvar data = new Int8Array(1);\\n\\t\\tdata[0] = value;\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tbuffer[buffer.length] = data[i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 4 bytes or values in the array and convert them into\\n\\t// a single digit.\\n\\tself.get32 = function() {\\n\\t\\tvar data = new Int8Array(4);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int32Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 2 bytes or values in the array and convert them into\\n\\t// a single digit.\\n\\tself.get16 = function() {\\n\\t\\tvar data = new Int8Array(2);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int16Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Take the next 1 byte or value in the array and convert them into\\n\\t// a single digit.\\n\\tself.get8 = function() {\\n\\t\\tvar data = new Int8Array(1);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tvar rtrn = new Int8Array(data.buffer);\\n\\t\\t\\n\\t\\treturn rtrn[0];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Grab the next X amount of bytes in the array and return it as a single array\\n\\tself.getUBytes = function(amount) {\\n\\t\\tvar data = new Uint8Array(amount);\\n\\t\\t\\n\\t\\tfor(var i = 0; i < data.length; i++) {\\n\\t\\t\\tdata[i] = buffer[iterator];\\n\\t\\t\\titerator++;\\n\\t\\t\\t\\n\\t\\t\\tif(iterator == buffer.length) {\\n\\t\\t\\t\\teod = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn data;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Clear the array\\n\\tself.clear = function() {\\n\\t\\tbuffer = [];\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Return the length of the array\\n\\tself.length = function() {\\n\\t\\treturn buffer.length;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Return the iterator to the beginning\\n\\tself.rewind = function() {\\n\\t\\titerator = 0;\\n\\t}\\n\\t\\n\\t//--------------------------------------------------------------------------------\\n\\t// Returns true if the iterator has reached the End of Data.\\n\\tself.eod = function() {\\n\\t\\treturn eod;\\n\\t}\\n}\",\n \"function __getArrayBuffer(ptr) {\\n const buffer = memory.buffer;\\n const length = new Uint32Array(buffer)[ptr + SIZE_OFFSET >>> 2];\\n return buffer.slice(ptr, ptr + length);\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.81654984","0.81491023","0.8149054","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.8143981","0.81040406","0.81040406","0.81040406","0.81040406","0.74478024","0.6625305","0.6520594","0.6497238","0.6398757","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.6327838","0.63259","0.6258334","0.62391263","0.6238019","0.62097204","0.6200886","0.61051315","0.6081344","0.6081344","0.6015486","0.60083485","0.60083485","0.5991035","0.59623533","0.5884165","0.5867158","0.5865725"],"string":"[\n \"0.81654984\",\n \"0.81491023\",\n \"0.8149054\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.8143981\",\n \"0.81040406\",\n \"0.81040406\",\n \"0.81040406\",\n \"0.81040406\",\n \"0.74478024\",\n \"0.6625305\",\n \"0.6520594\",\n \"0.6497238\",\n \"0.6398757\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.6327838\",\n \"0.63259\",\n \"0.6258334\",\n \"0.62391263\",\n \"0.6238019\",\n \"0.62097204\",\n \"0.6200886\",\n \"0.61051315\",\n \"0.6081344\",\n \"0.6081344\",\n \"0.6015486\",\n \"0.60083485\",\n \"0.60083485\",\n \"0.5991035\",\n \"0.59623533\",\n \"0.5884165\",\n \"0.5867158\",\n \"0.5865725\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.81542194"},"document_rank":{"kind":"string","value":"27"}}},{"rowIdx":4685,"cells":{"query":{"kind":"string","value":"======== compiled code from system/lib/compilerrt , see readme therein"},"document":{"kind":"string","value":"function ___muldsi3($a, $b) {\n $a = $a | 0;\n $b = $b | 0;\n var $1 = 0, $2 = 0, $3 = 0, $6 = 0, $8 = 0, $11 = 0, $12 = 0;\n $1 = $a & 65535;\n $2 = $b & 65535;\n $3 = Math_imul($2, $1) | 0;\n $6 = $a >>> 16;\n $8 = ($3 >>> 16) + (Math_imul($2, $6) | 0) | 0;\n $11 = $b >>> 16;\n $12 = Math_imul($11, $1) | 0;\n return (tempRet0 = (($8 >>> 16) + (Math_imul($11, $6) | 0) | 0) + ((($8 & 65535) + $12 | 0) >>> 16) | 0, 0 | ($8 + $12 << 16 | $3 & 65535)) | 0;\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 compile() {\n\n}","function VersionCompiler() {\n}","Compile() {\n\n }","function Compiler() {\n}","function compileLibC () {\n console.log('compileLibC');\n\n /* compile a fake program that uses c library */\n execSync(\n 'cl65 -T -t c64 -O -Os ' +\n '-Ln build/libc.lbl ' +\n '--static-locals ' +\n '--config ' + (passPostfix === '' ? '' : 'build/') + 'libc' + passPostfix + '.cfg ' +\n 'libc.c'\n );\n\n /* create an zeroed binary the same size as the total ram used */\n execSync(\n '(' +\n 'echo -n \"ibase=16;scale=16;\" && ' +\n '((grep __RAM2_LAST__ build/libc.lbl|' +\n \"sed -n \\\"s/al \\\\([^ ]*\\\\).*/\\\\1/p\\\")|tr -d '\\n')\" +\n ' && echo -n \"-\" && ' +\n 'grep __RAM2_START__ build/libc.lbl|' +\n 'sed -n \"s/al \\\\([^ ]*\\\\).*/\\\\1/p\"' +\n ')|bc|' +\n 'xargs -I {} dd if=/dev/zero bs=1 count={} of=build/libcdata.bin'\n );\n\n /* Create a combined binary of the ram segments\n so that they can be copied as one blob */\n execSync(\n 'dd if=build/libcdata2.bin of=build/libcdata.bin conv=notrunc;' +\n 'rm build/libcdata2.bin'\n );\n\n /* read the label file and use its contents to\n update each function address in the hashmap */\n const lineReader = readline.createInterface({\n input: fs.createReadStream('build/libc.lbl')\n });\n\n lineReader.on('line', updateFunctionAddress.bind(2));\n\n /* when finished, start the next step (compiling the functions that\n make up my program) */\n lineReader.on('close', passPostfix === '' ? compileLexer : compileData);\n}","function CCUtility() {}","function compile() {\n cloudCompile('Compile', 'compile', function (data, terminalNeeded) {});\n}","getCpp(){ return this.program.generateCpp(); }","static fromCASFile(casfile) {\n//-----------\nlggr.warn(\"fromCASFile: Not implemented\");\nreturn void 0;\n}","compile() {\n if (this.currentProgram.isExecutable()) {\n this.messageBox.message = \"Erfolgreich übersetzt!\\nProgramm kann ausgeführt werden.\"\n } else if (this.currentProgram.isNotExecutable()) {\n this.messageBox.message = \"Übersetzungsfehler!\\n\" + this.currentProgram.errorMessage;\n } else if (this.currentProgram.isUnknown()) {\n this.messageBox.message = \"Backend ist noch nicht implementiert.\\nSelbst geschriebene Programme können noch nicht übersetzt werden.\\nBitte verwende ein Beispielprogramm.\";\n } else {\n console.error(\"Unbekannter Status in currentProgram.\");\n }\n }","function __jsc(what) {\n\treturn window.JSC ? window.JSC[what] : null;\n}","function Code() {\n // convert to comp bit code\n}","static final private internal function m106() {}","function Compiler(){\n this.reset = function() { this.descriptorsByFile = {}; }.bind(this);\n\n this.reset();\n}","function deploy(bytecode, abi, pipe) {\n\n}","function comportement (){\n\t }","function compile() {\n fs.readFile(src, 'utf8', function(err, str){\n if (err) {\n next(err);\n } else {\n compiler.compile(str, function(err, str){\n if (err) {\n next(err);\n } else {\n fs.writeFile(dest, str, 'utf8', function(err){\n next(err);\n });\n }\n });\n }\n });\n }","compile() {\n // Check if it is already compiled\n if (!this.compiled) {\n // Find the file and read it into memory\n let filePath = path.resolve(__dirname, 'contracts', 'SimpleStorage.sol');\n let fileSource = fs.readFileSync(filePath, 'UTF-8');\n\n // Compile the contract with the contract source and 1 for optimization\n let compiled = solc.compile(fileSource, 1);\n\n // Store the bytecode, as we need it for deployment\n this.bytecode = \"0x\" + compiled.contracts[':simplestorage'].bytecode;\n\n // Store the abi (application binary interface) for js to interface with the contract on the chain\n let contractInterface = compiled.contracts[':simplestorage'].interface; // this is a json object that web3 uses as an interface\n this.abi = JSON.parse(contractInterface);\n this.compiled = true;\n }\n }","@memoize\n get compiler() {\n return new TaskList({\n debug: true,\n name: `Compiling ${this.type}: ${this.projectName}`,\n tasks: [\n this.parser,\n TaskList.forEach({\n name: `Compiling imports`,\n list: () => this.activeImports,\n getTask: (file) =>\n new Task({\n name: `Compiling import: ${file.file}`,\n run: () => file.compile()\n })\n }),\n new Task({\n name: \"Combining output\",\n run: (allCompiled) => {\n const compiled = allCompiled.join(\"\\n// -----------\\n\")\n this.setState(\"compiled\", compiled)\n return compiled\n }\n }),\n new Task({\n name: \"Saving compiled output\",\n run: async (compiled) => {\n this.outputFile.setContents(compiled)\n return await this.outputFile.save()\n }\n })\n ]\n })\n }","function detectCompilerInfo(decoded) {\n if (typeof decoded !== \"object\" || decoded === null) {\n return undefined;\n }\n //cbor sometimes returns maps and sometimes objects,\n //so let's make things consistent by converting to a map\n //(although see note above?)\n if (!(decoded instanceof Map)) {\n decoded = new Map(Object.entries(decoded));\n }\n if (!decoded.has(\"solc\")) {\n //return undefined if the solc version field is not present\n //(this occurs if version <0.5.9)\n //currently no other language attaches cbor info, so, yeah\n return undefined;\n }\n const rawVersion = decoded.get(\"solc\");\n if (typeof rawVersion === \"string\") {\n //for prerelease versions, the version is stored as a string.\n return {\n name: \"solc\",\n version: rawVersion\n };\n }\n else if (rawVersion instanceof Uint8Array && rawVersion.length === 3) {\n //for release versions, it's stored as a bytestring of length 3, with the\n //bytes being major, minor, patch. so we just join them with \".\" to form\n //a version string (although it's missing precise commit & etc).\n return {\n name: \"solc\",\n version: rawVersion.join(\".\")\n };\n }\n else {\n //return undefined on anything else\n return undefined;\n }\n}","compile() {\n try {\n let code = this.state.code.replace(/\\t/g, \"\").replace(/ /g, \"\").replace(/\\r\\n/g, \"\\n\"); // delete all spaces and tabs\n\n this.machine.name = this.setName(code); // set name\n this.machine.memory = this.memoryInit(code); // set variables and adressess\n this.machine.instructions = this.setInstructions(code); // set commands\n \n this.machine.ready = true; // change state of machine\n this.machine.running = false;\n this.machine.error = false;\n this.machine.currentOp = 0;\n\n this.log(\"Skompilowano program: \" + this.machine.name);\n console.log(this.machine.memory)\n } catch(e) {\n this.log(e.name + \": \" + e.message, \"error\");\n this.machine.ready = false;\n this.machine.error = true;\n } finally {\n this.setState({\n name: this.machine.name,\n ready: this.machine.ready,\n error: this.machine.error,\n running: this.machine.running,\n currentOp: this.machine.currentOp,\n memory: this.machine.memory\n });\n }\n }","__recompile() {\n this.__isMounted = false;\n this.__isCompiled = false;\n this.__evaluationComponent.__disableProxy = null;\n this.__compiling = {};\n this.__recompiling = {};\n this.__setEvents();\n this.__setParents();\n this.__setBooleanAttributes();\n this.__defineAttributes();\n }","function baseCompile(component, target) {\n\n const importVueTemp = () => `import _${uppercamelize(component)} from './${component}';`;\n const importStyleTemp = () => `import './style';`;\n const exportTemp = () => `export default _${uppercamelize(component)};`;\n\n const content = `${utils.tips(packageJson.author)}\n \n${importVueTemp()}\n\n${importStyleTemp()}\n\n${exportTemp()}`;\n\n fs.writeFileSync(target, content);\n}","function mbcs() {}","function mbcs() {}","function rc(){}","async function compiler() {\n\ttry {\n\t await electronInstaller.createWindowsInstaller({\n\t appDirectory: '/var/www/nicoldesktop/release-builds/Insurance-win32-ia32',\n\t outputDirectory: '/var/www/nicoldesktop/release-builds/Insurance-win32-ia32/installer',\n\t authors: 'NICOL Devs',\n\t exe: 'Insurance.exe',\n\t iconUrl: '/var/www/nicoldesktop/assets/icons/win/icon.ico', \n\t setupIcon: '/var/www/nicoldesktop/assets/icons/win/icon.ico',\n\t setupExe: 'NICOL.exe',\n\t setupMsi: 'NICOL.exe'\n\t });\n\t console.log('It worked!');\n\t} catch (e) {\n\t console.log(`No dice: ${e.message}`);\n\t}\n}","function fos6_c() {\n ;\n }","function getCompilerOpts(config)\r\n{\r\n // set vars to initial state\r\n VERSION = \"\";\r\n DEVENV = \"\";\r\n DEVENVFLAGS = \"\";\r\n CPPFLAGS = \"\";\r\n LDFLAGS = \"\";\r\n LIBS = \"\";\r\n CONVERT = false;\r\n CXX = \"\";\r\n LD = \"\";\r\n AR = \"\";\r\n AS = \"\";\r\n SLNVER=\"\";\r\n SLNCOMMENT=\"\";\r\n UNICODELOG = false;\r\n NOSTCRT = false;\r\n WINDIFF = \"\";\r\n ICCCONVERT = \"\";\r\n PLATFORM = \"\";\r\n CLVARSBAT = \"\";\r\n ICCVER = \"\";\r\n\r\n parseConfig(config);\r\n\r\n if (0 == WINDIFF.length)\r\n {\r\n if (VERSION.length)\r\n {\r\n var ver = \"\";\r\n if (0 <= VERSION.indexOf(\".\"))\r\n ver = VERSION.replace(\".\", \"\");\r\n var path = WshShell.Environment.Item(\"VS\" + ver + \"COMNTOOLS\");\r\n if (path.length)\r\n {\r\n WINDIFF = \"\\\"\" +\r\n fso.BuildPath(path.replace(/\\\"/g, \"\"), \"bin\\\\windiff\") +\r\n \"\\\"\";\r\n }\r\n }\r\n\r\n if (0 == WINDIFF.length)\r\n WINDIFF = \"windiff\";\r\n }\r\n}","function cp15() {\n this.c0_cpuid = 0;\n this.c0_cachetype = 0;\n this.c0_c1 = new Uint32Array(8); // Feature registers. \n this.c0_c2 = new Uint32Array(8); // Instruction set registers. \n this.c1_sys = 0;// System control register. \n this.c1_coproc = 0; // Coprocessor access register. \n this.c1_xscaleauxcr = 0; // XScale auxiliary control register. \n this.c2_base0 = 0; // MMU translation table base 0. \n this.c2_base1 = 0; // MMU translation table base 1. \n this.c2_mask = 0; // MMU translation table base mask. \n this.c2_data = 0; // MPU data cachable bits. \n this.c2_insn = 0; // MPU instruction cachable bits. \n this.c3 = 0; // MMU domain access control register MPU write buffer control. \n this.c5_insn = 0; // Fault status registers. \n this.c5_data = 0;\n this.c6_region = new Uint32Array(8); // MPU base/size registers. \n this.c6_insn = 0; // Fault address registers. \n this.c6_data = 0;\n this.c9_insn = 0; // Cache lockdown registers. \n this.c9_data = 0;\n this.c13_fcse = 0; // FCSE PID. \n this.c13_context = 0; // Context ID. \n this.c13_tls1 = 0; // User RW Thread register. \n this.c13_tls2 = 0; // User RO Thread register. \n this.c13_tls3 = 0; // Privileged Thread register. \n this.c15_cpar = 0; // XScale Coprocessor Access Register \n this.c15_ticonfig = 0; // TI925T configuration byte. \n this.c15_i_max = 0; // Maximum D-cache dirty line index. \n this.c15_i_min = 0; // Minimum D-cache dirty line index. \n this.c15_threadid = 0; // TI debugger thread-ID. \n } //} cp15;","static startCompile() {\n //Set compilation flag to true.\n isCompiling = true;\n _Functions.log('INFO: Beginning Compilation...');\n //Get source code from text area input.\n let code = document.getElementById(\"inputCode\").value;\n //code = mackintosh.compilerFunctions.trim(code);\n _Lexer.populateProgram(code);\n _Lexer.lex();\n //Check if there is a $ at the end of the program, if not display warning.\n if (program[program.length - 1] != '$') {\n _Functions.log('LEXER WARNING: End of Program $ Not Found.');\n warnCount++;\n }\n return isCompiling;\n }","function startMyCompiler() {\n throw new Error('You have no compiler!');\n}","function compliment() {\n return \"Lekker bezig met die functies, Jan!\"\n}","function fetchCompileCode(base, body) {\n return request_1.default({\n base: base,\n url: '/utils/script/compileCode',\n options: {\n method: 'POST',\n body: body,\n headers: {\n 'Content-Type': 'application/json'\n }\n }\n });\n}","function b(){var a,b=\"axe\",c=\"\";return\"undefined\"!=typeof axe&&axe._audit&&!axe._audit.application&&(b=axe._audit.application),\"undefined\"!=typeof axe&&(c=axe.version),a=b+\".\"+c}","function compile_fun() {\n exec(\"mi \" + sourceFile + ' > ' + __dirname +'/webpage/js/data-source.js', (error, stdout, stderr) => {\n\tif (error) {\n\t fs.readFile(__dirname +'/webpage/js/data-source.js', function(err, buf) {\n\t\tfs.writeFile(__dirname +'/webpage/js/data-source.js',\n\t\t\t \"let inputModel = '\" + buf.toString().replace(/(\\r\\n|\\n|\\r)/gm, \"\")\n\t\t\t + \"';\" , function (err) {if (err) return console.log(err);});});return;}\n\tif (stderr) {\n console.log(`stderr: ${stderr}`);\n return;\n\t}\n });\n}","transient private internal function m185() {}","function InterpreterCompileAndRun( program_text )\n{\n\t// Clear contents.\n\tinterpreter_stdout = '';\n\tinterpreter_stderr = '';\n\n\tvar file_name = 'test.u';\n\tFS.writeFile( file_name, program_text );\n\tvar call_result = callMain( [file_name, '--entry', 'main'] );\n\n\treturn [ call_result, interpreter_stdout, interpreter_stderr ];\n}","function ELCHNOSCompiler(printFunc, downloadBoxDOMObject){\n\t//printFunc省略時はconsole.logに出力。\n\tif(printFunc){\n\t\tthis.debug = printFunc;\n\t} else{\n\t\tthis.debug = function(s){ console.log(s); };\n\t}\n\tthis.downloadBoxDOMObject = downloadBoxDOMObject;\n\t\n\tthis.reset();\n\t//0はエントリポイント(main)用に予約\n\tthis.nextLabelID = 1;\n\tthis.integerRegisterAllocationTable = new Array();\n\tthis.pointerRegisterAllocationTable = new Array();\n}","function ze(e,t){arguments.length>2&&(t.dependencies=Array.prototype.slice.call(arguments,2)),ci[e]=t}","function c(e,t,n){Array.isArray(e)?(n=t,t=e,e=void 0):\"string\"!=typeof e&&(n=e,e=t=void 0),t&&!Array.isArray(t)&&(n=t,t=void 0),t||(t=[\"require\",\"exports\",\"module\"]),\n//Set up properties for this module. If an ID, then use\n//internal cache. If no ID, then use the external variables\n//for this node module.\ne?\n//Put the module in deep freeze until there is a\n//require call for it.\nd[e]=[e,t,n]:l(e,t,n)}","function compileClicked() {\r\n\t\tvar enabledSections = {};\r\n\t\t$('.secCheck').each(function(cb) {\r\n\t\t\tif (cb.checked)\r\n\t\t\t\tenabledSections[cb.id.substr(4)] = 1;\r\n\t\t});\r\n\t\t\r\n\t\tvar src = compile(s.sections, s.sectionMap, enabledSections);\r\n\t\tvar header = serializeEnabledSections(s.sections, enabledSections);\r\n\t\tif ($$('#compressionAdvanced').checked) {\r\n\t\t\t$$('#compile').disabled = true;\r\n\t\t\tclosureCompile(src, true, function(closureResult) {\r\n\t\t\t\t$$('#compile').disabled = false;\r\n\t\t\t\t$('#resultDiv').animate({$$slide: 1, $$show: 1});\r\n\t\t\t\tif (closureResult) {\r\n\t\t\t\t\t$('#gzipRow, #downloadRow').set({$display: 'table-row'});\r\n\t\t\t\t\t$$('#resultSrc').value = header + closureResult.compiledCode;\r\n\t\t\t\t\t$('#resultPlain').fill((closureResult.statistics.compressedSize/1024).toFixed(2) + 'kb (' + closureResult.statistics.compressedSize + ' bytes)');\r\n\t\t\t\t\t$('#resultGzippedSize').fill((closureResult.statistics.compressedGzipSize/1024).toFixed(2) + 'kb (' + closureResult.statistics.compressedGzipSize + ' bytes)');\r\n\t\t\t\t\t$$('#resultLink').setAttribute('href', 'http://closure-compiler.appspot.com' +closureResult.outputFilePath);\r\n\t\t\t\t\t$('#resultGzippedComment').set({$$fade: closureResult.statistics.compressedGzipSize > MAX_SIZE ? 1 : 0});\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t\talert(\"Google Closure Service not availble. Try again later.\");\r\n\t\t\t});\r\n\t\t}\r\n\t\telse {\r\n\t\t\t$('#resultDiv').animate({$$slide: 1, $$show: 1});\r\n\t\t\t$$('#resultSrc').value = header + src.replace(/@@@VERSION@@@/, VERSION);\r\n\t\t\t$('#resultPlain').fill((src.length/1024).toFixed(2) + 'kb');\r\n\t\t\t$('#gzipRow, #downloadRow').set({$display: 'none'});\r\n\t\t}\r\n\t\treturn false;\r\n\t}","get compilerObject() {\r\n return this._compilerObject;\r\n }","function runtime() {\n\t _dereq_(578);\n\t}","function jj(t,e,n,r,i,o,a,s){var l=(\"function\"===typeof n?n.options:n)||{};return l.__file=\"source.vue\",l.render||(l.render=t.render,l.staticRenderFns=t.staticRenderFns,l._compiled=!0,i&&(l.functional=!0)),l._scopeId=r,l}","function cO(t,e,n,i,r,o,a,s){var u=(\"function\"===typeof n?n.options:n)||{};return u.__file=\"source.vue\",u.render||(u.render=t.render,u.staticRenderFns=t.staticRenderFns,u._compiled=!0,r&&(u.functional=!0)),u._scopeId=i,u}","systemCheck() {\n\n }","function no_overlib() { return ver3fix; }","function compile() {\n //Return error-log to logger\n if (document.getElementById('error-log') !== null) {\n document.getElementById('error-log').innerHTML = \"\";\n document.getElementById('error-log').id = 'machine-code';\n }\n //Start lexical analysis\n lex();\n}","function Compiler () {\n this.importPath = []\n this.entryFile = null\n this.typeSystem = new TypeSystem()\n this.parser = new Parser()\n // Setup the default import path\n var extDir = path.join(path.dirname(__filename), '..', 'ext')\n this.importPath.push(extDir)\n}","get complication() {\n\t\treturn this.__complication;\n\t}","private internal function m248() {}","function LoadCrunchDecoder() {\n function e(a){throw a;}var j=void 0,l=!0,m=null,p=!1;function q(){return function(){}}var s;s||(s=eval(\"(function() { try { return Module || {} } catch(e) { return {} } })()\"));var aa={},v;for(v in s)s.hasOwnProperty(v)&&(aa[v]=s[v]);var w=\"object\"===typeof process&&\"function\"===typeof require,ba=\"object\"===typeof window,ca=\"function\"===typeof importScripts,da=!ba&&!w&&!ca;\n if(w){s.print=function(a){process.stdout.write(a+\"\\n\")};s.printErr=function(a){process.stderr.write(a+\"\\n\")};var ea=require(\"fs\"),fa=require(\"path\");s.read=function(a,b){var a=fa.normalize(a),c=ea.readFileSync(a);!c&&a!=fa.resolve(a)&&(a=path.join(__dirname,\"..\",\"src\",a),c=ea.readFileSync(a));c&&!b&&(c=c.toString());return c};s.readBinary=function(a){return s.read(a,l)};s.load=function(a){ga(read(a))};s.arguments=process.argv.slice(2);module.exports=s}else da?(s.print=print,\"undefined\"!=typeof printErr&&\n (s.printErr=printErr),s.read=\"undefined\"!=typeof read?read:function(){e(\"no read() available (jsc?)\")},s.readBinary=function(a){return read(a,\"binary\")},\"undefined\"!=typeof scriptArgs?s.arguments=scriptArgs:\"undefined\"!=typeof arguments&&(s.arguments=arguments),this.Module=s):ba||ca?(s.read=function(a){var b=new XMLHttpRequest;b.open(\"GET\",a,p);b.send(m);return b.responseText},\"undefined\"!=typeof arguments&&(s.arguments=arguments),\"undefined\"!==typeof console?(s.print=function(a){console.log(a)},\n s.printErr=function(a){console.log(a)}):s.print=q(),ba?this.Module=s:s.load=importScripts):e(\"Unknown runtime environment. Where are we?\");function ga(a){eval.call(m,a)}\"undefined\"==!s.load&&s.read&&(s.load=function(a){ga(s.read(a))});s.print||(s.print=q());s.printErr||(s.printErr=s.print);s.arguments||(s.arguments=[]);s.print=s.print;s.P=s.printErr;s.preRun=[];s.postRun=[];for(v in aa)aa.hasOwnProperty(v)&&(s[v]=aa[v]);function ha(){return x}function ia(a){x=a}\n function ja(a){switch(a){case \"i1\":case \"i8\":return 1;case \"i16\":return 2;case \"i32\":return 4;case \"i64\":return 8;case \"float\":return 4;case \"double\":return 8;default:if(\"*\"===a[a.length-1])return ka;if(\"i\"===a[0])return a=parseInt(a.substr(1)),A(0===a%8),a/8}}function la(a,b,c){c&&c.length?(c.splice||(c=Array.prototype.slice.call(c)),c.splice(0,0,b),s[\"dynCall_\"+a].apply(m,c)):s[\"dynCall_\"+a].call(m,b)}var ma;\n function na(){var a=[],b=0;this.za=function(c){c&=255;if(0==a.length){if(0==(c&128))return String.fromCharCode(c);a.push(c);b=192==(c&224)?1:224==(c&240)?2:3;return\"\"}if(b&&(a.push(c),b--,0<b))return\"\";var c=a[0],d=a[1],f=a[2],h=a[3];2==a.length?c=String.fromCharCode((c&31)<<6|d&63):3==a.length?c=String.fromCharCode((c&15)<<12|(d&63)<<6|f&63):(c=(c&7)<<18|(d&63)<<12|(f&63)<<6|h&63,c=String.fromCharCode(Math.floor((c-65536)/1024)+55296,(c-65536)%1024+56320));a.length=0;return c};this.Cb=function(a){for(var a=\n unescape(encodeURIComponent(a)),b=[],f=0;f<a.length;f++)b.push(a.charCodeAt(f));return b}}function oa(a){var b=x;x=x+a|0;x=x+7&-8;return b}function pa(a){var b=B;B=B+a|0;B=B+7&-8;return b}function qa(a){var b=D;D=D+a|0;D=D+7&-8;D>=ra&&E(\"Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value \"+ra+\", or (2) set Module.TOTAL_MEMORY before the program runs.\");return b}function sa(a,b){return Math.ceil(a/(b?b:8))*(b?b:8)}\n var ka=4,ta={},ua=p,va;function A(a,b){a||E(\"Assertion failed: \"+b)}s.ccall=function(a,b,c,d){return wa(xa(a),b,c,d)};function xa(a){try{var b=s[\"_\"+a];b||(b=eval(\"_\"+a))}catch(c){}A(b,\"Cannot call unknown function \"+a+\" (perhaps LLVM optimizations or closure removed it?)\");return b}\n function wa(a,b,c,d){function f(a,b){if(\"string\"==b){if(a===m||a===j||0===a)return 0;a=H(a);b=\"array\"}if(\"array\"==b){h||(h=ha());var c=oa(a.length);ya(a,c);return c}return a}var h=0,g=0,d=d?d.map(function(a){return f(a,c[g++])}):[];a=a.apply(m,d);\"string\"==b?b=za(a):(A(\"array\"!=b),b=a);h&&ia(h);return b}s.cwrap=function(a,b,c){var d=xa(a);return function(){return wa(d,b,c,Array.prototype.slice.call(arguments))}};\n function Aa(a,b,c){c=c||\"i8\";\"*\"===c.charAt(c.length-1)&&(c=\"i32\");switch(c){case \"i1\":I[a]=b;break;case \"i8\":I[a]=b;break;case \"i16\":J[a>>1]=b;break;case \"i32\":K[a>>2]=b;break;case \"i64\":va=[b>>>0,(tempDouble=b,1<=+Ba(tempDouble)?0<tempDouble?(Ca(+Da(tempDouble/4294967296),4294967295)|0)>>>0:~~+Ea((tempDouble-+(~~tempDouble>>>0))/4294967296)>>>0:0)];K[a>>2]=va[0];K[a+4>>2]=va[1];break;case \"float\":Fa[a>>2]=b;break;case \"double\":Ga[a>>3]=b;break;default:E(\"invalid type for setValue: \"+c)}}\n s.setValue=Aa;s.getValue=function(a,b){b=b||\"i8\";\"*\"===b.charAt(b.length-1)&&(b=\"i32\");switch(b){case \"i1\":return I[a];case \"i8\":return I[a];case \"i16\":return J[a>>1];case \"i32\":return K[a>>2];case \"i64\":return K[a>>2];case \"float\":return Fa[a>>2];case \"double\":return Ga[a>>3];default:E(\"invalid type for setValue: \"+b)}return m};var Ha=1,Ia=2,Ja=4;s.ALLOC_NORMAL=0;s.ALLOC_STACK=Ha;s.ALLOC_STATIC=Ia;s.ALLOC_DYNAMIC=3;s.ALLOC_NONE=Ja;\n function L(a,b,c,d){var f,h;\"number\"===typeof a?(f=l,h=a):(f=p,h=a.length);var g=\"string\"===typeof b?b:m,c=c==Ja?d:[Ka,oa,pa,qa][c===j?Ia:c](Math.max(h,g?1:b.length));if(f){d=c;A(0==(c&3));for(a=c+(h&-4);d<a;d+=4)K[d>>2]=0;for(a=c+h;d<a;)I[d++|0]=0;return c}if(\"i8\"===g)return a.subarray||a.slice?M.set(a,c):M.set(new Uint8Array(a),c),c;for(var d=0,i,r;d<h;){var t=a[d];\"function\"===typeof t&&(t=ta.Sd(t));f=g||b[d];0===f?d++:(\"i64\"==f&&(f=\"i32\"),Aa(c+d,t,f),r!==f&&(i=ja(f),r=f),d+=i)}return c}\n s.allocate=L;function za(a,b){for(var c=p,d,f=0;;){d=M[a+f|0];if(128<=d)c=l;else if(0==d&&!b)break;f++;if(b&&f==b)break}b||(b=f);var h=\"\";if(!c){for(;0<b;)d=String.fromCharCode.apply(String,M.subarray(a,a+Math.min(b,1024))),h=h?h+d:d,a+=1024,b-=1024;return h}c=new na;for(f=0;f<b;f++)d=M[a+f|0],h+=c.za(d);return h}s.Pointer_stringify=za;s.UTF16ToString=function(a){for(var b=0,c=\"\";;){var d=J[a+2*b>>1];if(0==d)return c;++b;c+=String.fromCharCode(d)}};\n s.stringToUTF16=function(a,b){for(var c=0;c<a.length;++c)J[b+2*c>>1]=a.charCodeAt(c);J[b+2*a.length>>1]=0};s.UTF32ToString=function(a){for(var b=0,c=\"\";;){var d=K[a+4*b>>2];if(0==d)return c;++b;65536<=d?(d-=65536,c+=String.fromCharCode(55296|d>>10,56320|d&1023)):c+=String.fromCharCode(d)}};s.stringToUTF32=function(a,b){for(var c=0,d=0;d<a.length;++d){var f=a.charCodeAt(d);if(55296<=f&&57343>=f)var h=a.charCodeAt(++d),f=65536+((f&1023)<<10)|h&1023;K[b+4*c>>2]=f;++c}K[b+4*c>>2]=0};\n function La(a){try{\"number\"===typeof a&&(a=za(a));if(\"_\"!==a[0]||\"_\"!==a[1]||\"Z\"!==a[2])return a;var b=3,c={v:\"void\",b:\"bool\",c:\"char\",s:\"short\",i:\"int\",l:\"long\",f:\"float\",d:\"double\",w:\"wchar_t\",a:\"signed char\",h:\"unsigned char\",t:\"unsigned short\",j:\"unsigned int\",m:\"unsigned long\",x:\"long long\",y:\"unsigned long long\",z:\"...\"},d=[],f=function(h,i,r){var i=i||Infinity,t=\"\",y=[],u;if(\"N\"!==a[b]){\"K\"===a[b]&&b++;var n=parseInt(a.substr(b));if(n){var F=n.toString().length;u=a.substr(b+F,n);b+=F+n}}else{b++;\n \"K\"===a[b]&&b++;for(u=[];\"E\"!==a[b];)if(\"S\"===a[b])b++,n=a.indexOf(\"_\",b),u.push(d[a.substring(b,n)||0]||\"?\"),b=n+1;else{n=parseInt(a.substr(b));F=n.toString().length;if(!n||!F){b--;break}var G=a.substr(b+F,n);u.push(G);d.push(G);b+=F+n}b++;u=u.join(\"::\");i--;if(0===i)return h?[u]:u}\"I\"===a[b]?(b++,n=f(l),F=f(l,1,l),t+=F[0]+\" \"+u+\"<\"+n.join(\", \")+\">\"):t=u;a:for(;b<a.length&&0<i--;)if(u=a[b++],u in c)y.push(c[u]);else switch(u){case \"P\":y.push(f(l,1,l)[0]+\"*\");break;case \"R\":y.push(f(l,1,l)[0]+\"&\");\n break;case \"L\":b++;n=a.indexOf(\"E\",b)-b;y.push(a.substr(b,n));b+=n+2;break;case \"A\":n=parseInt(a.substr(b));b+=n.toString().length;\"_\"!==a[b]&&e(\"?\");b++;y.push(f(l,1,l)[0]+\" [\"+n+\"]\");break;case \"E\":break a;default:t+=\"?\"+u;break a}!r&&(1===y.length&&\"void\"===y[0])&&(y=[]);return h?y:t+(\"(\"+y.join(\", \")+\")\")};return f()}catch(h){return a}}function Ma(){var a=Error().stack;return a?a.replace(/__Z[\\w\\d_]+/g,function(a){var c=La(a);return a===c?a:a+\" [\"+c+\"]\"}):\"(no stack trace available)\"}\n var I,M,J,Na,K,Oa,Fa,Ga,Qa=0,B=0,Ra=0,x=0,Sa=0,Ta=0,D=0,ra=s.TOTAL_MEMORY||16777216;A(\"undefined\"!==typeof Int32Array&&\"undefined\"!==typeof Float64Array&&!!(new Int32Array(1)).subarray&&!!(new Int32Array(1)).set,\"Cannot fallback to non-typed array case: Code is too specialized\");var N=new ArrayBuffer(ra);I=new Int8Array(N);J=new Int16Array(N);K=new Int32Array(N);M=new Uint8Array(N);Na=new Uint16Array(N);Oa=new Uint32Array(N);Fa=new Float32Array(N);Ga=new Float64Array(N);K[0]=255;\n A(255===M[0]&&0===M[3],\"Typed arrays 2 must be run on a little-endian system\");s.HEAP=j;s.HEAP8=I;s.HEAP16=J;s.HEAP32=K;s.HEAPU8=M;s.HEAPU16=Na;s.HEAPU32=Oa;s.HEAPF32=Fa;s.HEAPF64=Ga;function Ua(a){for(;0<a.length;){var b=a.shift();if(\"function\"==typeof b)b();else{var c=b.M;\"number\"===typeof c?b.ta===j?la(\"v\",c):la(\"vi\",c,[b.ta]):c(b.ta===j?m:b.ta)}}}var Va=[],O=[],Wa=[],Xa=[],Ya=[],Za=p;function $a(a){Va.unshift(a)}s.addOnPreRun=s.Id=$a;s.addOnInit=s.Fd=function(a){O.unshift(a)};\n s.addOnPreMain=s.Hd=function(a){Wa.unshift(a)};s.addOnExit=s.Ed=function(a){Xa.unshift(a)};function ab(a){Ya.unshift(a)}s.addOnPostRun=s.Gd=ab;function H(a,b,c){a=(new na).Cb(a);c&&(a.length=c);b||a.push(0);return a}s.intArrayFromString=H;s.intArrayToString=function(a){for(var b=[],c=0;c<a.length;c++){var d=a[c];255<d&&(d&=255);b.push(String.fromCharCode(d))}return b.join(\"\")};s.writeStringToMemory=function(a,b,c){a=H(a,c);for(c=0;c<a.length;)I[b+c|0]=a[c],c+=1};\n function ya(a,b){for(var c=0;c<a.length;c++)I[b+c|0]=a[c]}s.writeArrayToMemory=ya;s.writeAsciiToMemory=function(a,b,c){for(var d=0;d<a.length;d++)I[b+d|0]=a.charCodeAt(d);c||(I[b+a.length|0]=0)};function bb(a,b){return 0<=a?a:32>=b?2*Math.abs(1<<b-1)+a:Math.pow(2,b)+a}function cb(a,b){if(0>=a)return a;var c=32>=b?Math.abs(1<<b-1):Math.pow(2,b-1);if(a>=c&&(32>=b||a>c))a=-2*c+a;return a}Math.imul||(Math.imul=function(a,b){var c=a&65535,d=b&65535;return c*d+((a>>>16)*d+c*(b>>>16)<<16)|0});Math.Vd=Math.imul;\n var Ba=Math.abs,Ea=Math.ceil,Da=Math.floor,Ca=Math.min,Q=0,db={},eb=m,fb=m;function gb(a){Q++;s.monitorRunDependencies&&s.monitorRunDependencies(Q);a?(A(!db[a]),db[a]=1):s.P(\"warning: run dependency added without ID\")}s.addRunDependency=gb;function hb(a){Q--;s.monitorRunDependencies&&s.monitorRunDependencies(Q);a?(A(db[a]),delete db[a]):s.P(\"warning: run dependency removed without ID\");0==Q&&(eb!==m&&(clearInterval(eb),eb=m),fb&&(a=fb,fb=m,a()))}s.removeRunDependency=hb;s.preloadedImages={};\n s.preloadedAudios={};Qa=8;B=Qa+1376;O.push({M:function(){ib()}});\n L([109,95,108,111,111,107,117,112,91,116,93,32,61,61,32,99,85,73,78,84,51,50,95,77,65,88,0,0,0,0,0,0,116,32,60,32,40,49,85,32,60,60,32,116,97,98,108,101,95,98,105,116,115,41,0,0,112,67,111,100,101,115,105,122,101,115,91,115,121,109,95,105,110,100,101,120,93,32,61,61,32,99,111,100,101,115,105,122,101,0,0,0,0,0,0,0,115,111,114,116,101,100,95,112,111,115,32,60,32,116,111,116,97,108,95,117,115,101,100,95,115,121,109,115,0,0,0,0,110,117,109,95,99,111,100,101,115,91,99,93,0,0,0,0,110,101,119,95,99,97,112,\n 97,99,105,116,121,32,38,38,32,40,110,101,119,95,99,97,112,97,99,105,116,121,32,62,32,109,95,99,97,112,97,99,105,116,121,41,0,0,0,0,0,40,108,101,110,32,62,61,32,49,41,32,38,38,32,40,108,101,110,32,60,61,32,99,77,97,120,69,120,112,101,99,116,101,100,67,111,100,101,83,105,122,101,41,0,0,0,0,0,110,101,120,116,95,108,101,118,101,108,95,111,102,115,32,62,32,99,117,114,95,108,101,118,101,108,95,111,102,115,0,0,110,117,109,32,38,38,32,40,110,117,109,32,61,61,32,126,110,117,109,95,99,104,101,99,107,41,0,0,\n 0,0,0,0,105,32,60,32,109,95,115,105,122,101,0,0,0,0,0,0,109,105,110,95,110,101,119,95,99,97,112,97,99,105,116,121,32,60,32,40,48,120,55,70,70,70,48,48,48,48,85,32,47,32,101,108,101,109,101,110,116,95,115,105,122,101,41,0,109,111,100,101,108,46,109,95,99,111,100,101,95,115,105,122,101,115,91,115,121,109,93,32,61,61,32,108,101,110,0,0,116,32,33,61,32,99,85,73,78,84,51,50,95,77,65,88,0,0,0,0,0,0,0,0,109,95,98,105,116,95,99,111,117,110,116,32,60,61,32,99,66,105,116,66,117,102,83,105,122,101,0,0,0,0,0,\n 0,48,0,0,0,0,0,0,0,46,46,47,105,110,99,47,99,114,110,95,100,101,99,111,109,112,46,104,0,0,0,0,0,40,116,111,116,97,108,95,115,121,109,115,32,62,61,32,49,41,32,38,38,32,40,116,111,116,97,108,95,115,121,109,115,32,60,61,32,112,114,101,102,105,120,95,99,111,100,105,110,103,58,58,99,77,97,120,83,117,112,112,111,114,116,101,100,83,121,109,115,41,0,0,0,102,97,108,115,101,0,0,0,99,114,110,100,95,102,114,101,101,58,32,98,97,100,32,112,116,114,0,0,0,0,0,0,99,114,110,100,95,114,101,97,108,108,111,99,58,32,98,\n 97,100,32,112,116,114,0,0,0,40,40,117,105,110,116,51,50,41,112,95,110,101,119,32,38,32,40,67,82,78,68,95,77,73,78,95,65,76,76,79,67,95,65,76,73,71,78,77,69,78,84,32,45,32,49,41,41,32,61,61,32,48,0,0,0,99,114,110,100,95,109,97,108,108,111,99,58,32,111,117,116,32,111,102,32,109,101,109,111,114,121,0,0,0,0,0,0,99,114,110,100,95,109,97,108,108,111,99,58,32,115,105,122,101,32,116,111,111,32,98,105,103,0,0,0,0,0,0,0,109,95,115,105,122,101,32,60,61,32,109,95,99,97,112,97,99,105,116,121,0,0,0,0,37,115,40,\n 37,117,41,58,32,65,115,115,101,114,116,105,111,110,32,102,97,105,108,117,114,101,58,32,34,37,115,34,10,0,0,0,0,0,0,0,0,17,18,19,20,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15,16,0,0,0,1,2,2,3,3,3,3,4,0,0,0,0,0,0,1,1,0,1,0,1,0,0,1,2,1,2,0,0,0,1,0,2,1,0,2,0,0,1,2,3,0,2,3,4,5,6,7,1,0,2,3,1,0,0,0,0],\"i8\",Ja,8);var jb=sa(L(12,\"i8\",Ia),8);A(0==jb%8);s._strlen=kb;function lb(a){return 0>a||0===a&&-Infinity===1/a}\n function mb(a,b){function c(a){var c;\"double\"===a?c=Ga[b+f>>3]:\"i64\"==a?(c=[K[b+f>>2],K[b+(f+8)>>2]],f+=8):(a=\"i32\",c=K[b+f>>2]);f+=Math.max(Math.max(ja(a),ka),8);return c}for(var d=a,f=0,h=[],g,i;;){var r=d;g=I[d];if(0===g)break;i=I[d+1|0];if(37==g){var t=p,y=p,u=p,n=p,F=p;a:for(;;){switch(i){case 43:t=l;break;case 45:y=l;break;case 35:u=l;break;case 48:if(n)break a;else{n=l;break}case 32:F=l;break;default:break a}d++;i=I[d+1|0]}var G=0;if(42==i)G=c(\"i32\"),d++,i=I[d+1|0];else for(;48<=i&&57>=i;)G=\n 10*G+(i-48),d++,i=I[d+1|0];var P=p;if(46==i){var C=0,P=l;d++;i=I[d+1|0];if(42==i)C=c(\"i32\"),d++;else for(;;){i=I[d+1|0];if(48>i||57<i)break;C=10*C+(i-48);d++}i=I[d+1|0]}else C=6;var z;switch(String.fromCharCode(i)){case \"h\":i=I[d+2|0];104==i?(d++,z=1):z=2;break;case \"l\":i=I[d+2|0];108==i?(d++,z=8):z=4;break;case \"L\":case \"q\":case \"j\":z=8;break;case \"z\":case \"t\":case \"I\":z=4;break;default:z=m}z&&d++;i=I[d+1|0];switch(String.fromCharCode(i)){case \"d\":case \"i\":case \"u\":case \"o\":case \"x\":case \"X\":case \"p\":r=\n 100==i||105==i;z=z||4;g=c(\"i\"+8*z);var k;8==z&&(g=117==i?+(g[0]>>>0)+4294967296*+(g[1]>>>0):+(g[0]>>>0)+4294967296*+(g[1]|0));4>=z&&(g=(r?cb:bb)(g&Math.pow(256,z)-1,8*z));var T=Math.abs(g),r=\"\";if(100==i||105==i)k=cb(g,8*z).toString(10);else if(117==i)k=bb(g,8*z).toString(10),g=Math.abs(g);else if(111==i)k=(u?\"0\":\"\")+T.toString(8);else if(120==i||88==i){r=u&&0!=g?\"0x\":\"\";if(0>g){g=-g;k=(T-1).toString(16);T=[];for(u=0;u<k.length;u++)T.push((15-parseInt(k[u],16)).toString(16));for(k=T.join(\"\");k.length<\n 2*z;)k=\"f\"+k}else k=T.toString(16);88==i&&(r=r.toUpperCase(),k=k.toUpperCase())}else 112==i&&(0===T?k=\"(nil)\":(r=\"0x\",k=T.toString(16)));if(P)for(;k.length<C;)k=\"0\"+k;0<=g&&(t?r=\"+\"+r:F&&(r=\" \"+r));\"-\"==k.charAt(0)&&(r=\"-\"+r,k=k.substr(1));for(;r.length+k.length<G;)y?k+=\" \":n?k=\"0\"+k:r=\" \"+r;k=r+k;k.split(\"\").forEach(function(a){h.push(a.charCodeAt(0))});break;case \"f\":case \"F\":case \"e\":case \"E\":case \"g\":case \"G\":g=c(\"double\");if(isNaN(g))k=\"nan\",n=p;else if(isFinite(g)){P=p;z=Math.min(C,20);if(103==\n i||71==i)P=l,C=C||1,z=parseInt(g.toExponential(z).split(\"e\")[1],10),C>z&&-4<=z?(i=(103==i?\"f\":\"F\").charCodeAt(0),C-=z+1):(i=(103==i?\"e\":\"E\").charCodeAt(0),C--),z=Math.min(C,20);if(101==i||69==i)k=g.toExponential(z),/[eE][-+]\\d$/.test(k)&&(k=k.slice(0,-1)+\"0\"+k.slice(-1));else if(102==i||70==i)k=g.toFixed(z),0===g&&lb(g)&&(k=\"-\"+k);r=k.split(\"e\");if(P&&!u)for(;1<r[0].length&&-1!=r[0].indexOf(\".\")&&(\"0\"==r[0].slice(-1)||\".\"==r[0].slice(-1));)r[0]=r[0].slice(0,-1);else for(u&&-1==k.indexOf(\".\")&&(r[0]+=\n \".\");C>z++;)r[0]+=\"0\";k=r[0]+(1<r.length?\"e\"+r[1]:\"\");69==i&&(k=k.toUpperCase());0<=g&&(t?k=\"+\"+k:F&&(k=\" \"+k))}else k=(0>g?\"-\":\"\")+\"inf\",n=p;for(;k.length<G;)k=y?k+\" \":n&&(\"-\"==k[0]||\"+\"==k[0])?k[0]+\"0\"+k.slice(1):(n?\"0\":\" \")+k;97>i&&(k=k.toUpperCase());k.split(\"\").forEach(function(a){h.push(a.charCodeAt(0))});break;case \"s\":n=(t=c(\"i8*\"))?kb(t):6;P&&(n=Math.min(n,C));if(!y)for(;n<G--;)h.push(32);if(t)for(u=0;u<n;u++)h.push(M[t++|0]);else h=h.concat(H(\"(null)\".substr(0,n),l));if(y)for(;n<G--;)h.push(32);\n break;case \"c\":for(y&&h.push(c(\"i8\"));0<--G;)h.push(32);y||h.push(c(\"i8\"));break;case \"n\":y=c(\"i32*\");K[y>>2]=h.length;break;case \"%\":h.push(g);break;default:for(u=r;u<d+2;u++)h.push(I[u])}d+=2}else h.push(g),d+=1}return h}function nb(a,b,c,d){c=mb(c,d);d=b===j?c.length:Math.min(c.length,Math.max(b-1,0));if(0>a)var a=-a,f=Ka(d+1),a=K[a>>2]=f;for(f=0;f<d;f++)I[a+f|0]=c[f];if(d<b||b===j)I[a+f|0]=0;return c.length}\n var R={W:1,qa:2,qd:3,nc:4,L:5,Ga:6,Kb:7,Kc:8,ba:9,Yb:10,V:11,Ad:11,lb:12,eb:13,ic:14,Wc:15,Wb:16,Da:17,Bd:18,Ea:19,Xc:20,oa:21,u:22,Fc:23,kb:24,ad:25,xd:26,jc:27,Sc:28,sa:29,nd:30,yc:31,fd:32,fc:33,kd:34,Oc:42,lc:43,Zb:44,pc:45,qc:46,rc:47,xc:48,yd:49,Ic:50,oc:51,dc:35,Lc:37,Pb:52,Sb:53,Cd:54,Gc:55,Tb:56,Ub:57,ec:35,Vb:59,Uc:60,Jc:61,ud:62,Tc:63,Pc:64,Qc:65,md:66,Mc:67,Nb:68,rd:69,$b:70,gd:71,Ac:72,gc:73,Rb:74,bd:76,Qb:77,ld:78,sc:79,tc:80,wc:81,vc:82,uc:83,Vc:38,Fa:39,Bc:36,pa:40,ra:95,ed:96,cc:104,\n Hc:105,Ob:97,jd:91,Zc:88,Rc:92,od:108,bc:111,Lb:98,ac:103,Ec:101,Cc:100,vd:110,kc:112,hb:113,ib:115,fb:114,gb:89,zc:90,hd:93,pd:94,Mb:99,Dc:102,jb:106,ca:107,wd:109,zd:87,hc:122,sd:116,$c:95,Nc:123,mc:84,cd:75,Xb:125,Yc:131,dd:130,td:86},ob={\"0\":\"Success\",1:\"Not super-user\",2:\"No such file or directory\",3:\"No such process\",4:\"Interrupted system call\",5:\"I/O error\",6:\"No such device or address\",7:\"Arg list too long\",8:\"Exec format error\",9:\"Bad file number\",10:\"No children\",11:\"No more processes\",\n 12:\"Not enough core\",13:\"Permission denied\",14:\"Bad address\",15:\"Block device required\",16:\"Mount device busy\",17:\"File exists\",18:\"Cross-device link\",19:\"No such device\",20:\"Not a directory\",21:\"Is a directory\",22:\"Invalid argument\",23:\"Too many open files in system\",24:\"Too many open files\",25:\"Not a typewriter\",26:\"Text file busy\",27:\"File too large\",28:\"No space left on device\",29:\"Illegal seek\",30:\"Read only file system\",31:\"Too many links\",32:\"Broken pipe\",33:\"Math arg out of domain of func\",\n 34:\"Math result not representable\",35:\"File locking deadlock error\",36:\"File or path name too long\",37:\"No record locks available\",38:\"Function not implemented\",39:\"Directory not empty\",40:\"Too many symbolic links\",42:\"No message of desired type\",43:\"Identifier removed\",44:\"Channel number out of range\",45:\"Level 2 not synchronized\",46:\"Level 3 halted\",47:\"Level 3 reset\",48:\"Link number out of range\",49:\"Protocol driver not attached\",50:\"No CSI structure available\",51:\"Level 2 halted\",52:\"Invalid exchange\",\n 53:\"Invalid request descriptor\",54:\"Exchange full\",55:\"No anode\",56:\"Invalid request code\",57:\"Invalid slot\",59:\"Bad font file fmt\",60:\"Device not a stream\",61:\"No data (for no delay io)\",62:\"Timer expired\",63:\"Out of streams resources\",64:\"Machine is not on the network\",65:\"Package not installed\",66:\"The object is remote\",67:\"The link has been severed\",68:\"Advertise error\",69:\"Srmount error\",70:\"Communication error on send\",71:\"Protocol error\",72:\"Multihop attempted\",73:\"Cross mount point (not really error)\",\n 74:\"Trying to read unreadable message\",75:\"Value too large for defined data type\",76:\"Given log. name not unique\",77:\"f.d. invalid for this operation\",78:\"Remote address changed\",79:\"Can access a needed shared lib\",80:\"Accessing a corrupted shared lib\",81:\".lib section in a.out corrupted\",82:\"Attempting to link in too many libs\",83:\"Attempting to exec a shared library\",84:\"Illegal byte sequence\",86:\"Streams pipe error\",87:\"Too many users\",88:\"Socket operation on non-socket\",89:\"Destination address required\",\n 90:\"Message too long\",91:\"Protocol wrong type for socket\",92:\"Protocol not available\",93:\"Unknown protocol\",94:\"Socket type not supported\",95:\"Not supported\",96:\"Protocol family not supported\",97:\"Address family not supported by protocol family\",98:\"Address already in use\",99:\"Address not available\",100:\"Network interface is not configured\",101:\"Network is unreachable\",102:\"Connection reset by network\",103:\"Connection aborted\",104:\"Connection reset by peer\",105:\"No buffer space available\",106:\"Socket is already connected\",\n 107:\"Socket is not connected\",108:\"Can't send after socket shutdown\",109:\"Too many references\",110:\"Connection timed out\",111:\"Connection refused\",112:\"Host is down\",113:\"Host is unreachable\",114:\"Socket already connected\",115:\"Connection already in progress\",116:\"Stale file handle\",122:\"Quota exceeded\",123:\"No medium (in tape drive)\",125:\"Operation canceled\",130:\"Previous owner died\",131:\"State not recoverable\"},pb=0;function S(a){return K[pb>>2]=a}\n function qb(a){return/^(\\/?|)([\\s\\S]*?)((?:\\.{1,2}|[^\\/]+?|)(\\.[^.\\/]*|))(?:[\\/]*)$/.exec(a).slice(1)}function rb(a,b){for(var c=0,d=a.length-1;0<=d;d--){var f=a[d];\".\"===f?a.splice(d,1):\"..\"===f?(a.splice(d,1),c++):c&&(a.splice(d,1),c--)}if(b)for(;c--;c)a.unshift(\"..\");return a}function sb(a){var b=\"/\"===a.charAt(0),c=\"/\"===a.substr(-1),a=rb(a.split(\"/\").filter(function(a){return!!a}),!b).join(\"/\");!a&&!b&&(a=\".\");a&&c&&(a+=\"/\");return(b?\"/\":\"\")+a}\n function U(){var a=Array.prototype.slice.call(arguments,0);return sb(a.filter(function(a){\"string\"!==typeof a&&e(new TypeError(\"Arguments to path.join must be strings\"));return a}).join(\"/\"))}function tb(){for(var a=\"\",b=p,c=arguments.length-1;-1<=c&&!b;c--){var d=0<=c?arguments[c]:\"/\";\"string\"!==typeof d&&e(new TypeError(\"Arguments to path.resolve must be strings\"));d&&(a=d+\"/\"+a,b=\"/\"===d.charAt(0))}a=rb(a.split(\"/\").filter(function(a){return!!a}),!b).join(\"/\");return(b?\"/\":\"\")+a||\".\"}var ub=[];\n function vb(a,b){ub[a]={input:[],O:[],Z:b};wb[a]={k:xb}}\n var xb={open:function(a){var b=ub[a.g.ka];b||e(new V(R.Ea));a.B=b;a.seekable=p},close:function(a){a.B.O.length&&a.B.Z.ja(a.B,10)},K:function(a,b,c,d){(!a.B||!a.B.Z.Qa)&&e(new V(R.Ga));for(var f=0,h=0;h<d;h++){var g;try{g=a.B.Z.Qa(a.B)}catch(i){e(new V(R.L))}g===j&&0===f&&e(new V(R.V));if(g===m||g===j)break;f++;b[c+h]=g}f&&(a.g.timestamp=Date.now());return f},write:function(a,b,c,d){(!a.B||!a.B.Z.ja)&&e(new V(R.Ga));for(var f=0;f<d;f++)try{a.B.Z.ja(a.B,b[c+f])}catch(h){e(new V(R.L))}d&&(a.g.timestamp=\n Date.now());return f}},W={cb:1,na:2,bb:3,D:function(){return W.createNode(m,\"/\",16895,0)},createNode:function(a,b,c,d){(24576===(c&61440)||4096===(c&61440))&&e(new V(R.W));c=yb(a,b,c,d);16384===(c.mode&61440)?(c.n={J:W.n.J,A:W.n.A,wa:W.n.wa,Q:W.n.Q,Q:W.n.Q,rename:W.n.rename,ab:W.n.ab,Za:W.n.Za,Xa:W.n.Xa,ma:W.n.ma},c.k={N:W.k.N},c.o={}):32768===(c.mode&61440)?(c.n={J:W.n.J,A:W.n.A},c.k={N:W.k.N,K:W.k.K,write:W.k.write,Ja:W.k.Ja,Ta:W.k.Ta},c.o=[],c.ea=W.na):40960===(c.mode&61440)?(c.n={J:W.n.J,A:W.n.A,\n la:W.n.la},c.k={}):8192===(c.mode&61440)&&(c.n={J:W.n.J,A:W.n.A},c.k=zb);c.timestamp=Date.now();a&&(a.o[b]=c);return c},ua:function(a){a.ea!==W.na&&(a.o=Array.prototype.slice.call(a.o),a.ea=W.na)},n:{J:function(a){var b={};b.Qd=8192===(a.mode&61440)?a.id:1;b.Wd=a.id;b.mode=a.mode;b.ae=1;b.uid=0;b.Ud=0;b.ka=a.ka;b.size=16384===(a.mode&61440)?4096:32768===(a.mode&61440)?a.o.length:40960===(a.mode&61440)?a.link.length:0;b.Kd=new Date(a.timestamp);b.$d=new Date(a.timestamp);b.Pd=new Date(a.timestamp);\n b.pb=4096;b.Md=Math.ceil(b.size/b.pb);return b},A:function(a,b){b.mode!==j&&(a.mode=b.mode);b.timestamp!==j&&(a.timestamp=b.timestamp);if(b.size!==j){W.ua(a);var c=a.o;if(b.size<c.length)c.length=b.size;else for(;b.size>c.length;)c.push(0)}},wa:function(){e(new V(R.qa))},Q:function(a,b,c,d){return W.createNode(a,b,c,d)},rename:function(a,b,c){if(16384===(a.mode&61440)){var d;try{d=Ab(b,c)}catch(f){}if(d)for(var h in d.o)e(new V(R.Fa))}delete a.parent.o[a.name];a.name=c;b.o[c]=a;a.parent=b},ab:function(a,\n b){delete a.o[b]},Za:function(a,b){var c=Ab(a,b),d;for(d in c.o)e(new V(R.Fa));delete a.o[b]},Xa:function(a){var b=[\".\",\"..\"],c;for(c in a.o)a.o.hasOwnProperty(c)&&b.push(c);return b},ma:function(a,b,c){a=W.createNode(a,b,41471,0);a.link=c;return a},la:function(a){40960!==(a.mode&61440)&&e(new V(R.u));return a.link}},k:{K:function(a,b,c,d,f){a=a.g.o;if(f>=a.length)return 0;d=Math.min(a.length-f,d);A(0<=d);if(8<d&&a.subarray)b.set(a.subarray(f,f+d),c);else for(var h=0;h<d;h++)b[c+h]=a[f+h];return d},\n write:function(a,b,c,d,f,h){var g=a.g;g.timestamp=Date.now();a=g.o;if(d&&0===a.length&&0===f&&b.subarray)return A(b.length),h&&b.buffer===I.buffer&&0===c?(g.o=b,g.ea=W.cb):(g.o=new Uint8Array(b.subarray(c,c+d)),g.ea=W.bb),d;W.ua(g);for(a=g.o;a.length<f;)a.push(0);for(h=0;h<d;h++)a[f+h]=b[c+h];return d},N:function(a,b,c){1===c?b+=a.position:2===c&&32768===(a.g.mode&61440)&&(b+=a.g.o.length);0>b&&e(new V(R.u));a.Hb=[];return a.position=b},Ja:function(a,b,c){W.ua(a.g);a=a.g.o;for(b+=c;b>a.length;)a.push(0)},\n Ta:function(a,b,c,d,f,h,g){32768!==(a.g.mode&61440)&&e(new V(R.Ea));a=a.g.o;if(!(g&2)&&(a.buffer===b||a.buffer===b.buffer))f=p,d=a.byteOffset;else{if(0<f||f+d<a.length)a=a.subarray?a.subarray(f,f+d):Array.prototype.slice.call(a,f,f+d);f=l;(d=Ka(d))||e(new V(R.lb));b.set(a,d)}return{de:d,Jd:f}}}},Bb=L(1,\"i32*\",Ia),Cb=L(1,\"i32*\",Ia),Db=L(1,\"i32*\",Ia),Eb=m,Fb=[],wb=[m],X=[m],Gb=1,Hb=m,Ib=l,V=m;function Jb(a){a instanceof V||e(a+\" : \"+Ma());S(a.Na)}\n function Y(a,b){a=tb(\"/\",a);b=b||{Aa:0};8<b.Aa&&e(new V(R.pa));for(var c=rb(a.split(\"/\").filter(function(a){return!!a}),p),d=Eb,f=\"/\",h=0;h<c.length;h++){var g=h===c.length-1;if(g&&b.parent)break;d=Ab(d,c[h]);f=U(f,c[h]);d.Ab&&(d=d.D.root);if(!g||b.X)for(g=0;40960===(d.mode&61440);){d=Y(f,{X:p}).g;d.n.la||e(new V(R.u));var d=d.n.la(d),i=tb;var r=qb(f),f=r[0],r=r[1];!f&&!r?f=\".\":(r&&(r=r.substr(0,r.length-1)),f+=r);f=i(f,d);d=Y(f,{Aa:b.Aa}).g;40<g++&&e(new V(R.pa))}}return{path:f,g:d}}\n function Kb(a){for(var b;;){if(a===a.parent)return b?U(a.D.Ua,b):a.D.Ua;b=b?U(a.name,b):a.name;a=a.parent}}function Lb(a,b){for(var c=0,d=0;d<b.length;d++)c=(c<<5)-c+b.charCodeAt(d)|0;return(a+c>>>0)%Hb.length}function Ab(a,b){var c=Mb(a,\"x\");c&&e(new V(c));for(c=Hb[Lb(a.id,b)];c;c=c.Bb){var d=c.name;if(c.parent.id===a.id&&d===b)return c}return a.n.wa(a,b)}\n function yb(a,b,c,d){var f={id:Gb++,name:b,mode:c,n:{},k:{},ka:d,parent:m,D:m};a||(a=f);f.parent=a;f.D=a.D;Object.defineProperties(f,{K:{get:function(){return 365===(f.mode&365)},set:function(a){a?f.mode|=365:f.mode&=-366}},write:{get:function(){return 146===(f.mode&146)},set:function(a){a?f.mode|=146:f.mode&=-147}},yb:{get:function(){return 16384===(f.mode&61440)}},xb:{get:function(){return 8192===(f.mode&61440)}}});a=Lb(f.parent.id,f.name);f.Bb=Hb[a];return Hb[a]=f}\n var Nb={r:0,rs:1052672,\"r+\":2,w:577,wx:705,xw:705,\"w+\":578,\"wx+\":706,\"xw+\":706,a:1089,ax:1217,xa:1217,\"a+\":1090,\"ax+\":1218,\"xa+\":1218};function Ob(a){var b=Nb[a];\"undefined\"===typeof b&&e(Error(\"Unknown file open mode: \"+a));return b}function Mb(a,b){return Ib?0:-1!==b.indexOf(\"r\")&&!(a.mode&292)||-1!==b.indexOf(\"w\")&&!(a.mode&146)||-1!==b.indexOf(\"x\")&&!(a.mode&73)?R.eb:0}function Pb(a,b){try{return Ab(a,b),R.Da}catch(c){}return Mb(a,\"wx\")}\n function Qb(a,b,c){var d;a:{b=b||1;for(c=c||4096;b<=c;b++)if(!X[b]){d=b;break a}e(new V(R.kb))}a.C=d;Object.defineProperties(a,{object:{get:function(){return a.g},set:function(b){a.g=b}},Yd:{get:function(){return 1!==(a.I&2097155)}},Zd:{get:function(){return 0!==(a.I&2097155)}},Xd:{get:function(){return a.I&1024}}});return X[d]=a}var zb={open:function(a){a.k=wb[a.g.ka].k;a.k.open&&a.k.open(a)},N:function(){e(new V(R.sa))}};\n function Rb(a,b){var c;b&&(c=Y(b,{X:p}),b=c.path);var d={type:a,ce:{},Ua:b,root:m},f=a.D(d);f.D=d;d.root=f;c&&(c.g.D=d,c.g.Ab=l,\"/\"===b&&(Eb=d.root));Fb.push(d);return f}function Sb(a,b,c){var d=Y(a,{parent:l}).g,a=\"/\"===a?\"/\":qb(a)[2],f=Pb(d,a);f&&e(new V(f));d.n.Q||e(new V(R.W));return d.n.Q(d,a,b,c)}function Tb(a,b){b=(b!==j?b:438)&4095;b|=32768;return Sb(a,b,0)}function Ub(a,b){b=(b!==j?b:511)&1023;b|=16384;return Sb(a,b,0)}\n function Vb(a,b,c){\"undefined\"===typeof c&&(c=b,b=438);return Sb(a,b|8192,c)}function Wb(a,b){var c=Y(b,{parent:l}).g,d=\"/\"===b?\"/\":qb(b)[2],f=Pb(c,d);f&&e(new V(f));c.n.ma||e(new V(R.W));return c.n.ma(c,d,a)}function Xb(a,b){var c;c=\"string\"===typeof a?Y(a,{X:l}).g:a;c.n.A||e(new V(R.W));c.n.A(c,{mode:b&4095|c.mode&-4096,timestamp:Date.now()})}\n function Yb(a,b){var c,a=sb(a),b=\"string\"===typeof b?Ob(b):b;c=b&64?(\"undefined\"===typeof c?438:c)&4095|32768:0;var d;try{d=Y(a,{X:!(b&131072)}).g}catch(f){}b&64&&(d?b&128&&e(new V(R.Da)):d=Sb(a,c,0));d||e(new V(R.qa));8192===(d.mode&61440)&&(b&=-513);d?40960===(d.mode&61440)?c=R.pa:16384===(d.mode&61440)&&(0!==(b&2097155)||b&512)?c=R.oa:(c=[\"r\",\"w\",\"rw\"][b&2097155],b&512&&(c+=\"w\"),c=Mb(d,c)):c=R.qa;c&&e(new V(c));if(b&512){c=d;c=\"string\"===typeof c?Y(c,{X:l}).g:c;c.n.A||e(new V(R.W));16384===(c.mode&\n 61440)&&e(new V(R.oa));32768!==(c.mode&61440)&&e(new V(R.u));var h=Mb(c,\"w\");h&&e(new V(h));c.n.A(c,{size:0,timestamp:Date.now()})}b&=-641;d=Qb({g:d,path:Kb(d),I:b,seekable:l,position:0,k:d.k,Hb:[],error:p},j,j);d.k.open&&d.k.open(d);s.logReadFiles&&!(b&1)&&(Zb||(Zb={}),a in Zb||(Zb[a]=1,s.printErr(\"read file: \"+a)));return d}function $b(a){try{a.k.close&&a.k.close(a)}catch(b){e(b)}finally{X[a.C]=m}}\n function ac(a,b,c,d,f,h){(0>d||0>f)&&e(new V(R.u));0===(a.I&2097155)&&e(new V(R.ba));16384===(a.g.mode&61440)&&e(new V(R.oa));a.k.write||e(new V(R.u));var g=l;\"undefined\"===typeof f?(f=a.position,g=p):a.seekable||e(new V(R.sa));a.I&1024&&((!a.seekable||!a.k.N)&&e(new V(R.sa)),a.k.N(a,0,2));b=a.k.write(a,b,c,d,f,h);g||(a.position+=b);return b}function bc(){V||(V=function(a){this.Na=a;for(var b in R)if(R[b]===a){this.code=b;break}this.message=ob[a];this.stack=Ma()},V.prototype=Error())}var cc;\n function dc(a,b){var c=0;a&&(c|=365);b&&(c|=146);return c}function ec(a,b,c,d,f,h){a=b?U(\"string\"===typeof a?a:Kb(a),b):a;d=dc(d,f);f=Tb(a,d);if(c){if(\"string\"===typeof c){for(var b=Array(c.length),g=0,i=c.length;g<i;++g)b[g]=c.charCodeAt(g);c=b}Xb(a,d|146);b=Yb(a,\"w\");ac(b,c,0,c.length,0,h);$b(b);Xb(a,d)}return f}\n function fc(a,b,c,d){a=U(\"string\"===typeof a?a:Kb(a),b);b=dc(!!c,!!d);fc.Sa||(fc.Sa=64);var f;f=fc.Sa++<<8|0;wb[f]={k:{open:function(a){a.seekable=p},close:function(){d&&(d.buffer&&d.buffer.length)&&d(10)},K:function(a,b,d,f){for(var t=0,y=0;y<f;y++){var u;try{u=c()}catch(n){e(new V(R.L))}u===j&&0===t&&e(new V(R.V));if(u===m||u===j)break;t++;b[d+y]=u}t&&(a.g.timestamp=Date.now());return t},write:function(a,b,c,f){for(var t=0;t<f;t++)try{d(b[c+t])}catch(y){e(new V(R.L))}f&&(a.g.timestamp=Date.now());\n return t}}};return Vb(a,b,f)}function gc(a){if(a.xb||a.yb||a.link||a.o)return l;var b=l;\"undefined\"!==typeof XMLHttpRequest&&e(Error(\"Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.\"));if(s.read)try{a.o=H(s.read(a.url),l)}catch(c){b=p}else e(Error(\"Cannot load without read() or XMLHttpRequest.\"));b||S(R.L);return b}\n var Zb,Z={D:function(){return yb(m,\"/\",16895,0)},sb:function(a,b,c){c&&A(1==b==(6==c));a={tb:a,type:b,protocol:c,p:m,$:{},ya:[],R:[],T:Z.q};b=Z.ia();c=yb(Z.root,b,49152,0);c.S=a;b=Qb({path:b,g:c,I:Ob(\"r+\"),seekable:p,k:Z.k});a.$a=b;return a},ub:function(a){a=X[a];return!a||49152!==(a.g.mode&49152)?m:a.g.S},k:{Wa:function(a){a=a.g.S;return a.T.Wa(a)},Ra:function(a,b,c){a=a.g.S;return a.T.Ra(a,b,c)},K:function(a,b,c,d){a=a.g.S;d=a.T.Db(a,d);if(!d)return 0;b.set(d.buffer,c);return d.buffer.length},write:function(a,\n b,c,d){a=a.g.S;return a.T.Fb(a,b,c,d)},close:function(a){a=a.g.S;a.T.close(a)}},ia:function(){Z.ia.Ma||(Z.ia.Ma=0);return\"socket[\"+Z.ia.Ma++ +\"]\"},q:{fa:function(a,b,c){var d;\"object\"===typeof b&&(d=b,c=b=m);if(d)d.Ha?(b=d.Ha.ee,c=d.Ha.fe):((c=/ws[s]?:\\/\\/([^:]+):(\\d+)/.exec(d.url))||e(Error(\"WebSocket URL must be in the format ws(s)://address:port\")),b=c[1],c=parseInt(c[2],10));else try{d=new WebSocket(\"ws://\"+b+\":\"+c,w?{}:[\"binary\"]),d.binaryType=\"arraybuffer\"}catch(f){e(new V(R.hb))}b={F:b,port:c,\n e:d,ga:[]};Z.q.Ia(a,b);Z.q.wb(a,b);2===a.type&&\"undefined\"!==typeof a.U&&b.ga.push(new Uint8Array([255,255,255,255,112,111,114,116,(a.U&65280)>>8,a.U&255]));return b},ha:function(a,b,c){return a.$[b+\":\"+c]},Ia:function(a,b){a.$[b.F+\":\"+b.port]=b},Ya:function(a,b){delete a.$[b.F+\":\"+b.port]},wb:function(a,b){function c(c){A(\"string\"!==typeof c&&c.byteLength!==j);var c=new Uint8Array(c),d=f;f=p;d&&10===c.length&&255===c[0]&&255===c[1]&&255===c[2]&&255===c[3]&&112===c[4]&&111===c[5]&&114===c[6]&&116===\n c[7]?(c=c[8]<<8|c[9],Z.q.Ya(a,b),b.port=c,Z.q.Ia(a,b)):a.R.push({F:b.F,port:b.port,data:c})}function d(){try{for(var a=b.ga.shift();a;)b.e.send(a),a=b.ga.shift()}catch(c){b.e.close()}}var f=l;w?(b.e.Y(\"open\",d),b.e.Y(\"message\",function(a,b){b.Ld&&c((new Uint8Array(a)).buffer)}),b.e.Y(\"error\",q())):(b.e.onopen=d,b.e.onmessage=function(a){c(a.data)})},Wa:function(a){if(1===a.type&&a.p)return a.ya.length?65:0;var b=0,c=1===a.type?Z.q.ha(a,a.G,a.H):m;if(a.R.length||!c||c&&c.e.readyState===c.e.aa||c&&\n c.e.readyState===c.e.CLOSED)b|=65;if(!c||c&&c.e.readyState===c.e.OPEN)b|=4;if(c&&c.e.readyState===c.e.aa||c&&c.e.readyState===c.e.CLOSED)b|=16;return b},Ra:function(a,b,c){switch(b){case 21531:return b=0,a.R.length&&(b=a.R[0].data.length),K[c>>2]=b,0;default:return R.u}},close:function(a){if(a.p){try{a.p.close()}catch(b){}a.p=m}for(var c=Object.keys(a.$),d=0;d<c.length;d++){var f=a.$[c[d]];try{f.e.close()}catch(h){}Z.q.Ya(a,f)}return 0},bind:function(a,b,c){(\"undefined\"!==typeof a.Ca||\"undefined\"!==\n typeof a.U)&&e(new V(R.u));a.Ca=b;a.U=c||_mkport();if(2===a.type){a.p&&(a.p.close(),a.p=m);try{a.T.zb(a,0)}catch(d){d instanceof V||e(d),d.Na!==R.ra&&e(d)}}},Od:function(a,b,c){a.p&&e(new V(ERRNO_CODS.ra));if(\"undefined\"!==typeof a.G&&\"undefined\"!==typeof a.H){var d=Z.q.ha(a,a.G,a.H);d&&(d.e.readyState===d.e.CONNECTING&&e(new V(R.fb)),e(new V(R.jb)))}b=Z.q.fa(a,b,c);a.G=b.F;a.H=b.port;e(new V(R.ib))},zb:function(a){w||e(new V(R.ra));a.p&&e(new V(R.u));var b=require(\"ws\").Dd;a.p=new b({host:a.Ca,port:a.U});\n a.p.Y(\"connection\",function(b){if(1===a.type){var d=Z.sb(a.tb,a.type,a.protocol),b=Z.q.fa(d,b);d.G=b.F;d.H=b.port;a.ya.push(d)}else Z.q.fa(a,b)});a.p.Y(\"closed\",function(){a.p=m});a.p.Y(\"error\",q())},accept:function(a){a.p||e(new V(R.u));var b=a.ya.shift();b.$a.I=a.$a.I;return b},Td:function(a,b){var c,d;b?((a.G===j||a.H===j)&&e(new V(R.ca)),c=a.G,d=a.H):(c=a.Ca||0,d=a.U||0);return{F:c,port:d}},Fb:function(a,b,c,d,f,h){if(2===a.type){if(f===j||h===j)f=a.G,h=a.H;(f===j||h===j)&&e(new V(R.gb))}else f=\n a.G,h=a.H;var g=Z.q.ha(a,f,h);1===a.type&&((!g||g.e.readyState===g.e.aa||g.e.readyState===g.e.CLOSED)&&e(new V(R.ca)),g.e.readyState===g.e.CONNECTING&&e(new V(R.V)));b=b instanceof Array||b instanceof ArrayBuffer?b.slice(c,c+d):b.buffer.slice(b.byteOffset+c,b.byteOffset+c+d);if(2===a.type&&(!g||g.e.readyState!==g.e.OPEN)){if(!g||g.e.readyState===g.e.aa||g.e.readyState===g.e.CLOSED)g=Z.q.fa(a,f,h);g.ga.push(b);return d}try{return g.e.send(b),d}catch(i){e(new V(R.u))}},Db:function(a,b){1===a.type&&\n a.p&&e(new V(R.ca));var c=a.R.shift();if(!c){if(1===a.type){var d=Z.q.ha(a,a.G,a.H);if(d){if(d.e.readyState===d.e.aa||d.e.readyState===d.e.CLOSED)return m;e(new V(R.V))}e(new V(R.ca))}e(new V(R.V))}var d=c.data.byteLength||c.data.length,f=c.data.byteOffset||0,h=c.data.buffer||c.data,g=Math.min(b,d),i={buffer:new Uint8Array(h,f,g),F:c.F,port:c.port};1===a.type&&g<d&&(c.data=new Uint8Array(h,f+g,d-g),a.R.unshift(c));return i}}};\n function hc(a,b,c){a=X[a];if(!a)return S(R.ba),-1;try{return ac(a,I,b,c)}catch(d){return Jb(d),-1}}function ic(a,b,c,d){c*=b;if(0==c)return 0;a=hc(d,a,c);if(-1==a){if(b=X[d])b.error=l;return 0}return Math.floor(a/b)}function jc(a,b,c){c=mb(b,c);b=ha();a=ic(L(c,\"i8\",Ha),1,c.length,a);ia(b);return a}s._memset=kc;s._memcpy=lc;function mc(a){s.print(\"exit(\"+a+\") called\");s.exit(a)}\n function nc(a){nc.qb||(D=D+4095&-4096,nc.qb=l,A(qa),nc.ob=qa,qa=function(){E(\"cannot dynamically allocate, sbrk now has control\")});var b=D;0!=a&&nc.ob(a);return b}var oc=p,pc=p,qc=p,rc=p,sc=j,tc=j;function uc(a){return{jpg:\"image/jpeg\",jpeg:\"image/jpeg\",png:\"image/png\",bmp:\"image/bmp\",ogg:\"audio/ogg\",wav:\"audio/wav\",mp3:\"audio/mpeg\"}[a.substr(a.lastIndexOf(\".\")+1)]}var vc=[];function wc(){var a=s.canvas;vc.forEach(function(b){b(a.width,a.height)})}\n function xc(){var a=s.canvas;this.Jb=a.width;this.Ib=a.height;a.width=screen.width;a.height=screen.height;\"undefined\"!=typeof SDL&&(a=Oa[SDL.screen+0*ka>>2],K[SDL.screen+0*ka>>2]=a|8388608);wc()}function yc(){var a=s.canvas;a.width=this.Jb;a.height=this.Ib;\"undefined\"!=typeof SDL&&(a=Oa[SDL.screen+0*ka>>2],K[SDL.screen+0*ka>>2]=a&-8388609);wc()}var zc,Ac,Bc,Cc;bc();Hb=Array(4096);Eb=yb(m,\"/\",16895,0);Rb(W,\"/\");Ub(\"/tmp\");Ub(\"/dev\");wb[259]={k:{K:function(){return 0},write:function(){return 0}}};\n Vb(\"/dev/null\",259);vb(1280,{Qa:function(a){if(!a.input.length){var b=m;if(w){if(b=process.stdin.read(),!b){if(process.stdin._readableState&&process.stdin._readableState.ended)return m;return}}else\"undefined\"!=typeof window&&\"function\"==typeof window.prompt?(b=window.prompt(\"Input: \"),b!==m&&(b+=\"\\n\")):\"function\"==typeof readline&&(b=readline(),b!==m&&(b+=\"\\n\"));if(!b)return m;a.input=H(b,l)}return a.input.shift()},ja:function(a,b){b===m||10===b?(s.print(a.O.join(\"\")),a.O=[]):a.O.push(Dc.za(b))}});\n vb(1536,{ja:function(a,b){b===m||10===b?(s.printErr(a.O.join(\"\")),a.O=[]):a.O.push(Dc.za(b))}});Vb(\"/dev/tty\",1280);Vb(\"/dev/tty1\",1536);Ub(\"/dev/shm\");Ub(\"/dev/shm/tmp\");\n O.unshift({M:function(){if(!s.noFSInit&&!cc){A(!cc,\"FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)\");cc=l;bc();s.stdin=s.stdin;s.stdout=s.stdout;s.stderr=s.stderr;s.stdin?fc(\"/dev\",\"stdin\",s.stdin):Wb(\"/dev/tty\",\"/dev/stdin\");s.stdout?fc(\"/dev\",\"stdout\",m,s.stdout):Wb(\"/dev/tty\",\"/dev/stdout\");s.stderr?fc(\"/dev\",\"stderr\",m,s.stderr):Wb(\"/dev/tty1\",\"/dev/stderr\");var a=Yb(\"/dev/stdin\",\n \"r\");K[Bb>>2]=a.C;A(1===a.C,\"invalid handle for stdin (\"+a.C+\")\");a=Yb(\"/dev/stdout\",\"w\");K[Cb>>2]=a.C;A(2===a.C,\"invalid handle for stdout (\"+a.C+\")\");a=Yb(\"/dev/stderr\",\"w\");K[Db>>2]=a.C;A(3===a.C,\"invalid handle for stderr (\"+a.C+\")\")}}});Wa.push({M:function(){Ib=p}});Xa.push({M:function(){cc=p;for(var a=0;a<X.length;a++){var b=X[a];b&&$b(b)}}});s.FS_createFolder=function(a,b,c,d){a=U(\"string\"===typeof a?a:Kb(a),b);return Ub(a,dc(c,d))};\n s.FS_createPath=function(a,b){for(var a=\"string\"===typeof a?a:Kb(a),c=b.split(\"/\").reverse();c.length;){var d=c.pop();if(d){var f=U(a,d);try{Ub(f)}catch(h){}a=f}}return f};s.FS_createDataFile=ec;\n s.FS_createPreloadedFile=function(a,b,c,d,f,h,g,i,r){function t(){qc=document.pointerLockElement===n||document.mozPointerLockElement===n||document.webkitPointerLockElement===n}function y(c){function k(c){i||ec(a,b,c,d,f,r);h&&h();hb(\"cp \"+F)}var n=p;s.preloadPlugins.forEach(function(a){!n&&a.canHandle(F)&&(a.handle(c,F,k,function(){g&&g();hb(\"cp \"+F)}),n=l)});n||k(c)}s.preloadPlugins||(s.preloadPlugins=[]);if(!zc&&!ca){zc=l;try{new Blob,Ac=l}catch(u){Ac=p,console.log(\"warning: no blob constructor, cannot create blobs with mimetypes\")}Bc=\n \"undefined\"!=typeof MozBlobBuilder?MozBlobBuilder:\"undefined\"!=typeof WebKitBlobBuilder?WebKitBlobBuilder:!Ac?console.log(\"warning: no BlobBuilder\"):m;Cc=\"undefined\"!=typeof window?window.URL?window.URL:window.webkitURL:j;!s.Va&&\"undefined\"===typeof Cc&&(console.log(\"warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.\"),s.Va=l);s.preloadPlugins.push({canHandle:function(a){return!s.Va&&/\\.(jpg|jpeg|png|bmp)$/i.test(a)},handle:function(a,b,\n c,d){var f=m;if(Ac)try{f=new Blob([a],{type:uc(b)}),f.size!==a.length&&(f=new Blob([(new Uint8Array(a)).buffer],{type:uc(b)}))}catch(g){var h=\"Blob constructor present but fails: \"+g+\"; falling back to blob builder\";ma||(ma={});ma[h]||(ma[h]=1,s.P(h))}f||(f=new Bc,f.append((new Uint8Array(a)).buffer),f=f.getBlob());var i=Cc.createObjectURL(f),n=new Image;n.onload=function(){A(n.complete,\"Image \"+b+\" could not be decoded\");var d=document.createElement(\"canvas\");d.width=n.width;d.height=n.height;d.getContext(\"2d\").drawImage(n,\n 0,0);s.preloadedImages[b]=d;Cc.revokeObjectURL(i);c&&c(a)};n.onerror=function(){console.log(\"Image \"+i+\" could not be decoded\");d&&d()};n.src=i}});s.preloadPlugins.push({canHandle:function(a){return!s.be&&a.substr(-4)in{\".ogg\":1,\".wav\":1,\".mp3\":1}},handle:function(a,b,c,d){function f(d){h||(h=l,s.preloadedAudios[b]=d,c&&c(a))}function g(){h||(h=l,s.preloadedAudios[b]=new Audio,d&&d())}var h=p;if(Ac){try{var i=new Blob([a],{type:uc(b)})}catch(n){return g()}var i=Cc.createObjectURL(i),t=new Audio;t.addEventListener(\"canplaythrough\",\n function(){f(t)},p);t.onerror=function(){if(!h){console.log(\"warning: browser could not fully decode audio \"+b+\", trying slower base64 approach\");for(var c=\"\",d=0,g=0,i=0;i<a.length;i++){d=d<<8|a[i];for(g+=8;6<=g;)var n=d>>g-6&63,g=g-6,c=c+\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\"[n]}2==g?(c+=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\"[(d&3)<<4],c+=\"==\"):4==g&&(c+=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\"[(d&15)<<2],c+=\"=\");\n t.src=\"data:audio/x-\"+b.substr(-3)+\";base64,\"+c;f(t)}};t.src=i;setTimeout(function(){ua||f(t)},1E4)}else return g()}});var n=s.canvas;n.Ba=n.requestPointerLock||n.mozRequestPointerLock||n.webkitRequestPointerLock;n.Oa=document.exitPointerLock||document.mozExitPointerLock||document.webkitExitPointerLock||q();n.Oa=n.Oa.bind(document);document.addEventListener(\"pointerlockchange\",t,p);document.addEventListener(\"mozpointerlockchange\",t,p);document.addEventListener(\"webkitpointerlockchange\",t,p);s.elementPointerLock&&\n n.addEventListener(\"click\",function(a){!qc&&n.Ba&&(n.Ba(),a.preventDefault())},p)}var F=b?tb(U(a,b)):a;gb(\"cp \"+F);if(\"string\"==typeof c){var G=g,P=function(){G?G():e('Loading data file \"'+c+'\" failed.')},C=new XMLHttpRequest;C.open(\"GET\",c,l);C.responseType=\"arraybuffer\";C.onload=function(){if(200==C.status||0==C.status&&C.response){var a=C.response;A(a,'Loading data file \"'+c+'\" failed (no arrayBuffer).');a=new Uint8Array(a);y(a);hb(\"al \"+c)}else P()};C.onerror=P;C.send(m);gb(\"al \"+c)}else y(c)};\n s.FS_createLazyFile=function(a,b,c,d,f){var h,g;\"undefined\"!==typeof XMLHttpRequest?(ca||e(\"Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc\"),h=function(){this.va=p;this.da=[]},h.prototype.get=function(a){if(!(a>this.length-1||0>a)){var b=a%this.rb;return this.vb(Math.floor(a/this.rb))[b]}},h.prototype.Gb=function(a){this.vb=a},h.prototype.Ka=function(){var a=new XMLHttpRequest;a.open(\"HEAD\",c,p);a.send(m);200<=a.status&&300>a.status||\n 304===a.status||e(Error(\"Couldn't load \"+c+\". Status: \"+a.status));var b=Number(a.getResponseHeader(\"Content-length\")),d,f=1048576;if(!((d=a.getResponseHeader(\"Accept-Ranges\"))&&\"bytes\"===d))f=b;var g=this;g.Gb(function(a){var d=a*f,h=(a+1)*f-1,h=Math.min(h,b-1);if(\"undefined\"===typeof g.da[a]){var i=g.da;d>h&&e(Error(\"invalid range (\"+d+\", \"+h+\") or no bytes requested!\"));h>b-1&&e(Error(\"only \"+b+\" bytes available! programmer error!\"));var k=new XMLHttpRequest;k.open(\"GET\",c,p);b!==f&&k.setRequestHeader(\"Range\",\n \"bytes=\"+d+\"-\"+h);\"undefined\"!=typeof Uint8Array&&(k.responseType=\"arraybuffer\");k.overrideMimeType&&k.overrideMimeType(\"text/plain; charset=x-user-defined\");k.send(m);200<=k.status&&300>k.status||304===k.status||e(Error(\"Couldn't load \"+c+\". Status: \"+k.status));d=k.response!==j?new Uint8Array(k.response||[]):H(k.responseText||\"\",l);i[a]=d}\"undefined\"===typeof g.da[a]&&e(Error(\"doXHR failed!\"));return g.da[a]});this.nb=b;this.mb=f;this.va=l},h=new h,Object.defineProperty(h,\"length\",{get:function(){this.va||\n this.Ka();return this.nb}}),Object.defineProperty(h,\"chunkSize\",{get:function(){this.va||this.Ka();return this.mb}}),g=j):(g=c,h=j);var i,a=U(\"string\"===typeof a?a:Kb(a),b);i=Tb(a,dc(d,f));h?i.o=h:g&&(i.o=m,i.url=g);var r={};Object.keys(i.k).forEach(function(a){var b=i.k[a];r[a]=function(){gc(i)||e(new V(R.L));return b.apply(m,arguments)}});r.K=function(a,b,c,d,f){gc(i)||e(new V(R.L));a=a.g.o;if(f>=a.length)return 0;d=Math.min(a.length-f,d);A(0<=d);if(a.slice)for(var g=0;g<d;g++)b[c+g]=a[f+g];else for(g=\n 0;g<d;g++)b[c+g]=a.get(f+g);return d};i.k=r;return i};s.FS_createLink=function(a,b,c){a=U(\"string\"===typeof a?a:Kb(a),b);return Wb(c,a)};s.FS_createDevice=fc;pb=pa(4);K[pb>>2]=0;O.unshift({M:q()});Xa.push({M:q()});var Dc=new na;w&&(require(\"fs\"),process.platform.match(/^win/));O.push({M:function(){Z.root=Rb(Z,m)}});\n s.requestFullScreen=function(a,b){function c(){pc=p;(document.webkitFullScreenElement||document.webkitFullscreenElement||document.mozFullScreenElement||document.mozFullscreenElement||document.fullScreenElement||document.fullscreenElement)===d?(d.La=document.cancelFullScreen||document.mozCancelFullScreen||document.webkitCancelFullScreen,d.La=d.La.bind(document),sc&&d.Ba(),pc=l,tc&&xc()):tc&&yc();if(s.onFullScreen)s.onFullScreen(pc)}sc=a;tc=b;\"undefined\"===typeof sc&&(sc=l);\"undefined\"===typeof tc&&\n (tc=p);var d=s.canvas;rc||(rc=l,document.addEventListener(\"fullscreenchange\",c,p),document.addEventListener(\"mozfullscreenchange\",c,p),document.addEventListener(\"webkitfullscreenchange\",c,p));d.Eb=d.requestFullScreen||d.mozRequestFullScreen||(d.webkitRequestFullScreen?function(){d.webkitRequestFullScreen(Element.ALLOW_KEYBOARD_INPUT)}:m);d.Eb()};\n s.requestAnimationFrame=function(a){window.requestAnimationFrame||(window.requestAnimationFrame=window.requestAnimationFrame||window.mozRequestAnimationFrame||window.webkitRequestAnimationFrame||window.msRequestAnimationFrame||window.oRequestAnimationFrame||window.setTimeout);window.requestAnimationFrame(a)};s.setCanvasSize=function(a,b,c){var d=s.canvas;d.width=a;d.height=b;c||wc()};s.pauseMainLoop=q();s.resumeMainLoop=function(){oc&&(oc=p,m())};\n s.getUserMedia=function(){window.Pa||(window.Pa=navigator.getUserMedia||navigator.mozGetUserMedia);window.Pa(j)};Ra=x=sa(B);Sa=Ra+5242880;Ta=D=sa(Sa);A(Ta<ra);Ca=Math.min;\n var $=(function(global,env,buffer) {\n // EMSCRIPTEN_START_ASM\n \"use asm\";var a=new global.Int8Array(buffer);var b=new global.Int16Array(buffer);var c=new global.Int32Array(buffer);var d=new global.Uint8Array(buffer);var e=new global.Uint16Array(buffer);var f=new global.Uint32Array(buffer);var g=new global.Float32Array(buffer);var h=new global.Float64Array(buffer);var i=env.STACKTOP|0;var j=env.STACK_MAX|0;var k=env.tempDoublePtr|0;var l=env.ABORT|0;var m=+env.NaN;var n=+env.Infinity;var o=0;var p=0;var q=0;var r=0;var s=0,t=0,u=0,v=0,w=0.0,x=0,y=0,z=0,A=0.0;var B=0;var C=0;var D=0;var E=0;var F=0;var G=0;var H=0;var I=0;var J=0;var K=0;var L=global.Math.floor;var M=global.Math.abs;var N=global.Math.sqrt;var O=global.Math.pow;var P=global.Math.cos;var Q=global.Math.sin;var R=global.Math.tan;var S=global.Math.acos;var T=global.Math.asin;var U=global.Math.atan;var V=global.Math.atan2;var W=global.Math.exp;var X=global.Math.log;var Y=global.Math.ceil;var Z=global.Math.imul;var _=env.abort;var $=env.assert;var aa=env.asmPrintInt;var ab=env.asmPrintFloat;var ac=env.min;var ad=env.invoke_ii;var ae=env.invoke_v;var af=env.invoke_iii;var ag=env.invoke_vi;var ah=env._llvm_lifetime_end;var ai=env._snprintf;var aj=env._abort;var ak=env._fprintf;var al=env._printf;var am=env._fflush;var an=env.__reallyNegative;var ao=env._sysconf;var ap=env.___setErrNo;var aq=env._fwrite;var ar=env._send;var as=env._write;var at=env._exit;var au=env._sprintf;var av=env.__formatString;var aw=env.__ZSt9terminatev;var ax=env._pwrite;var ay=env._sbrk;var az=env.___errno_location;var aA=env.___gxx_personality_v0;var aB=env._llvm_lifetime_start;var aC=env._time;var aD=env.__exit;\n // EMSCRIPTEN_START_FUNCS\n function aI(a){a=a|0;var b=0;b=i;i=i+a|0;i=i+7&-8;return b|0}function aJ(){return i|0}function aK(a){a=a|0;i=a}function aL(a,b){a=a|0;b=b|0;if((o|0)==0){o=a;p=b}}function aM(b){b=b|0;a[k]=a[b];a[k+1|0]=a[b+1|0];a[k+2|0]=a[b+2|0];a[k+3|0]=a[b+3|0]}function aN(b){b=b|0;a[k]=a[b];a[k+1|0]=a[b+1|0];a[k+2|0]=a[b+2|0];a[k+3|0]=a[b+3|0];a[k+4|0]=a[b+4|0];a[k+5|0]=a[b+5|0];a[k+6|0]=a[b+6|0];a[k+7|0]=a[b+7|0]}function aO(a){a=a|0;B=a}function aP(a){a=a|0;C=a}function aQ(a){a=a|0;D=a}function aR(a){a=a|0;E=a}function aS(a){a=a|0;F=a}function aT(a){a=a|0;G=a}function aU(a){a=a|0;H=a}function aV(a){a=a|0;I=a}function aW(a){a=a|0;J=a}function aX(a){a=a|0;K=a}function aY(){}function aZ(a,b,d,e){a=a|0;b=b|0;d=d|0;e=e|0;var f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0;f=i;i=i+1032|0;g=f|0;h=f+512|0;j=f+520|0;k=a+8|0;if((c[a+4>>2]|0)>>>0>(c[k>>2]|0)>>>0){l=j|0;au(l|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2121,c[m+16>>2]=744,m)|0)|0;i=m;al(l|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}if((2147418112/(e>>>0)|0)>>>0<=b>>>0){l=j|0;au(l|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2122,c[m+16>>2]=328,m)|0)|0;i=m;al(l|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}l=c[k>>2]|0;if(l>>>0>=b>>>0){n=1;i=f;return n|0}do{if(d){o=b-1|0;if((b|0)!=0){if((o&b|0)==0){p=b;break}}q=o>>>16|o;o=q>>>8|q;q=o>>>4|o;o=q>>>2|q;p=(o>>>1|o)+1|0}else{p=b}}while(0);if(!((p|0)!=0&p>>>0>l>>>0)){l=j|0;au(l|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2131,c[m+16>>2]=152,m)|0)|0;i=m;al(l|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}l=Z(p,e)|0;j=a|0;a=c[j>>2]|0;if((a&7|0)!=0){b=g|0;au(b|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2500,c[m+16>>2]=600,m)|0)|0;i=m;al(b|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m;n=0;i=f;return n|0}if(l>>>0>2147418112){b=g|0;au(b|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2500,c[m+16>>2]=712,m)|0)|0;i=m;al(b|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m;n=0;i=f;return n|0}c[h>>2]=l;b=a$(a,l,h,1)|0;a=c[h>>2]|0;if((b&7|0)!=0){h=g|0;au(h|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2552,c[m+16>>2]=624,m)|0)|0;i=m;al(h|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}if((b|0)==0){n=0;i=f;return n|0}c[j>>2]=b;if(a>>>0>l>>>0){r=(a>>>0)/(e>>>0)|0}else{r=p}c[k>>2]=r;n=1;i=f;return n|0}function a_(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,j=0,k=0;b=i;i=i+512|0;d=b|0;e=a+3&-4;a=(e|0)==0?4:e;if(a>>>0>2147418112){e=d|0;au(e|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2500,c[f+16>>2]=712,f)|0)|0;i=f;al(e|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;g=0;i=b;return g|0}e=be(a)|0;do{if((e|0)!=0){h=c[e-4>>2]|0;j=h&3;if((j|0)==1){k=0}else{k=(h&-8)-((j|0)==0?8:4)|0}if(k>>>0<a>>>0){break}if((e&7|0)==0){g=e;i=b;return g|0}j=d|0;au(j|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2527,c[f+16>>2]=624,f)|0)|0;i=f;al(j|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;g=e;i=b;return g|0}}while(0);e=d|0;au(e|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2500,c[f+16>>2]=680,f)|0)|0;i=f;al(e|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;g=0;i=b;return g|0}function a$(a,b,d,e){a=a|0;b=b|0;d=d|0;e=e|0;var f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0;if((a|0)==0){f=be(b)|0;if((d|0)==0){g=f;return g|0}do{if((f|0)==0){h=0}else{i=c[f-4>>2]|0;j=i&3;if((j|0)==1){h=0;break}h=(i&-8)-((j|0)==0?8:4)|0}}while(0);c[d>>2]=h;g=f;return g|0}if((b|0)==0){bf(a);if((d|0)==0){g=0;return g|0}c[d>>2]=0;g=0;return g|0}f=bg(a,b)|0;h=(f|0)!=0;if(h|e^1){k=h?f:a;l=f}else{f=bg(a,b)|0;k=(f|0)==0?a:f;l=f}if((d|0)==0){g=l;return g|0}do{if((k|0)==0){m=0}else{f=c[k-4>>2]|0;a=f&3;if((a|0)==1){m=0;break}m=(f&-8)-((a|0)==0?8:4)|0}}while(0);c[d>>2]=m;g=l;return g|0}function a0(b,e,f){b=b|0;e=e|0;f=f|0;var g=0,h=0;if((b|0)==0|e>>>0<74|(f|0)==0){return}if((c[f>>2]|0)!=40){return}if(((d[b]|0)<<8|(d[b+1|0]|0)|0)!=18552){return}if(((d[b+2|0]|0)<<8|(d[b+3|0]|0))>>>0<74){return}g=((d[b+7|0]|0)<<16|(d[b+6|0]|0)<<24|(d[b+8|0]|0)<<8|(d[b+9|0]|0))>>>0>e>>>0?0:b;if((g|0)==0){return}c[f+4>>2]=(d[g+12|0]|0)<<8|(d[g+13|0]|0);c[f+8>>2]=(d[g+14|0]|0)<<8|(d[g+15|0]|0);c[f+12>>2]=d[g+16|0]|0;c[f+16>>2]=d[g+17|0]|0;b=g+18|0;e=f+32|0;c[e>>2]=d[b]|0;c[e+4>>2]=0;e=a[b]|0;if(e<<24>>24==0){h=8}else{h=e<<24>>24==9?8:16}c[f+20>>2]=h;c[f+24>>2]=(d[g+26|0]|0)<<16|(d[g+25|0]|0)<<24|(d[g+27|0]|0)<<8|(d[g+28|0]|0);c[f+28>>2]=(d[g+30|0]|0)<<16|(d[g+29|0]|0)<<24|(d[g+31|0]|0)<<8|(d[g+32|0]|0);return}function a1(b){b=b|0;var d=0,e=0,f=0,g=0,h=0;d=i;i=i+512|0;e=c[b+20>>2]|0;if((e|0)!=0){a2(e)}e=b+4|0;f=c[e>>2]|0;if((f|0)==0){g=b+16|0;a[g]=0;i=d;return}if((f&7|0)==0){bf(f)}else{f=d|0;au(f|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(f|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[e>>2]=0;c[b+8>>2]=0;c[b+12>>2]=0;g=b+16|0;a[g]=0;i=d;return}function a2(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,j=0,k=0,l=0;b=i;i=i+1536|0;d=b|0;e=b+512|0;f=b+1024|0;if((a|0)==0){i=b;return}g=c[a+168>>2]|0;do{if((g|0)!=0){h=c[g-4>>2]|0;j=g-8|0;if((h|0)==0){k=94}else{if((h|0)!=(~c[j>>2]|0)){k=94}}if((k|0)==94){h=d|0;au(h|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=645,c[l+16>>2]=280,l)|0)|0;i=l;al(h|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;if((j|0)==0){break}}if((j&7|0)!=0){h=d|0;au(h|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=2500,c[l+16>>2]=576,l)|0)|0;i=l;al(h|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;break}if((j|0)==0){be(0)|0;break}else{bf(j);break}}}while(0);d=c[a+176>>2]|0;do{if((d|0)!=0){g=c[d-4>>2]|0;j=d-8|0;if((g|0)==0){k=103}else{if((g|0)!=(~c[j>>2]|0)){k=103}}if((k|0)==103){g=f|0;au(g|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=645,c[l+16>>2]=280,l)|0)|0;i=l;al(g|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;if((j|0)==0){break}}if((j&7|0)!=0){g=f|0;au(g|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=2500,c[l+16>>2]=576,l)|0)|0;i=l;al(g|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;break}if((j|0)==0){be(0)|0;break}else{bf(j);break}}}while(0);if((a&7|0)==0){bf(a);i=b;return}else{a=e|0;au(a|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=2500,c[l+16>>2]=576,l)|0)|0;i=l;al(a|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;i=b;return}}function a3(f){f=f|0;var g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0;g=i;i=i+1232|0;h=g|0;j=g+512|0;k=g+576|0;l=g+648|0;m=g+720|0;n=f+8|0;o=c[n>>2]|0;if(!((o|0)!=0&o>>>0<8193)){p=m|0;au(p|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2998,c[q+16>>2]=496,q)|0)|0;i=q;al(p|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}p=f|0;c[p>>2]=o;r=f+20|0;s=c[r>>2]|0;if((s|0)==0){t=a_(180)|0;if((t|0)==0){u=0}else{bj(t+164|0,0,16);u=t}c[r>>2]=u;v=u;w=c[p>>2]|0}else{v=s;w=o}if((c[n>>2]|0)==0){n=m|0;au(n|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=904,c[q+16>>2]=312,q)|0)|0;i=q;al(n|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;x=c[p>>2]|0}else{x=w}p=c[f+4>>2]|0;if(x>>>0>16){f=x;n=0;while(1){y=n+1|0;if(f>>>0>3){f=f>>>1;n=y}else{break}}f=n+2+((y|0)!=32&1<<y>>>0<x>>>0&1)|0;z=f>>>0<11?f&255:11}else{z=0}if((w|0)==0|z>>>0>11){A=0;i=g;return A|0}c[v>>2]=w;bj(k|0,0,68);f=0;while(1){x=a[p+f|0]|0;if(x<<24>>24!=0){y=k+((x&255)<<2)|0;c[y>>2]=(c[y>>2]|0)+1}y=f+1|0;if(y>>>0<w>>>0){f=y}else{B=1;C=-1;D=0;E=0;F=0;break}}while(1){f=c[k+(B<<2)>>2]|0;if((f|0)==0){c[v+28+(B-1<<2)>>2]=0;G=F;H=E;I=D;J=C}else{y=B-1|0;c[j+(y<<2)>>2]=F;x=f+F|0;n=16-B|0;c[v+28+(y<<2)>>2]=(x-1<<n|(1<<n)-1)+1;c[v+96+(y<<2)>>2]=E;c[l+(B<<2)>>2]=E;G=x;H=f+E|0;I=D>>>0>B>>>0?D:B;J=C>>>0<B>>>0?C:B}f=B+1|0;if(f>>>0<17){B=f;C=J;D=I;E=H;F=G<<1}else{break}}c[v+4>>2]=H;G=v+172|0;do{if(H>>>0>(c[G>>2]|0)>>>0){c[G>>2]=H;F=H-1|0;if((H|0)==0){K=140}else{if((F&H|0)!=0){K=140}}if((K|0)==140){E=F>>>16|F;F=E>>>8|E;E=F>>>4|F;F=E>>>2|E;E=(F>>>1|F)+1|0;c[G>>2]=E>>>0>w>>>0?w:E}E=v+176|0;F=c[E>>2]|0;do{if((F|0)!=0){D=c[F-4>>2]|0;C=F-8|0;if((D|0)==0){K=144}else{if((D|0)!=(~c[C>>2]|0)){K=144}}if((K|0)==144){D=h|0;au(D|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=645,c[q+16>>2]=280,q)|0)|0;i=q;al(D|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;if((C|0)==0){break}}if((C&7|0)!=0){D=h|0;au(D|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2500,c[q+16>>2]=576,q)|0)|0;i=q;al(D|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;break}if((C|0)==0){be(0)|0;break}else{bf(C);break}}}while(0);F=c[G>>2]|0;C=(F|0)==0?1:F;F=a_((C<<1)+8|0)|0;if((F|0)==0){c[E>>2]=0;A=0;i=g;return A|0}else{D=F+8|0;c[F+4>>2]=C;c[F>>2]=~C;c[E>>2]=D;if((D|0)==0){A=0}else{L=E;break}i=g;return A|0}}else{L=v+176|0}}while(0);G=v+24|0;a[G]=J&255;a[v+25|0]=I&255;J=h|0;h=0;do{D=a[p+h|0]|0;C=D&255;if(D<<24>>24!=0){if((c[k+(C<<2)>>2]|0)==0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2274,c[q+16>>2]=136,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}D=l+(C<<2)|0;C=c[D>>2]|0;c[D>>2]=C+1;if(C>>>0>=H>>>0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2278,c[q+16>>2]=104,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}b[(c[L>>2]|0)+(C<<1)>>1]=h&65535}h=h+1|0;}while(h>>>0<w>>>0);w=a[G]|0;h=(w&255)>>>0<z>>>0?z:0;z=v+8|0;c[z>>2]=h;H=(h|0)!=0;if(H){l=1<<h;C=v+164|0;do{if(l>>>0>(c[C>>2]|0)>>>0){c[C>>2]=l;D=v+168|0;F=c[D>>2]|0;do{if((F|0)!=0){B=c[F-4>>2]|0;f=F-8|0;if((B|0)==0){K=169}else{if((B|0)!=(~c[f>>2]|0)){K=169}}if((K|0)==169){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=645,c[q+16>>2]=280,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;if((f|0)==0){break}}if((f&7|0)!=0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2500,c[q+16>>2]=576,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;break}if((f|0)==0){be(0)|0;break}else{bf(f);break}}}while(0);F=l<<2;E=a_(F+8|0)|0;if((E|0)==0){c[D>>2]=0;A=0;i=g;return A|0}else{f=E+8|0;B=f;c[E+4>>2]=l;c[E>>2]=~l;c[D>>2]=B;if((f|0)==0){A=0}else{M=B;N=F;break}i=g;return A|0}}else{M=c[v+168>>2]|0;N=l<<2}}while(0);K=v+168|0;bj(M|0,-1|0,N|0);N=1;do{do{if((c[k+(N<<2)>>2]|0)!=0){M=h-N|0;C=1<<M;F=N-1|0;B=c[j+(F<<2)>>2]|0;if(!((N|0)!=0&N>>>0<17)){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=1954,c[q+16>>2]=200,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}f=c[v+28+(F<<2)>>2]|0;if((f|0)==0){O=-1}else{O=(f-1|0)>>>((16-N|0)>>>0)}if(B>>>0>O>>>0){break}f=(c[v+96+(F<<2)>>2]|0)-B|0;F=N<<16;E=B;do{B=e[(c[L>>2]|0)+(f+E<<1)>>1]|0;if((d[p+B|0]|0|0)!=(N|0)){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2320,c[q+16>>2]=64,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}x=E<<M;y=B|F;B=0;do{n=B+x|0;if(n>>>0>=l>>>0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2326,c[q+16>>2]=40,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}m=c[K>>2]|0;if((c[m+(n<<2)>>2]|0)==-1){P=m}else{au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2328,c[q+16>>2]=8,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;P=c[K>>2]|0}c[P+(n<<2)>>2]=y;B=B+1|0;}while(B>>>0<C>>>0);E=E+1|0;}while(E>>>0<=O>>>0)}}while(0);N=N+1|0;}while(N>>>0<=h>>>0);Q=a[G]|0}else{Q=w}w=v+96|0;c[w>>2]=(c[w>>2]|0)-(c[j>>2]|0);w=v+100|0;c[w>>2]=(c[w>>2]|0)-(c[j+4>>2]|0);w=v+104|0;c[w>>2]=(c[w>>2]|0)-(c[j+8>>2]|0);w=v+108|0;c[w>>2]=(c[w>>2]|0)-(c[j+12>>2]|0);w=v+112|0;c[w>>2]=(c[w>>2]|0)-(c[j+16>>2]|0);w=v+116|0;c[w>>2]=(c[w>>2]|0)-(c[j+20>>2]|0);w=v+120|0;c[w>>2]=(c[w>>2]|0)-(c[j+24>>2]|0);w=v+124|0;c[w>>2]=(c[w>>2]|0)-(c[j+28>>2]|0);w=v+128|0;c[w>>2]=(c[w>>2]|0)-(c[j+32>>2]|0);w=v+132|0;c[w>>2]=(c[w>>2]|0)-(c[j+36>>2]|0);w=v+136|0;c[w>>2]=(c[w>>2]|0)-(c[j+40>>2]|0);w=v+140|0;c[w>>2]=(c[w>>2]|0)-(c[j+44>>2]|0);w=v+144|0;c[w>>2]=(c[w>>2]|0)-(c[j+48>>2]|0);w=v+148|0;c[w>>2]=(c[w>>2]|0)-(c[j+52>>2]|0);w=v+152|0;c[w>>2]=(c[w>>2]|0)-(c[j+56>>2]|0);w=v+156|0;c[w>>2]=(c[w>>2]|0)-(c[j+60>>2]|0);j=v+16|0;c[j>>2]=0;w=v+20|0;c[w>>2]=Q&255;L279:do{if(H){Q=h;while(1){if((Q|0)==0){break L279}R=Q-1|0;if((c[k+(Q<<2)>>2]|0)==0){Q=R}else{break}}c[j>>2]=c[v+28+(R<<2)>>2];Q=h+1|0;c[w>>2]=Q;G=Q;while(1){if(G>>>0>I>>>0){break L279}if((c[k+(G<<2)>>2]|0)==0){G=G+1|0}else{break}}c[w>>2]=G}}while(0);c[v+92>>2]=-1;c[v+160>>2]=1048575;c[v+12>>2]=32-(c[z>>2]|0);A=1;i=g;return A|0}function a4(b,e){b=b|0;e=e|0;var f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0,S=0,T=0,U=0,V=0,W=0,X=0,Y=0,Z=0,_=0,$=0,aa=0,ab=0,ac=0,ad=0,ae=0,af=0,ag=0,ah=0,ai=0,aj=0;f=i;i=i+4120|0;g=f+512|0;h=f+1024|0;j=f+1536|0;k=f+2048|0;l=f+2560|0;m=f+3072|0;n=f+3584|0;o=f+4096|0;p=b+20|0;q=c[p>>2]|0;if((q|0)<14){r=b+4|0;s=b+8|0;t=b+16|0;u=f|0;v=q;while(1){w=c[r>>2]|0;if((w|0)==(c[s>>2]|0)){x=0}else{c[r>>2]=w+1;x=d[w]|0}w=v+8|0;c[p>>2]=w;if((w|0)<33){y=w}else{au(u|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(u|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;y=c[p>>2]|0}w=x<<32-y|c[t>>2];c[t>>2]=w;if((y|0)<14){v=y}else{A=y;B=w;break}}}else{A=q;B=c[b+16>>2]|0}q=b+16|0;y=B>>>18;c[q>>2]=B<<14;c[p>>2]=A-14;if((y|0)==0){c[e>>2]=0;A=e+4|0;B=c[A>>2]|0;if((B|0)!=0){if((B&7|0)==0){bf(B)}else{B=n|0;au(B|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=2500,c[z+16>>2]=576,z)|0)|0;i=z;al(B|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}c[A>>2]=0;c[e+8>>2]=0;c[e+12>>2]=0}a[e+16|0]=0;A=e+20|0;B=c[A>>2]|0;if((B|0)==0){C=1;i=f;return C|0}a2(B);c[A>>2]=0;C=1;i=f;return C|0}A=e+4|0;B=e+8|0;v=c[B>>2]|0;if((v|0)!=(y|0)){if(v>>>0<=y>>>0){do{if((c[e+12>>2]|0)>>>0<y>>>0){if(aZ(A,y,(v+1|0)==(y|0),1)|0){D=c[B>>2]|0;break}a[e+16|0]=1;C=0;i=f;return C|0}else{D=v}}while(0);bj((c[A>>2]|0)+D|0,0,y-D|0)}c[B>>2]=y}D=A|0;bj(c[D>>2]|0,0,y|0);A=c[p>>2]|0;if((A|0)<5){v=b+4|0;t=b+8|0;x=m|0;m=A;while(1){u=c[v>>2]|0;if((u|0)==(c[t>>2]|0)){E=0}else{c[v>>2]=u+1;E=d[u]|0}u=m+8|0;c[p>>2]=u;if((u|0)<33){F=u}else{au(x|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(x|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;F=c[p>>2]|0}u=E<<32-F|c[q>>2];c[q>>2]=u;if((F|0)<5){m=F}else{G=F;H=u;break}}}else{G=A;H=c[q>>2]|0}A=H>>>27;c[q>>2]=H<<5;c[p>>2]=G-5;if((A|0)==0|H>>>0>2952790015){C=0;i=f;return C|0}c[o+20>>2]=0;bj(o|0,0,17);H=o+4|0;G=o+8|0;L345:do{if(aZ(H,21,0,1)|0){F=c[G>>2]|0;m=c[H>>2]|0;bj(m+F|0,0,21-F|0);c[G>>2]=21;F=b+4|0;E=b+8|0;x=l|0;v=0;do{t=c[p>>2]|0;if((t|0)<3){u=t;while(1){r=c[F>>2]|0;if((r|0)==(c[E>>2]|0)){I=0}else{c[F>>2]=r+1;I=d[r]|0}r=u+8|0;c[p>>2]=r;if((r|0)<33){J=r}else{au(x|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(x|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;J=c[p>>2]|0}r=I<<32-J|c[q>>2];c[q>>2]=r;if((J|0)<3){u=J}else{K=J;L=r;break}}}else{K=t;L=c[q>>2]|0}c[q>>2]=L<<3;c[p>>2]=K-3;a[m+(d[808+v|0]|0)|0]=L>>>29&255;v=v+1|0;}while(v>>>0<A>>>0);if(!(a3(o)|0)){M=0;break}v=n|0;m=h|0;x=g|0;u=k|0;r=j|0;s=0;L362:while(1){w=y-s|0;N=a5(b,o)|0;do{if(N>>>0<17){if((c[B>>2]|0)>>>0<=s>>>0){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=904,c[z+16>>2]=312,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}a[(c[D>>2]|0)+s|0]=N&255;O=s+1|0}else{if((N|0)==18){P=c[p>>2]|0;if((P|0)<7){Q=P;while(1){R=c[F>>2]|0;if((R|0)==(c[E>>2]|0)){S=0}else{c[F>>2]=R+1;S=d[R]|0}R=Q+8|0;c[p>>2]=R;if((R|0)<33){T=R}else{au(r|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(r|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;T=c[p>>2]|0}R=S<<32-T|c[q>>2];c[q>>2]=R;if((T|0)<7){Q=T}else{U=T;V=R;break}}}else{U=P;V=c[q>>2]|0}c[q>>2]=V<<7;c[p>>2]=U-7;Q=(V>>>25)+11|0;if(Q>>>0>w>>>0){M=0;break L345}O=Q+s|0;break}else if((N|0)==17){Q=c[p>>2]|0;if((Q|0)<3){R=Q;while(1){W=c[F>>2]|0;if((W|0)==(c[E>>2]|0)){X=0}else{c[F>>2]=W+1;X=d[W]|0}W=R+8|0;c[p>>2]=W;if((W|0)<33){Y=W}else{au(u|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(u|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;Y=c[p>>2]|0}W=X<<32-Y|c[q>>2];c[q>>2]=W;if((Y|0)<3){R=Y}else{Z=Y;_=W;break}}}else{Z=Q;_=c[q>>2]|0}c[q>>2]=_<<3;c[p>>2]=Z-3;R=(_>>>29)+3|0;if(R>>>0>w>>>0){M=0;break L345}O=R+s|0;break}else{if((N-19|0)>>>0>=2){$=306;break L362}R=c[p>>2]|0;if((N|0)==19){if((R|0)<2){P=R;while(1){W=c[F>>2]|0;if((W|0)==(c[E>>2]|0)){aa=0}else{c[F>>2]=W+1;aa=d[W]|0}W=P+8|0;c[p>>2]=W;if((W|0)<33){ab=W}else{au(m|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(m|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;ab=c[p>>2]|0}W=aa<<32-ab|c[q>>2];c[q>>2]=W;if((ab|0)<2){P=ab}else{ac=ab;ad=W;break}}}else{ac=R;ad=c[q>>2]|0}c[q>>2]=ad<<2;c[p>>2]=ac-2;ae=(ad>>>30)+3|0}else{if((R|0)<6){P=R;while(1){Q=c[F>>2]|0;if((Q|0)==(c[E>>2]|0)){af=0}else{c[F>>2]=Q+1;af=d[Q]|0}Q=P+8|0;c[p>>2]=Q;if((Q|0)<33){ag=Q}else{au(x|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(x|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;ag=c[p>>2]|0}Q=af<<32-ag|c[q>>2];c[q>>2]=Q;if((ag|0)<6){P=ag}else{ah=ag;ai=Q;break}}}else{ah=R;ai=c[q>>2]|0}c[q>>2]=ai<<6;c[p>>2]=ah-6;ae=(ai>>>26)+7|0}if((s|0)==0|ae>>>0>w>>>0){M=0;break L345}P=s-1|0;if((c[B>>2]|0)>>>0<=P>>>0){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=904,c[z+16>>2]=312,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}Q=a[(c[D>>2]|0)+P|0]|0;if(Q<<24>>24==0){M=0;break L345}P=ae+s|0;if(s>>>0<P>>>0){aj=s}else{O=s;break}while(1){if((c[B>>2]|0)>>>0<=aj>>>0){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=904,c[z+16>>2]=312,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}W=aj+1|0;a[(c[D>>2]|0)+aj|0]=Q;if(W>>>0<P>>>0){aj=W}else{O=P;break}}}}}while(0);if(O>>>0<y>>>0){s=O}else{break}}if(($|0)==306){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3141,c[z+16>>2]=464,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;M=0;break}if((O|0)!=(y|0)){M=0;break}M=a3(e)|0}else{a[o+16|0]=1;M=0}}while(0);a1(o);C=M;i=f;return C|0}function a5(a,b){a=a|0;b=b|0;var f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0;f=i;i=i+512|0;g=f|0;h=c[b+20>>2]|0;j=a+20|0;k=c[j>>2]|0;do{if((k|0)<24){l=a+4|0;m=c[l>>2]|0;n=c[a+8>>2]|0;o=m>>>0<n>>>0;if((k|0)>=16){if(o){c[l>>2]=m+1;p=d[m]|0}else{p=0}c[j>>2]=k+8;q=a+16|0;r=p<<24-k|c[q>>2];c[q>>2]=r;s=r;break}if(o){t=(d[m]|0)<<8;u=m+1|0}else{t=0;u=m}if(u>>>0<n>>>0){v=d[u]|0;w=u+1|0}else{v=0;w=u}c[l>>2]=w;c[j>>2]=k+16;l=a+16|0;n=(v|t)<<16-k|c[l>>2];c[l>>2]=n;s=n}else{s=c[a+16>>2]|0}}while(0);k=a+16|0;a=(s>>>16)+1|0;do{if(a>>>0>(c[h+16>>2]|0)>>>0){t=c[h+20>>2]|0;while(1){x=t-1|0;if(a>>>0>(c[h+28+(x<<2)>>2]|0)>>>0){t=t+1|0}else{break}}v=(c[h+96+(x<<2)>>2]|0)+(s>>>((32-t|0)>>>0))|0;if(v>>>0<(c[b>>2]|0)>>>0){y=t;z=e[(c[h+176>>2]|0)+(v<<1)>>1]|0;break}v=g|0;au(v|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=3267,c[A+16>>2]=464,A)|0)|0;i=A;al(v|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A;B=0;i=f;return B|0}else{v=c[(c[h+168>>2]|0)+(s>>>((32-(c[h+8>>2]|0)|0)>>>0)<<2)>>2]|0;if((v|0)==-1){w=g|0;au(w|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=3245,c[A+16>>2]=408,A)|0)|0;i=A;al(w|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A}w=v&65535;u=v>>>16;if((c[b+8>>2]|0)>>>0<=w>>>0){v=g|0;au(v|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=903,c[A+16>>2]=312,A)|0)|0;i=A;al(v|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A}if((d[(c[b+4>>2]|0)+w|0]|0|0)==(u|0)){y=u;z=w;break}v=g|0;au(v|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=3249,c[A+16>>2]=376,A)|0)|0;i=A;al(v|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A;y=u;z=w}}while(0);c[k>>2]=c[k>>2]<<y;c[j>>2]=(c[j>>2]|0)-y;B=z;i=f;return B|0}function a6(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+4>>2]|0}function a7(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+8>>2]|0}function a8(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+12>>2]|0}function a9(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+32>>2]|0}function ba(a,b){a=a|0;b=b|0;var d=0,e=0,f=0,g=0,h=0,j=0,k=0;d=i;i=i+552|0;e=d|0;f=d+512|0;c[f>>2]=40;a0(a,b,f);b=f+32|0;f=c[b>>2]|0;a=c[b+4>>2]|0;b=9;g=0;h=0;j=0;if((f|0)==1&(a|0)==0|(f|0)==2&(a|0)==0|(f|0)==7&(a|0)==0|(f|0)==8&(a|0)==0|(f|0)==3&(a|0)==0|(f|0)==4&(a|0)==0|(f|0)==5&(a|0)==0|(f|0)==6&(a|0)==0){k=16;i=d;return k|0}else if((f|0)==(h|0)&(a|0)==(j|0)|(f|0)==(b|0)&(a|0)==(g|0)){k=8;i=d;return k|0}else{g=e|0;au(g|0,768,(e=i,i=i+24|0,c[e>>2]=472,c[e+8>>2]=2664,c[e+16>>2]=568,e)|0)|0;i=e;al(g|0,(e=i,i=i+1|0,i=i+7&-8,c[e>>2]=0,e)|0)|0;i=e;k=0;i=d;return k|0}return 0}function bb(a,b,d){a=a|0;b=b|0;d=d|0;var e=0,f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0;e=i;i=i+552|0;f=e|0;g=e+512|0;c[g>>2]=40;a0(a,b,g);b=(((c[g+4>>2]|0)>>>(d>>>0))+3|0)>>>2;a=(((c[g+8>>2]|0)>>>(d>>>0))+3|0)>>>2;d=g+32|0;g=c[d>>2]|0;h=c[d+4>>2]|0;d=9;j=0;k=0;l=0;if((g|0)==1&(h|0)==0|(g|0)==2&(h|0)==0|(g|0)==7&(h|0)==0|(g|0)==8&(h|0)==0|(g|0)==3&(h|0)==0|(g|0)==4&(h|0)==0|(g|0)==5&(h|0)==0|(g|0)==6&(h|0)==0){m=16;n=Z(a,b)|0;o=Z(n,m)|0;i=e;return o|0}else if((g|0)==(k|0)&(h|0)==(l|0)|(g|0)==(d|0)&(h|0)==(j|0)){m=8;n=Z(a,b)|0;o=Z(n,m)|0;i=e;return o|0}else{j=f|0;au(j|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2664,c[f+16>>2]=568,f)|0)|0;i=f;al(j|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;m=0;n=Z(a,b)|0;o=Z(n,m)|0;i=e;return o|0}return 0}function bc(f,g,h,j,k,l){f=f|0;g=g|0;h=h|0;j=j|0;k=k|0;l=l|0;var m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0,S=0,T=0,U=0,V=0,W=0,X=0,Y=0,_=0,$=0,aa=0,ab=0,ac=0,ad=0,ae=0,af=0,ag=0,ah=0,ai=0,aj=0,ak=0,am=0,an=0,ao=0,ap=0,aq=0,ar=0,as=0,at=0,av=0,aw=0,ax=0,ay=0,az=0,aA=0,aB=0,aC=0,aD=0,aE=0,aF=0,aG=0,aH=0,aI=0,aJ=0,aK=0,aL=0,aM=0,aN=0,aO=0,aP=0,aQ=0,aR=0,aS=0,aT=0,aU=0,aV=0,aW=0,aX=0,aY=0,a$=0,a2=0,a3=0,a6=0,a7=0,a8=0,a9=0,ba=0,bb=0,bc=0,be=0,bg=0,bh=0,bi=0,bk=0,bl=0,bm=0,bn=0,bo=0,bp=0,bq=0,br=0,bs=0,bt=0,bu=0,bv=0,bw=0,bx=0,by=0,bz=0,bA=0,bB=0,bC=0,bD=0,bE=0,bF=0,bG=0,bH=0,bI=0,bJ=0,bK=0,bL=0,bM=0,bN=0,bO=0,bP=0,bQ=0,bR=0,bS=0,bT=0,bU=0,bV=0,bW=0,bX=0,bY=0,bZ=0,b_=0,b$=0,b0=0,b1=0,b2=0,b3=0,b4=0,b5=0,b6=0,b7=0,b8=0,b9=0,ca=0,cb=0,cc=0,cd=0,ce=0,cf=0,cg=0,ch=0,ci=0,cj=0,ck=0,cl=0,cm=0,cn=0,co=0,cp=0,cq=0,cr=0,cs=0;j=i;i=i+4008|0;m=j|0;n=j+16|0;o=j+32|0;p=j+56|0;q=j+960|0;r=j+1864|0;s=j+1888|0;t=j+1912|0;u=j+2112|0;v=j+2312|0;w=j+2376|0;x=j+2888|0;y=j+2936|0;z=j+3448|0;A=j+3960|0;B=j+4e3|0;c[A>>2]=40;a0(f,g,A);C=(c[A+4>>2]|0)>>>(k>>>0);D=(c[A+8>>2]|0)>>>(k>>>0);E=A+32|0;A=c[E>>2]|0;F=c[E+4>>2]|0;E=9;G=0;H=0;I=0;if((A|0)==1&(F|0)==0|(A|0)==2&(F|0)==0|(A|0)==7&(F|0)==0|(A|0)==8&(F|0)==0|(A|0)==3&(F|0)==0|(A|0)==4&(F|0)==0|(A|0)==5&(F|0)==0|(A|0)==6&(F|0)==0){J=16}else if((A|0)==(H|0)&(F|0)==(I|0)|(A|0)==(E|0)&(F|0)==(G|0)){J=8}else{G=z|0;au(G|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=2664,c[K+16>>2]=568,K)|0)|0;i=K;al(G|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;J=0}G=B|0;c[G>>2]=h;L502:do{if((f|0)==0|g>>>0<62){L=0}else{F=a_(300)|0;if((F|0)==0){L=0;break}E=F;c[F>>2]=519686845;A=F+4|0;c[A>>2]=0;I=F+8|0;c[I>>2]=0;H=F+88|0;bj(H|0,0,45);M=F+252|0;bj(M|0,0,13);N=F+268|0;bj(N|0,0,13);O=F+284|0;bj(O|0,0,13);bj(F+136|0,0,21);bj(F+160|0,0,21);bj(F+184|0,0,21);bj(F+208|0,0,21);bj(F+232|0,0,17);L505:do{if(g>>>0<74){P=369}else{if(((d[f]|0)<<8|(d[f+1|0]|0)|0)!=18552){P=369;break}if(((d[f+2|0]|0)<<8|(d[f+3|0]|0))>>>0<74){P=369;break}Q=((d[f+7|0]|0)<<16|(d[f+6|0]|0)<<24|(d[f+8|0]|0)<<8|(d[f+9|0]|0))>>>0>g>>>0?0:f;R=H;c[R>>2]=Q;if((Q|0)==0){break}c[A>>2]=f;c[I>>2]=g;S=F+92|0;T=S;U=(d[Q+68|0]|0)<<8|(d[Q+67|0]|0)<<16|(d[Q+69|0]|0);V=f+U|0;W=(d[Q+65|0]|0)<<8|(d[Q+66|0]|0);if((W|0)==0){break}Q=S;c[Q>>2]=V;S=F+96|0;c[S>>2]=V;V=F+104|0;c[V>>2]=W;X=F+100|0;c[X>>2]=f+(W+U);U=F+108|0;c[U>>2]=0;W=F+112|0;c[W>>2]=0;if(!(a4(T,F+116|0)|0)){break}Y=c[R>>2]|0;if(((d[Y+39|0]|0)<<8|(d[Y+40|0]|0)|0)==0){_=a[Y+55|0]|0;$=a[Y+56|0]|0;if(((_&255)<<8|$&255|0)==0){break}else{aa=_;ab=$;ac=Y}}else{if(!(a4(T,F+140|0)|0)){break}if(!(a4(T,F+188|0)|0)){break}Y=c[R>>2]|0;aa=a[Y+55|0]|0;ab=a[Y+56|0]|0;ac=Y}if(((aa&255)<<8|ab&255|0)==0){ad=ac}else{if(!(a4(T,F+164|0)|0)){break}if(!(a4(T,F+212|0)|0)){break}ad=c[R>>2]|0}Y=(d[ad+39|0]|0)<<8|(d[ad+40|0]|0);if((Y|0)==0){ae=ad}else{$=x;_=F+236|0;af=F+240|0;ag=c[af>>2]|0;if((ag|0)==(Y|0)){ah=ad}else{if(ag>>>0>Y>>>0){ai=ad}else{do{if((c[F+244>>2]|0)>>>0<Y>>>0){if(aZ(_,Y,(ag+1|0)==(Y|0),4)|0){aj=c[af>>2]|0;break}else{a[F+248|0]=1;break L505}}else{aj=ag}}while(0);bj((c[_>>2]|0)+(aj<<2)|0,0,Y-aj<<2|0);ai=c[R>>2]|0}c[af>>2]=Y;ah=ai}ag=c[A>>2]|0;ak=(d[ah+34|0]|0)<<8|(d[ah+33|0]|0)<<16|(d[ah+35|0]|0);am=ag+ak|0;an=(d[ah+37|0]|0)<<8|(d[ah+36|0]|0)<<16|(d[ah+38|0]|0);if((an|0)==0){break}c[Q>>2]=am;c[S>>2]=am;c[V>>2]=an;c[X>>2]=ag+(an+ak);c[U>>2]=0;c[W>>2]=0;ak=x|0;bj($|0,0,17);an=x+24|0;c[x+44>>2]=0;bj(x+20|0,0,21);ag=0;while(1){if(ag>>>0>=2){P=397;break}if(a4(T,x+(ag*24|0)|0)|0){ag=ag+1|0}else{ao=0;break}}if((P|0)==397){if((c[af>>2]|0)==0){ag=w|0;au(ag|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(ag|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}ag=0;$=0;am=0;ap=0;aq=0;ar=c[_>>2]|0;as=0;at=0;while(1){av=(a5(T,ak)|0)+at&31;aw=(a5(T,an)|0)+ag&63;ax=(a5(T,ak)|0)+$&31;ay=(a5(T,ak)|0)+am|0;az=(a5(T,an)|0)+ap&63;aA=(a5(T,ak)|0)+aq&31;c[ar>>2]=aw<<5|av<<11|ax|ay<<27|az<<21|aA<<16;aB=as+1|0;if(aB>>>0<Y>>>0){ag=aw;$=ax;am=ay&31;ap=az;aq=aA;ar=ar+4|0;as=aB;at=av}else{ao=1;break}}}a1(an);a1(ak);if(!ao){break}at=v;as=c[R>>2]|0;ar=(d[as+47|0]|0)<<8|(d[as+48|0]|0);aq=c[A>>2]|0;ap=(d[as+42|0]|0)<<8|(d[as+41|0]|0)<<16|(d[as+43|0]|0);am=aq+ap|0;$=(d[as+45|0]|0)<<8|(d[as+44|0]|0)<<16|(d[as+46|0]|0);if(($|0)==0){break}c[Q>>2]=am;c[S>>2]=am;c[V>>2]=$;c[X>>2]=aq+($+ap);c[U>>2]=0;c[W>>2]=0;c[s+20>>2]=0;bj(s|0,0,17);if(a4(T,s)|0){aC=-3;aD=-3;aE=0}else{a1(s);break}while(1){c[t+(aE<<2)>>2]=aC;c[u+(aE<<2)>>2]=aD;ap=aC+1|0;$=(ap|0)>3;aq=aE+1|0;if(aq>>>0<49){aC=$?-3:ap;aD=($&1)+aD|0;aE=aq}else{break}}bj(at|0,0,64);ak=F+256|0;an=c[ak>>2]|0;if((an|0)!=(ar|0)){if(an>>>0<=ar>>>0){do{if((c[F+260>>2]|0)>>>0<ar>>>0){if(aZ(M,ar,(an+1|0)==(ar|0),4)|0){aF=c[ak>>2]|0;break}else{a[F+264|0]=1;a1(s);break L505}}else{aF=an}}while(0);bj((c[M>>2]|0)+(aF<<2)|0,0,ar-aF<<2|0)}c[ak>>2]=ar}if((ar|0)==0){an=w|0;au(an|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(an|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}else{an=v|0;at=v+4|0;aq=v+8|0;$=v+12|0;ap=v+16|0;am=v+20|0;as=v+24|0;ag=v+28|0;Y=v+32|0;_=v+36|0;af=v+40|0;av=v+44|0;aB=v+48|0;aA=v+52|0;az=v+56|0;ay=v+60|0;ax=c[M>>2]|0;aw=0;while(1){aG=0;do{aH=a5(T,s)|0;aI=aG<<1;aJ=v+(aI<<2)|0;c[aJ>>2]=(c[aJ>>2]|0)+(c[t+(aH<<2)>>2]|0)&3;aJ=v+((aI|1)<<2)|0;c[aJ>>2]=(c[aJ>>2]|0)+(c[u+(aH<<2)>>2]|0)&3;aG=aG+1|0;}while(aG>>>0<8);c[ax>>2]=(d[880+(c[at>>2]|0)|0]|0)<<2|(d[880+(c[an>>2]|0)|0]|0)|(d[880+(c[aq>>2]|0)|0]|0)<<4|(d[880+(c[$>>2]|0)|0]|0)<<6|(d[880+(c[ap>>2]|0)|0]|0)<<8|(d[880+(c[am>>2]|0)|0]|0)<<10|(d[880+(c[as>>2]|0)|0]|0)<<12|(d[880+(c[ag>>2]|0)|0]|0)<<14|(d[880+(c[Y>>2]|0)|0]|0)<<16|(d[880+(c[_>>2]|0)|0]|0)<<18|(d[880+(c[af>>2]|0)|0]|0)<<20|(d[880+(c[av>>2]|0)|0]|0)<<22|(d[880+(c[aB>>2]|0)|0]|0)<<24|(d[880+(c[aA>>2]|0)|0]|0)<<26|(d[880+(c[az>>2]|0)|0]|0)<<28|(d[880+(c[ay>>2]|0)|0]|0)<<30;aG=aw+1|0;if(aG>>>0<ar>>>0){ax=ax+4|0;aw=aG}else{break}}}a1(s);ae=c[R>>2]|0}aw=(d[ae+55|0]|0)<<8|(d[ae+56|0]|0);if((aw|0)==0){L=F;break L502}ax=c[A>>2]|0;ar=(d[ae+50|0]|0)<<8|(d[ae+49|0]|0)<<16|(d[ae+51|0]|0);ay=ax+ar|0;az=(d[ae+53|0]|0)<<8|(d[ae+52|0]|0)<<16|(d[ae+54|0]|0);if((az|0)==0){break}c[Q>>2]=ay;c[S>>2]=ay;c[V>>2]=az;c[X>>2]=ax+(az+ar);c[U>>2]=0;c[W>>2]=0;c[r+20>>2]=0;bj(r|0,0,17);L585:do{if(a4(T,r)|0){ar=F+272|0;az=c[ar>>2]|0;if((az|0)!=(aw|0)){if(az>>>0<=aw>>>0){do{if((c[F+276>>2]|0)>>>0<aw>>>0){if(aZ(N,aw,(az+1|0)==(aw|0),2)|0){aK=c[ar>>2]|0;break}else{a[F+280|0]=1;break L585}}else{aK=az}}while(0);bj((c[N>>2]|0)+(aK<<1)|0,0,aw-aK<<1|0)}c[ar>>2]=aw}az=c[N>>2]|0;ax=0;ay=0;aA=0;while(1){aB=a5(T,r)|0;av=aB+ax&255;aB=(a5(T,r)|0)+ay&255;b[az>>1]=(aB<<8|av)&65535;af=aA+1|0;if(af>>>0<aw>>>0){az=az+2|0;ax=av;ay=aB;aA=af}else{break}}a1(r);aA=v;ay=c[R>>2]|0;ax=(d[ay+63|0]|0)<<8|(d[ay+64|0]|0);az=c[A>>2]|0;ar=(d[ay+58|0]|0)<<8|(d[ay+57|0]|0)<<16|(d[ay+59|0]|0);af=az+ar|0;aB=(d[ay+61|0]|0)<<8|(d[ay+60|0]|0)<<16|(d[ay+62|0]|0);if((aB|0)==0){aL=0}else{c[Q>>2]=af;c[S>>2]=af;c[V>>2]=aB;c[X>>2]=az+(aB+ar);c[U>>2]=0;c[W>>2]=0;c[o+20>>2]=0;bj(o|0,0,17);L605:do{if(a4(T,o)|0){ar=-7;aB=-7;az=0;while(1){c[p+(az<<2)>>2]=ar;c[q+(az<<2)>>2]=aB;af=ar+1|0;ay=(af|0)>7;av=az+1|0;if(av>>>0<225){ar=ay?-7:af;aB=(ay&1)+aB|0;az=av}else{break}}bj(aA|0,0,64);az=ax*3|0;aB=F+288|0;ar=c[aB>>2]|0;if((ar|0)!=(az|0)){if(ar>>>0<=az>>>0){do{if((c[F+292>>2]|0)>>>0<az>>>0){if(aZ(O,az,(ar+1|0)==(az|0),2)|0){aM=c[aB>>2]|0;break}else{a[F+296|0]=1;aN=0;break L605}}else{aM=ar}}while(0);bj((c[O>>2]|0)+(aM<<1)|0,0,az-aM<<1|0)}c[aB>>2]=az}if((az|0)==0){ar=w|0;au(ar|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(ar|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}if((ax|0)==0){aN=1;break}ar=v|0;av=v+4|0;ay=v+8|0;af=v+12|0;_=v+16|0;Y=v+20|0;ag=v+24|0;as=v+28|0;am=v+32|0;ap=v+36|0;$=v+40|0;aq=v+44|0;an=v+48|0;at=v+52|0;ak=v+56|0;aG=v+60|0;aH=c[O>>2]|0;aJ=0;while(1){aI=0;do{aO=a5(T,o)|0;aP=aI<<1;aQ=v+(aP<<2)|0;c[aQ>>2]=(c[aQ>>2]|0)+(c[p+(aO<<2)>>2]|0)&7;aQ=v+((aP|1)<<2)|0;c[aQ>>2]=(c[aQ>>2]|0)+(c[q+(aO<<2)>>2]|0)&7;aI=aI+1|0;}while(aI>>>0<8);b[aH>>1]=(d[872+(c[av>>2]|0)|0]|0)<<3|(d[872+(c[ar>>2]|0)|0]|0)|(d[872+(c[ay>>2]|0)|0]|0)<<6|(d[872+(c[af>>2]|0)|0]|0)<<9|(d[872+(c[_>>2]|0)|0]|0)<<12|(d[872+(c[Y>>2]|0)|0]|0)<<15;b[aH+2>>1]=(d[872+(c[ag>>2]|0)|0]|0)<<2|(a[872+(c[Y>>2]|0)|0]&255)>>>1|(d[872+(c[as>>2]|0)|0]|0)<<5|(d[872+(c[am>>2]|0)|0]|0)<<8|(d[872+(c[ap>>2]|0)|0]|0)<<11|(d[872+(c[$>>2]|0)|0]|0)<<14;b[aH+4>>1]=(d[872+(c[aq>>2]|0)|0]|0)<<1|(a[872+(c[$>>2]|0)|0]&255)>>>2|(d[872+(c[an>>2]|0)|0]|0)<<4|(d[872+(c[at>>2]|0)|0]|0)<<7|(d[872+(c[ak>>2]|0)|0]|0)<<10|(d[872+(c[aG>>2]|0)|0]|0)<<13;aI=aJ+1|0;if(aI>>>0<ax>>>0){aH=aH+6|0;aJ=aI}else{aN=1;break}}}else{aN=0}}while(0);a1(o);aL=aN}if(aL){L=aL?F:0;break L502}else{break L505}}}while(0);a1(r)}}while(0);if((P|0)==369){c[H>>2]=0}bd(E);if((F&7|0)==0){bf(F);L=0;break}else{O=y|0;au(O|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=2500,c[K+16>>2]=576,K)|0)|0;i=K;al(O|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;L=0;break}}}while(0);r=l+k|0;do{if(r>>>0>k>>>0){l=L;if((L|0)==0){aL=k;aN=D;o=C;q=h;while(1){aR=q+(Z(Z((o+3|0)>>>2,J)|0,(aN+3|0)>>>2)|0)|0;v=aL+1|0;if(v>>>0<r>>>0){aL=v;aN=aN>>>1;o=o>>>1;q=aR}else{break}}c[G>>2]=aR;break}q=L+88|0;o=L+8|0;aN=L+4|0;aL=L+92|0;F=aL;E=L+96|0;H=L+104|0;v=L+100|0;p=L+108|0;aM=L+112|0;aK=L+240|0;ae=L+256|0;s=aL;aL=L+116|0;u=L+140|0;t=L+236|0;aF=w|0;aE=L+188|0;aD=L+252|0;aC=L+272|0;ao=L+212|0;x=L+288|0;ah=L+284|0;ai=L+164|0;aj=L+268|0;ad=y|0;ac=k;ab=D;aa=C;f=h;while(1){g=Z((aa+3|0)>>>2,J)|0;O=Z(g,(ab+3|0)>>>2)|0;do{if(O>>>0<8|ac>>>0>15){aS=f}else{if((c[l>>2]|0)!=519686845){aS=f;break}A=c[q>>2]|0;N=(d[A+70+(ac<<2)+1|0]|0)<<16|(d[A+70+(ac<<2)|0]|0)<<24|(d[A+70+(ac<<2)+2|0]|0)<<8|(d[A+70+(ac<<2)+3|0]|0);M=ac+1|0;if(M>>>0<(d[A+16|0]|0)>>>0){aT=(d[A+70+(M<<2)+1|0]|0)<<16|(d[A+70+(M<<2)|0]|0)<<24|(d[A+70+(M<<2)+2|0]|0)<<8|(d[A+70+(M<<2)+3|0]|0)}else{aT=c[o>>2]|0}if(aT>>>0>N>>>0){aU=A}else{au(ad|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=3705,c[K+16>>2]=248,K)|0)|0;i=K;al(ad|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;aU=c[q>>2]|0}A=c[aN>>2]|0;M=A+N|0;I=aT-N|0;T=((d[aU+12|0]|0)<<8|(d[aU+13|0]|0))>>>(ac>>>0);W=((d[aU+14|0]|0)<<8|(d[aU+15|0]|0))>>>(ac>>>0);U=T>>>0>1?(T+3|0)>>>2:1;T=W>>>0>1?(W+3|0)>>>2:1;W=aU+18|0;X=a[W]|0;if(X<<24>>24==0){aV=8}else{aV=X<<24>>24==9?8:16}X=Z(aV,U)|0;if((g|0)==0){aW=X;P=494}else{if(X>>>0<=g>>>0){aW=g;P=494}}L663:do{if((P|0)==494){P=0;if((Z(aW,T)|0)>>>0>O>>>0){break}X=(U+1|0)>>>1;V=(T+1|0)>>>1;if((aT|0)==(N|0)){break}c[F>>2]=M;c[E>>2]=M;c[H>>2]=I;c[v>>2]=A+aT;c[p>>2]=0;c[aM>>2]=0;switch(d[W]|0|0){case 0:{S=c[aK>>2]|0;Q=c[ae>>2]|0;R=a[aU+17|0]|0;aw=R&255;ax=aW>>>2;if(R<<24>>24==0){break L663}R=(V|0)==0;aA=V-1|0;aJ=(T&1|0)!=0;aH=aW<<1;aG=ax+1|0;ak=ax+2|0;at=ax+3|0;an=X-1|0;$=an<<4;aq=(U&1|0)!=0;ap=aW+4|0;am=0;as=0;Y=0;ag=1;while(1){if(R){aX=am;aY=as;a$=ag}else{_=am;af=as;ay=0;ar=c[B+(Y<<2)>>2]|0;av=ag;while(1){if((ay&1|0)==0){a2=0;a3=X;a6=1;a7=16;a8=ar}else{a2=an;a3=-1;a6=-1;a7=-16;a8=ar+$|0}az=(ay|0)==(aA|0);aB=az&aJ;if((a2|0)==(a3|0)){a9=_;ba=af;bb=av}else{aI=az&aJ^1;az=_;aO=af;aQ=a2;aP=a8;bc=av;while(1){if((bc|0)==1){be=a5(s,aL)|0|512}else{be=bc}bg=be&7;bh=d[832+bg|0]|0;bi=az;bk=0;do{bl=(a5(s,u)|0)+bi|0;bm=bl-S|0;bn=bm>>31;bi=bn&bl|bm&~bn;if((c[aK>>2]|0)>>>0<=bi>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(bk<<2)>>2]=c[(c[t>>2]|0)+(bi<<2)>>2];bk=bk+1|0;}while(bk>>>0<bh>>>0);bh=be>>>3;bk=(aQ|0)==(an|0)&aq;bn=aP;do{if(aB|bk){if(bk){bm=(a5(s,aE)|0)+aO|0;bl=bm-Q|0;bo=bl>>31;bp=bo&bm|bl&~bo;c[bn>>2]=c[n+((d[840+(bg<<2)|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bp>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+4>>2]=c[(c[aD>>2]|0)+(bp<<2)>>2];bo=(a5(s,aE)|0)+bp|0;bp=bo-Q|0;bl=bp>>31;bm=(a5(s,aE)|0)+(bl&bo|bp&~bl)|0;bl=bm-Q|0;bp=bl>>31;bo=bp&bm|bl&~bp;if(aB){bp=(a5(s,aE)|0)+bo|0;bl=bp-Q|0;bm=bl>>31;bq=bm&bp|bl&~bm;break}c[aP+aW>>2]=c[n+((d[842+(bg<<2)|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bo>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+ap>>2]=c[(c[aD>>2]|0)+(bo<<2)>>2];bm=(a5(s,aE)|0)+bo|0;bo=bm-Q|0;bl=bo>>31;bq=bl&bm|bo&~bl;break}else{br=aO;bs=0}while(1){bl=Z(bs,aW)|0;bo=bs<<1;bm=(a5(s,aE)|0)+br|0;bp=bm-Q|0;bt=bp>>31;bu=bt&bm|bp&~bt;if((bs|0)==0|aI){c[aP+bl>>2]=c[n+((d[840+(bg<<2)+bo|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bu>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+(bl+4)>>2]=c[(c[aD>>2]|0)+(bu<<2)>>2];bt=(a5(s,aE)|0)+bu|0;bp=bt-Q|0;bm=bp>>31;bv=bm&bt|bp&~bm;c[aP+(bl+8)>>2]=c[n+((d[(bo|1)+(840+(bg<<2))|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bv>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+(bl+12)>>2]=c[(c[aD>>2]|0)+(bv<<2)>>2];bw=bv}else{bv=(a5(s,aE)|0)+bu|0;bu=bv-Q|0;bl=bu>>31;bw=bl&bv|bu&~bl}bl=bs+1|0;if(bl>>>0<2){br=bw;bs=bl}else{bq=bw;break}}}else{c[bn>>2]=c[n+((d[840+(bg<<2)|0]|0)<<2)>>2];bl=(a5(s,aE)|0)+aO|0;bu=bl-Q|0;bv=bu>>31;bo=bv&bl|bu&~bv;if((c[ae>>2]|0)>>>0<=bo>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+4>>2]=c[(c[aD>>2]|0)+(bo<<2)>>2];c[aP+8>>2]=c[n+((d[841+(bg<<2)|0]|0)<<2)>>2];bv=(a5(s,aE)|0)+bo|0;bo=bv-Q|0;bu=bo>>31;bl=bu&bv|bo&~bu;if((c[ae>>2]|0)>>>0<=bl>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+12>>2]=c[(c[aD>>2]|0)+(bl<<2)>>2];c[bn+(ax<<2)>>2]=c[n+((d[842+(bg<<2)|0]|0)<<2)>>2];bu=(a5(s,aE)|0)+bl|0;bl=bu-Q|0;bo=bl>>31;bv=bo&bu|bl&~bo;if((c[ae>>2]|0)>>>0<=bv>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[bn+(aG<<2)>>2]=c[(c[aD>>2]|0)+(bv<<2)>>2];c[bn+(ak<<2)>>2]=c[n+((d[843+(bg<<2)|0]|0)<<2)>>2];bo=(a5(s,aE)|0)+bv|0;bv=bo-Q|0;bl=bv>>31;bu=bl&bo|bv&~bl;if((c[ae>>2]|0)>>>0<=bu>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[bn+(at<<2)>>2]=c[(c[aD>>2]|0)+(bu<<2)>>2];bq=bu}}while(0);bn=aQ+a6|0;if((bn|0)==(a3|0)){a9=bi;ba=bq;bb=bh;break}else{az=bi;aO=bq;aQ=bn;aP=aP+a7|0;bc=bh}}}bc=ay+1|0;if(bc>>>0<V>>>0){_=a9;af=ba;ay=bc;ar=ar+aH|0;av=bb}else{aX=a9;aY=ba;a$=bb;break}}}av=Y+1|0;if(av>>>0<aw>>>0){am=aX;as=aY;Y=av;ag=a$}else{break}}break};case 2:case 3:case 5:case 6:case 4:{ag=c[aK>>2]|0;Y=c[ae>>2]|0;as=c[aC>>2]|0;am=(d[aU+63|0]|0)<<8|(d[aU+64|0]|0);aw=a[aU+17|0]|0;aH=aw&255;if(aw<<24>>24==0){break L663}aw=(V|0)==0;at=V-1|0;Q=(T&1|0)==0;ak=aW<<1;aG=(U&1|0)==0;ax=X-1|0;ap=ax<<5;aq=0;an=0;S=0;aJ=0;aA=0;$=1;while(1){if(aw){bx=aq;by=an;bz=S;bA=aJ;bB=$}else{R=aq;av=an;ar=S;ay=aJ;af=0;_=c[B+(aA<<2)>>2]|0;bc=$;while(1){if((af&1|0)==0){bC=0;bD=X;bE=1;bF=32;bG=_}else{bC=ax;bD=-1;bE=-1;bF=-32;bG=_+ap|0}aP=Q|(af|0)!=(at|0);if((bC|0)==(bD|0)){bH=R;bI=av;bJ=ar;bK=ay;bL=bc}else{aQ=R;aO=av;az=ar;aI=ay;aB=bC;bn=bG;bg=bc;while(1){if((bg|0)==1){bM=a5(s,aL)|0|512}else{bM=bg}bk=bM&7;bu=d[832+bk|0]|0;bl=(aB|0)!=(ax|0);bv=az;bo=0;do{bm=(a5(s,ai)|0)+bv|0;bp=bm-as|0;bt=bp>>31;bv=bt&bm|bp&~bt;if((c[aC>>2]|0)>>>0<=bv>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[m+(bo<<2)>>2]=e[(c[aj>>2]|0)+(bv<<1)>>1]|0;bo=bo+1|0;}while(bo>>>0<bu>>>0);bo=bM>>>3;bh=aQ;bi=0;do{bt=(a5(s,u)|0)+bh|0;bp=bt-ag|0;bm=bp>>31;bh=bm&bt|bp&~bm;if((c[aK>>2]|0)>>>0<=bh>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(bi<<2)>>2]=c[(c[t>>2]|0)+(bh<<2)>>2];bi=bi+1|0;}while(bi>>>0<bu>>>0);bu=aG|bl;bi=aO;bm=aI;bp=bn;bt=0;while(1){bN=(bt|0)==0|aP;bO=bt<<1;bP=bi;bQ=bm;bR=bp;bS=0;while(1){bT=(a5(s,ao)|0)+bQ|0;bU=bT-am|0;bV=bU>>31;bW=bV&bT|bU&~bV;bV=(a5(s,aE)|0)+bP|0;bU=bV-Y|0;bT=bU>>31;bX=bT&bV|bU&~bT;if(((bS|0)==0|bu)&bN){bT=d[bS+bO+(840+(bk<<2))|0]|0;bU=bW*3|0;if((c[x>>2]|0)>>>0<=bU>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}bV=c[ah>>2]|0;c[bR>>2]=(e[bV+(bU<<1)>>1]|0)<<16|c[m+(bT<<2)>>2];c[bR+4>>2]=(e[bV+(bU+2<<1)>>1]|0)<<16|(e[bV+(bU+1<<1)>>1]|0);c[bR+8>>2]=c[n+(bT<<2)>>2];if((c[ae>>2]|0)>>>0<=bX>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[bR+12>>2]=c[(c[aD>>2]|0)+(bX<<2)>>2]}bT=bS+1|0;if(bT>>>0<2){bP=bX;bQ=bW;bR=bR+16|0;bS=bT}else{break}}bS=bt+1|0;if(bS>>>0<2){bi=bX;bm=bW;bp=bp+aW|0;bt=bS}else{break}}bt=aB+bE|0;if((bt|0)==(bD|0)){bH=bh;bI=bX;bJ=bv;bK=bW;bL=bo;break}else{aQ=bh;aO=bX;az=bv;aI=bW;aB=bt;bn=bn+bF|0;bg=bo}}}bg=af+1|0;if(bg>>>0<V>>>0){R=bH;av=bI;ar=bJ;ay=bK;af=bg;_=_+ak|0;bc=bL}else{bx=bH;by=bI;bz=bJ;bA=bK;bB=bL;break}}}bc=aA+1|0;if(bc>>>0<aH>>>0){aq=bx;an=by;S=bz;aJ=bA;aA=bc;$=bB}else{break}}break};case 9:{$=c[aC>>2]|0;aA=(d[aU+63|0]|0)<<8|(d[aU+64|0]|0);aJ=a[aU+17|0]|0;S=aJ&255;if(aJ<<24>>24==0){break L663}aJ=(V|0)==0;an=V-1|0;aq=(T&1|0)==0;aH=aW<<1;ak=X-1|0;Y=ak<<4;am=(U&1|0)!=0;aG=0;ag=0;as=0;ax=1;while(1){if(aJ){bY=aG;bZ=ag;b_=ax}else{at=aG;Q=ag;ap=0;aw=c[B+(as<<2)>>2]|0;bc=ax;while(1){if((ap&1|0)==0){b$=0;b0=X;b1=1;b2=16;b3=aw}else{b$=ak;b0=-1;b1=-1;b2=-16;b3=aw+Y|0}_=aq|(ap|0)!=(an|0);if((b$|0)==(b0|0)){b4=at;b5=Q;b6=bc}else{af=at;ay=Q;ar=b3;av=b$;R=bc;while(1){if((R|0)==1){b7=a5(s,aL)|0|512}else{b7=R}bg=b7&7;bn=d[832+bg|0]|0;aB=af;aI=0;do{az=(a5(s,ai)|0)+aB|0;aO=az-$|0;aQ=aO>>31;aB=aQ&az|aO&~aQ;if((c[aC>>2]|0)>>>0<=aB>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(aI<<2)>>2]=e[(c[aj>>2]|0)+(aB<<1)>>1]|0;aI=aI+1|0;}while(aI>>>0<bn>>>0);bn=(av|0)==(ak|0)&am;aI=ay;bo=ar;bv=0;while(1){bh=bo;aQ=(bv|0)==0|_;aO=bv<<1;az=(a5(s,ao)|0)+aI|0;aP=az-aA|0;bt=aP>>31;bp=bt&az|aP&~bt;if(aQ){bt=d[840+(bg<<2)+aO|0]|0;aP=bp*3|0;if((c[x>>2]|0)>>>0<=aP>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}az=c[ah>>2]|0;c[bh>>2]=(e[az+(aP<<1)>>1]|0)<<16|c[n+(bt<<2)>>2];c[bo+4>>2]=(e[az+(aP+2<<1)>>1]|0)<<16|(e[az+(aP+1<<1)>>1]|0)}aP=bo+8|0;az=(a5(s,ao)|0)+bp|0;bp=az-aA|0;bt=bp>>31;b8=bt&az|bp&~bt;if(!(bn|aQ^1)){aQ=d[(aO|1)+(840+(bg<<2))|0]|0;aO=b8*3|0;if((c[x>>2]|0)>>>0<=aO>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}bt=c[ah>>2]|0;c[aP>>2]=(e[bt+(aO<<1)>>1]|0)<<16|c[n+(aQ<<2)>>2];c[bo+12>>2]=(e[bt+(aO+2<<1)>>1]|0)<<16|(e[bt+(aO+1<<1)>>1]|0)}aO=bv+1|0;if(aO>>>0<2){aI=b8;bo=bo+aW|0;bv=aO}else{break}}bv=b7>>>3;bo=av+b1|0;if((bo|0)==(b0|0)){b4=aB;b5=b8;b6=bv;break}else{af=aB;ay=b8;ar=ar+b2|0;av=bo;R=bv}}}R=ap+1|0;if(R>>>0<V>>>0){at=b4;Q=b5;ap=R;aw=aw+aH|0;bc=b6}else{bY=b4;bZ=b5;b_=b6;break}}}bc=as+1|0;if(bc>>>0<S>>>0){aG=bY;ag=bZ;as=bc;ax=b_}else{break}}break};case 7:case 8:{ax=c[aC>>2]|0;as=(d[aU+63|0]|0)<<8|(d[aU+64|0]|0);ag=a[aU+17|0]|0;aG=ag&255;if(ag<<24>>24==0){break L663}ag=(V|0)==0;S=V-1|0;aH=(T&1|0)==0;aA=aW<<1;am=(U&1|0)==0;ak=X-1|0;$=ak<<5;an=0;aq=0;Y=0;aJ=0;bc=0;aw=1;while(1){if(ag){b9=an;ca=aq;cb=Y;cc=aJ;cd=aw}else{ap=an;Q=aq;at=Y;R=aJ;av=0;ar=c[B+(bc<<2)>>2]|0;ay=aw;while(1){if((av&1|0)==0){ce=0;cf=X;cg=1;ch=32;ci=ar}else{ce=ak;cf=-1;cg=-1;ch=-32;ci=ar+$|0}af=aH|(av|0)!=(S|0);if((ce|0)==(cf|0)){cj=ap;ck=Q;cl=at;cm=R;cn=ay}else{_=ap;bv=Q;bo=at;aI=R;bg=ce;bn=ci;aO=ay;while(1){if((aO|0)==1){co=a5(s,aL)|0|512}else{co=aO}bt=co&7;aQ=d[832+bt|0]|0;aP=(bg|0)!=(ak|0);bp=_;az=0;do{bh=(a5(s,ai)|0)+bp|0;bm=bh-ax|0;bi=bm>>31;bp=bi&bh|bm&~bi;if((c[aC>>2]|0)>>>0<=bp>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(az<<2)>>2]=e[(c[aj>>2]|0)+(bp<<1)>>1]|0;az=az+1|0;}while(az>>>0<aQ>>>0);az=co>>>3;aB=bo;bi=0;do{bm=(a5(s,ai)|0)+aB|0;bh=bm-ax|0;bk=bh>>31;aB=bk&bm|bh&~bk;if((c[aC>>2]|0)>>>0<=aB>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[m+(bi<<2)>>2]=e[(c[aj>>2]|0)+(aB<<1)>>1]|0;bi=bi+1|0;}while(bi>>>0<aQ>>>0);aQ=am|aP;bi=bv;bk=aI;bh=bn;bm=0;while(1){bu=(bm|0)==0|af;bl=bm<<1;bS=bi;bR=bk;bQ=bh;bP=0;while(1){bO=(a5(s,ao)|0)+bS|0;bN=bO-as|0;bT=bN>>31;cp=bT&bO|bN&~bT;bT=(a5(s,ao)|0)+bR|0;bN=bT-as|0;bO=bN>>31;cq=bO&bT|bN&~bO;if(((bP|0)==0|aQ)&bu){bO=d[bP+bl+(840+(bt<<2))|0]|0;bN=cp*3|0;bT=c[x>>2]|0;if(bT>>>0>bN>>>0){cr=bT}else{au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;cr=c[x>>2]|0}bT=c[ah>>2]|0;bU=cq*3|0;if(cr>>>0>bU>>>0){cs=bT}else{au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;cs=c[ah>>2]|0}c[bQ>>2]=(e[bT+(bN<<1)>>1]|0)<<16|c[n+(bO<<2)>>2];c[bQ+4>>2]=(e[bT+(bN+2<<1)>>1]|0)<<16|(e[bT+(bN+1<<1)>>1]|0);c[bQ+8>>2]=(e[cs+(bU<<1)>>1]|0)<<16|c[m+(bO<<2)>>2];c[bQ+12>>2]=(e[cs+(bU+2<<1)>>1]|0)<<16|(e[cs+(bU+1<<1)>>1]|0)}bU=bP+1|0;if(bU>>>0<2){bS=cp;bR=cq;bQ=bQ+16|0;bP=bU}else{break}}bP=bm+1|0;if(bP>>>0<2){bi=cp;bk=cq;bh=bh+aW|0;bm=bP}else{break}}bm=bg+cg|0;if((bm|0)==(cf|0)){cj=bp;ck=cp;cl=aB;cm=cq;cn=az;break}else{_=bp;bv=cp;bo=aB;aI=cq;bg=bm;bn=bn+ch|0;aO=az}}}aO=av+1|0;if(aO>>>0<V>>>0){ap=cj;Q=ck;at=cl;R=cm;av=aO;ar=ar+aA|0;ay=cn}else{b9=cj;ca=ck;cb=cl;cc=cm;cd=cn;break}}}ay=bc+1|0;if(ay>>>0<aG>>>0){an=b9;aq=ca;Y=cb;aJ=cc;bc=ay;aw=cd}else{break}}break};default:{break L663}}}}while(0);aS=c[G>>2]|0}}while(0);g=aS+O|0;c[G>>2]=g;U=ac+1|0;if(U>>>0<r>>>0){ac=U;ab=ab>>>1;aa=aa>>>1;f=g}else{break}}}}while(0);if((L|0)==0){i=j;return}if((c[L>>2]|0)!=519686845){i=j;return}bd(L);if((L&7|0)==0){bf(L);i=j;return}else{L=z|0;au(L|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=2500,c[K+16>>2]=576,K)|0)|0;i=K;al(L|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;i=j;return}}function bd(b){b=b|0;var d=0,e=0,f=0,g=0,h=0;d=i;i=i+512|0;e=d|0;c[b>>2]=0;f=b+284|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+288>>2]=0;c[b+292>>2]=0}a[b+296|0]=0;f=b+268|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+272>>2]=0;c[b+276>>2]=0}a[b+280|0]=0;f=b+252|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+256>>2]=0;c[b+260>>2]=0}a[b+264|0]=0;f=b+236|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+240>>2]=0;c[b+244>>2]=0}a[b+248|0]=0;a1(b+212|0);a1(b+188|0);a1(b+164|0);a1(b+140|0);a1(b+116|0);i=d;return}function be(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0,S=0,T=0,U=0,V=0,W=0,X=0,Y=0,Z=0,_=0,$=0,aa=0,ab=0,ac=0,ad=0,ae=0,af=0,ag=0,ah=0,ai=0,ak=0,al=0,am=0,an=0,ap=0,aq=0,ar=0,as=0,at=0,au=0,av=0,aw=0,ax=0,aA=0,aB=0,aD=0,aE=0,aF=0,aG=0,aH=0,aI=0,aJ=0,aK=0,aL=0;do{if(a>>>0<245){if(a>>>0<11){b=16}else{b=a+11&-8}d=b>>>3;e=c[228]|0;f=e>>>(d>>>0);if((f&3|0)!=0){g=(f&1^1)+d|0;h=g<<1;i=952+(h<<2)|0;j=952+(h+2<<2)|0;h=c[j>>2]|0;k=h+8|0;l=c[k>>2]|0;do{if((i|0)==(l|0)){c[228]=e&~(1<<g)}else{if(l>>>0<(c[232]|0)>>>0){aj();return 0}m=l+12|0;if((c[m>>2]|0)==(h|0)){c[m>>2]=i;c[j>>2]=l;break}else{aj();return 0}}}while(0);l=g<<3;c[h+4>>2]=l|3;j=h+(l|4)|0;c[j>>2]=c[j>>2]|1;n=k;return n|0}if(b>>>0<=(c[230]|0)>>>0){o=b;break}if((f|0)!=0){j=2<<d;l=f<<d&(j|-j);j=(l&-l)-1|0;l=j>>>12&16;i=j>>>(l>>>0);j=i>>>5&8;m=i>>>(j>>>0);i=m>>>2&4;p=m>>>(i>>>0);m=p>>>1&2;q=p>>>(m>>>0);p=q>>>1&1;r=(j|l|i|m|p)+(q>>>(p>>>0))|0;p=r<<1;q=952+(p<<2)|0;m=952+(p+2<<2)|0;p=c[m>>2]|0;i=p+8|0;l=c[i>>2]|0;do{if((q|0)==(l|0)){c[228]=e&~(1<<r)}else{if(l>>>0<(c[232]|0)>>>0){aj();return 0}j=l+12|0;if((c[j>>2]|0)==(p|0)){c[j>>2]=q;c[m>>2]=l;break}else{aj();return 0}}}while(0);l=r<<3;m=l-b|0;c[p+4>>2]=b|3;q=p;e=q+b|0;c[q+(b|4)>>2]=m|1;c[q+l>>2]=m;l=c[230]|0;if((l|0)!=0){q=c[233]|0;d=l>>>3;l=d<<1;f=952+(l<<2)|0;k=c[228]|0;h=1<<d;do{if((k&h|0)==0){c[228]=k|h;s=f;t=952+(l+2<<2)|0}else{d=952+(l+2<<2)|0;g=c[d>>2]|0;if(g>>>0>=(c[232]|0)>>>0){s=g;t=d;break}aj();return 0}}while(0);c[t>>2]=q;c[s+12>>2]=q;c[q+8>>2]=s;c[q+12>>2]=f}c[230]=m;c[233]=e;n=i;return n|0}l=c[229]|0;if((l|0)==0){o=b;break}h=(l&-l)-1|0;l=h>>>12&16;k=h>>>(l>>>0);h=k>>>5&8;p=k>>>(h>>>0);k=p>>>2&4;r=p>>>(k>>>0);p=r>>>1&2;d=r>>>(p>>>0);r=d>>>1&1;g=c[1216+((h|l|k|p|r)+(d>>>(r>>>0))<<2)>>2]|0;r=g;d=g;p=(c[g+4>>2]&-8)-b|0;while(1){g=c[r+16>>2]|0;if((g|0)==0){k=c[r+20>>2]|0;if((k|0)==0){break}else{u=k}}else{u=g}g=(c[u+4>>2]&-8)-b|0;k=g>>>0<p>>>0;r=u;d=k?u:d;p=k?g:p}r=d;i=c[232]|0;if(r>>>0<i>>>0){aj();return 0}e=r+b|0;m=e;if(r>>>0>=e>>>0){aj();return 0}e=c[d+24>>2]|0;f=c[d+12>>2]|0;do{if((f|0)==(d|0)){q=d+20|0;g=c[q>>2]|0;if((g|0)==0){k=d+16|0;l=c[k>>2]|0;if((l|0)==0){v=0;break}else{w=l;x=k}}else{w=g;x=q}while(1){q=w+20|0;g=c[q>>2]|0;if((g|0)!=0){w=g;x=q;continue}q=w+16|0;g=c[q>>2]|0;if((g|0)==0){break}else{w=g;x=q}}if(x>>>0<i>>>0){aj();return 0}else{c[x>>2]=0;v=w;break}}else{q=c[d+8>>2]|0;if(q>>>0<i>>>0){aj();return 0}g=q+12|0;if((c[g>>2]|0)!=(d|0)){aj();return 0}k=f+8|0;if((c[k>>2]|0)==(d|0)){c[g>>2]=f;c[k>>2]=q;v=f;break}else{aj();return 0}}}while(0);L990:do{if((e|0)!=0){f=d+28|0;i=1216+(c[f>>2]<<2)|0;do{if((d|0)==(c[i>>2]|0)){c[i>>2]=v;if((v|0)!=0){break}c[229]=c[229]&~(1<<c[f>>2]);break L990}else{if(e>>>0<(c[232]|0)>>>0){aj();return 0}q=e+16|0;if((c[q>>2]|0)==(d|0)){c[q>>2]=v}else{c[e+20>>2]=v}if((v|0)==0){break L990}}}while(0);if(v>>>0<(c[232]|0)>>>0){aj();return 0}c[v+24>>2]=e;f=c[d+16>>2]|0;do{if((f|0)!=0){if(f>>>0<(c[232]|0)>>>0){aj();return 0}else{c[v+16>>2]=f;c[f+24>>2]=v;break}}}while(0);f=c[d+20>>2]|0;if((f|0)==0){break}if(f>>>0<(c[232]|0)>>>0){aj();return 0}else{c[v+20>>2]=f;c[f+24>>2]=v;break}}}while(0);if(p>>>0<16){e=p+b|0;c[d+4>>2]=e|3;f=r+(e+4)|0;c[f>>2]=c[f>>2]|1}else{c[d+4>>2]=b|3;c[r+(b|4)>>2]=p|1;c[r+(p+b)>>2]=p;f=c[230]|0;if((f|0)!=0){e=c[233]|0;i=f>>>3;f=i<<1;q=952+(f<<2)|0;k=c[228]|0;g=1<<i;do{if((k&g|0)==0){c[228]=k|g;y=q;z=952+(f+2<<2)|0}else{i=952+(f+2<<2)|0;l=c[i>>2]|0;if(l>>>0>=(c[232]|0)>>>0){y=l;z=i;break}aj();return 0}}while(0);c[z>>2]=e;c[y+12>>2]=e;c[e+8>>2]=y;c[e+12>>2]=q}c[230]=p;c[233]=m}f=d+8|0;if((f|0)==0){o=b;break}else{n=f}return n|0}else{if(a>>>0>4294967231){o=-1;break}f=a+11|0;g=f&-8;k=c[229]|0;if((k|0)==0){o=g;break}r=-g|0;i=f>>>8;do{if((i|0)==0){A=0}else{if(g>>>0>16777215){A=31;break}f=(i+1048320|0)>>>16&8;l=i<<f;h=(l+520192|0)>>>16&4;j=l<<h;l=(j+245760|0)>>>16&2;B=14-(h|f|l)+(j<<l>>>15)|0;A=g>>>((B+7|0)>>>0)&1|B<<1}}while(0);i=c[1216+(A<<2)>>2]|0;L1038:do{if((i|0)==0){C=0;D=r;E=0}else{if((A|0)==31){F=0}else{F=25-(A>>>1)|0}d=0;m=r;p=i;q=g<<F;e=0;while(1){B=c[p+4>>2]&-8;l=B-g|0;if(l>>>0<m>>>0){if((B|0)==(g|0)){C=p;D=l;E=p;break L1038}else{G=p;H=l}}else{G=d;H=m}l=c[p+20>>2]|0;B=c[p+16+(q>>>31<<2)>>2]|0;j=(l|0)==0|(l|0)==(B|0)?e:l;if((B|0)==0){C=G;D=H;E=j;break}else{d=G;m=H;p=B;q=q<<1;e=j}}}}while(0);if((E|0)==0&(C|0)==0){i=2<<A;r=(i|-i)&k;if((r|0)==0){o=g;break}i=(r&-r)-1|0;r=i>>>12&16;e=i>>>(r>>>0);i=e>>>5&8;q=e>>>(i>>>0);e=q>>>2&4;p=q>>>(e>>>0);q=p>>>1&2;m=p>>>(q>>>0);p=m>>>1&1;I=c[1216+((i|r|e|q|p)+(m>>>(p>>>0))<<2)>>2]|0}else{I=E}if((I|0)==0){J=D;K=C}else{p=I;m=D;q=C;while(1){e=(c[p+4>>2]&-8)-g|0;r=e>>>0<m>>>0;i=r?e:m;e=r?p:q;r=c[p+16>>2]|0;if((r|0)!=0){p=r;m=i;q=e;continue}r=c[p+20>>2]|0;if((r|0)==0){J=i;K=e;break}else{p=r;m=i;q=e}}}if((K|0)==0){o=g;break}if(J>>>0>=((c[230]|0)-g|0)>>>0){o=g;break}q=K;m=c[232]|0;if(q>>>0<m>>>0){aj();return 0}p=q+g|0;k=p;if(q>>>0>=p>>>0){aj();return 0}e=c[K+24>>2]|0;i=c[K+12>>2]|0;do{if((i|0)==(K|0)){r=K+20|0;d=c[r>>2]|0;if((d|0)==0){j=K+16|0;B=c[j>>2]|0;if((B|0)==0){L=0;break}else{M=B;N=j}}else{M=d;N=r}while(1){r=M+20|0;d=c[r>>2]|0;if((d|0)!=0){M=d;N=r;continue}r=M+16|0;d=c[r>>2]|0;if((d|0)==0){break}else{M=d;N=r}}if(N>>>0<m>>>0){aj();return 0}else{c[N>>2]=0;L=M;break}}else{r=c[K+8>>2]|0;if(r>>>0<m>>>0){aj();return 0}d=r+12|0;if((c[d>>2]|0)!=(K|0)){aj();return 0}j=i+8|0;if((c[j>>2]|0)==(K|0)){c[d>>2]=i;c[j>>2]=r;L=i;break}else{aj();return 0}}}while(0);L1088:do{if((e|0)!=0){i=K+28|0;m=1216+(c[i>>2]<<2)|0;do{if((K|0)==(c[m>>2]|0)){c[m>>2]=L;if((L|0)!=0){break}c[229]=c[229]&~(1<<c[i>>2]);break L1088}else{if(e>>>0<(c[232]|0)>>>0){aj();return 0}r=e+16|0;if((c[r>>2]|0)==(K|0)){c[r>>2]=L}else{c[e+20>>2]=L}if((L|0)==0){break L1088}}}while(0);if(L>>>0<(c[232]|0)>>>0){aj();return 0}c[L+24>>2]=e;i=c[K+16>>2]|0;do{if((i|0)!=0){if(i>>>0<(c[232]|0)>>>0){aj();return 0}else{c[L+16>>2]=i;c[i+24>>2]=L;break}}}while(0);i=c[K+20>>2]|0;if((i|0)==0){break}if(i>>>0<(c[232]|0)>>>0){aj();return 0}else{c[L+20>>2]=i;c[i+24>>2]=L;break}}}while(0);do{if(J>>>0<16){e=J+g|0;c[K+4>>2]=e|3;i=q+(e+4)|0;c[i>>2]=c[i>>2]|1}else{c[K+4>>2]=g|3;c[q+(g|4)>>2]=J|1;c[q+(J+g)>>2]=J;i=J>>>3;if(J>>>0<256){e=i<<1;m=952+(e<<2)|0;r=c[228]|0;j=1<<i;do{if((r&j|0)==0){c[228]=r|j;O=m;P=952+(e+2<<2)|0}else{i=952+(e+2<<2)|0;d=c[i>>2]|0;if(d>>>0>=(c[232]|0)>>>0){O=d;P=i;break}aj();return 0}}while(0);c[P>>2]=k;c[O+12>>2]=k;c[q+(g+8)>>2]=O;c[q+(g+12)>>2]=m;break}e=p;j=J>>>8;do{if((j|0)==0){Q=0}else{if(J>>>0>16777215){Q=31;break}r=(j+1048320|0)>>>16&8;i=j<<r;d=(i+520192|0)>>>16&4;B=i<<d;i=(B+245760|0)>>>16&2;l=14-(d|r|i)+(B<<i>>>15)|0;Q=J>>>((l+7|0)>>>0)&1|l<<1}}while(0);j=1216+(Q<<2)|0;c[q+(g+28)>>2]=Q;c[q+(g+20)>>2]=0;c[q+(g+16)>>2]=0;m=c[229]|0;l=1<<Q;if((m&l|0)==0){c[229]=m|l;c[j>>2]=e;c[q+(g+24)>>2]=j;c[q+(g+12)>>2]=e;c[q+(g+8)>>2]=e;break}if((Q|0)==31){R=0}else{R=25-(Q>>>1)|0}l=J<<R;m=c[j>>2]|0;while(1){if((c[m+4>>2]&-8|0)==(J|0)){break}S=m+16+(l>>>31<<2)|0;j=c[S>>2]|0;if((j|0)==0){T=829;break}else{l=l<<1;m=j}}if((T|0)==829){if(S>>>0<(c[232]|0)>>>0){aj();return 0}else{c[S>>2]=e;c[q+(g+24)>>2]=m;c[q+(g+12)>>2]=e;c[q+(g+8)>>2]=e;break}}l=m+8|0;j=c[l>>2]|0;i=c[232]|0;if(m>>>0<i>>>0){aj();return 0}if(j>>>0<i>>>0){aj();return 0}else{c[j+12>>2]=e;c[l>>2]=e;c[q+(g+8)>>2]=j;c[q+(g+12)>>2]=m;c[q+(g+24)>>2]=0;break}}}while(0);q=K+8|0;if((q|0)==0){o=g;break}else{n=q}return n|0}}while(0);K=c[230]|0;if(o>>>0<=K>>>0){S=K-o|0;J=c[233]|0;if(S>>>0>15){R=J;c[233]=R+o;c[230]=S;c[R+(o+4)>>2]=S|1;c[R+K>>2]=S;c[J+4>>2]=o|3}else{c[230]=0;c[233]=0;c[J+4>>2]=K|3;S=J+(K+4)|0;c[S>>2]=c[S>>2]|1}n=J+8|0;return n|0}J=c[231]|0;if(o>>>0<J>>>0){S=J-o|0;c[231]=S;J=c[234]|0;K=J;c[234]=K+o;c[K+(o+4)>>2]=S|1;c[J+4>>2]=o|3;n=J+8|0;return n|0}do{if((c[222]|0)==0){J=ao(30)|0;if((J-1&J|0)==0){c[224]=J;c[223]=J;c[225]=-1;c[226]=-1;c[227]=0;c[339]=0;c[222]=(aC(0)|0)&-16^1431655768;break}else{aj();return 0}}}while(0);J=o+48|0;S=c[224]|0;K=o+47|0;R=S+K|0;Q=-S|0;S=R&Q;if(S>>>0<=o>>>0){n=0;return n|0}O=c[338]|0;do{if((O|0)!=0){P=c[336]|0;L=P+S|0;if(L>>>0<=P>>>0|L>>>0>O>>>0){n=0}else{break}return n|0}}while(0);L1180:do{if((c[339]&4|0)==0){O=c[234]|0;L1182:do{if((O|0)==0){T=859}else{L=O;P=1360;while(1){U=P|0;M=c[U>>2]|0;if(M>>>0<=L>>>0){V=P+4|0;if((M+(c[V>>2]|0)|0)>>>0>L>>>0){break}}M=c[P+8>>2]|0;if((M|0)==0){T=859;break L1182}else{P=M}}if((P|0)==0){T=859;break}L=R-(c[231]|0)&Q;if(L>>>0>=2147483647){W=0;break}m=ay(L|0)|0;e=(m|0)==((c[U>>2]|0)+(c[V>>2]|0)|0);X=e?m:-1;Y=e?L:0;Z=m;_=L;T=868}}while(0);do{if((T|0)==859){O=ay(0)|0;if((O|0)==-1){W=0;break}g=O;L=c[223]|0;m=L-1|0;if((m&g|0)==0){$=S}else{$=S-g+(m+g&-L)|0}L=c[336]|0;g=L+$|0;if(!($>>>0>o>>>0&$>>>0<2147483647)){W=0;break}m=c[338]|0;if((m|0)!=0){if(g>>>0<=L>>>0|g>>>0>m>>>0){W=0;break}}m=ay($|0)|0;g=(m|0)==(O|0);X=g?O:-1;Y=g?$:0;Z=m;_=$;T=868}}while(0);L1202:do{if((T|0)==868){m=-_|0;if((X|0)!=-1){aa=Y;ab=X;T=879;break L1180}do{if((Z|0)!=-1&_>>>0<2147483647&_>>>0<J>>>0){g=c[224]|0;O=K-_+g&-g;if(O>>>0>=2147483647){ac=_;break}if((ay(O|0)|0)==-1){ay(m|0)|0;W=Y;break L1202}else{ac=O+_|0;break}}else{ac=_}}while(0);if((Z|0)==-1){W=Y}else{aa=ac;ab=Z;T=879;break L1180}}}while(0);c[339]=c[339]|4;ad=W;T=876}else{ad=0;T=876}}while(0);do{if((T|0)==876){if(S>>>0>=2147483647){break}W=ay(S|0)|0;Z=ay(0)|0;if(!((Z|0)!=-1&(W|0)!=-1&W>>>0<Z>>>0)){break}ac=Z-W|0;Z=ac>>>0>(o+40|0)>>>0;Y=Z?W:-1;if((Y|0)!=-1){aa=Z?ac:ad;ab=Y;T=879}}}while(0);do{if((T|0)==879){ad=(c[336]|0)+aa|0;c[336]=ad;if(ad>>>0>(c[337]|0)>>>0){c[337]=ad}ad=c[234]|0;L1222:do{if((ad|0)==0){S=c[232]|0;if((S|0)==0|ab>>>0<S>>>0){c[232]=ab}c[340]=ab;c[341]=aa;c[343]=0;c[237]=c[222];c[236]=-1;S=0;do{Y=S<<1;ac=952+(Y<<2)|0;c[952+(Y+3<<2)>>2]=ac;c[952+(Y+2<<2)>>2]=ac;S=S+1|0;}while(S>>>0<32);S=ab+8|0;if((S&7|0)==0){ae=0}else{ae=-S&7}S=aa-40-ae|0;c[234]=ab+ae;c[231]=S;c[ab+(ae+4)>>2]=S|1;c[ab+(aa-36)>>2]=40;c[235]=c[226]}else{S=1360;while(1){af=c[S>>2]|0;ag=S+4|0;ah=c[ag>>2]|0;if((ab|0)==(af+ah|0)){T=891;break}ac=c[S+8>>2]|0;if((ac|0)==0){break}else{S=ac}}do{if((T|0)==891){if((c[S+12>>2]&8|0)!=0){break}ac=ad;if(!(ac>>>0>=af>>>0&ac>>>0<ab>>>0)){break}c[ag>>2]=ah+aa;ac=c[234]|0;Y=(c[231]|0)+aa|0;Z=ac;W=ac+8|0;if((W&7|0)==0){ai=0}else{ai=-W&7}W=Y-ai|0;c[234]=Z+ai;c[231]=W;c[Z+(ai+4)>>2]=W|1;c[Z+(Y+4)>>2]=40;c[235]=c[226];break L1222}}while(0);if(ab>>>0<(c[232]|0)>>>0){c[232]=ab}S=ab+aa|0;Y=1360;while(1){ak=Y|0;if((c[ak>>2]|0)==(S|0)){T=901;break}Z=c[Y+8>>2]|0;if((Z|0)==0){break}else{Y=Z}}do{if((T|0)==901){if((c[Y+12>>2]&8|0)!=0){break}c[ak>>2]=ab;S=Y+4|0;c[S>>2]=(c[S>>2]|0)+aa;S=ab+8|0;if((S&7|0)==0){al=0}else{al=-S&7}S=ab+(aa+8)|0;if((S&7|0)==0){am=0}else{am=-S&7}S=ab+(am+aa)|0;Z=S;W=al+o|0;ac=ab+W|0;_=ac;K=S-(ab+al)-o|0;c[ab+(al+4)>>2]=o|3;do{if((Z|0)==(c[234]|0)){J=(c[231]|0)+K|0;c[231]=J;c[234]=_;c[ab+(W+4)>>2]=J|1}else{if((Z|0)==(c[233]|0)){J=(c[230]|0)+K|0;c[230]=J;c[233]=_;c[ab+(W+4)>>2]=J|1;c[ab+(J+W)>>2]=J;break}J=aa+4|0;X=c[ab+(am+J)>>2]|0;if((X&3|0)==1){$=X&-8;V=X>>>3;L1267:do{if(X>>>0<256){U=c[ab+((am|8)+aa)>>2]|0;Q=c[ab+(aa+12+am)>>2]|0;R=952+(V<<1<<2)|0;do{if((U|0)!=(R|0)){if(U>>>0<(c[232]|0)>>>0){aj();return 0}if((c[U+12>>2]|0)==(Z|0)){break}aj();return 0}}while(0);if((Q|0)==(U|0)){c[228]=c[228]&~(1<<V);break}do{if((Q|0)==(R|0)){an=Q+8|0}else{if(Q>>>0<(c[232]|0)>>>0){aj();return 0}m=Q+8|0;if((c[m>>2]|0)==(Z|0)){an=m;break}aj();return 0}}while(0);c[U+12>>2]=Q;c[an>>2]=U}else{R=S;m=c[ab+((am|24)+aa)>>2]|0;P=c[ab+(aa+12+am)>>2]|0;do{if((P|0)==(R|0)){O=am|16;g=ab+(O+J)|0;L=c[g>>2]|0;if((L|0)==0){e=ab+(O+aa)|0;O=c[e>>2]|0;if((O|0)==0){ap=0;break}else{aq=O;ar=e}}else{aq=L;ar=g}while(1){g=aq+20|0;L=c[g>>2]|0;if((L|0)!=0){aq=L;ar=g;continue}g=aq+16|0;L=c[g>>2]|0;if((L|0)==0){break}else{aq=L;ar=g}}if(ar>>>0<(c[232]|0)>>>0){aj();return 0}else{c[ar>>2]=0;ap=aq;break}}else{g=c[ab+((am|8)+aa)>>2]|0;if(g>>>0<(c[232]|0)>>>0){aj();return 0}L=g+12|0;if((c[L>>2]|0)!=(R|0)){aj();return 0}e=P+8|0;if((c[e>>2]|0)==(R|0)){c[L>>2]=P;c[e>>2]=g;ap=P;break}else{aj();return 0}}}while(0);if((m|0)==0){break}P=ab+(aa+28+am)|0;U=1216+(c[P>>2]<<2)|0;do{if((R|0)==(c[U>>2]|0)){c[U>>2]=ap;if((ap|0)!=0){break}c[229]=c[229]&~(1<<c[P>>2]);break L1267}else{if(m>>>0<(c[232]|0)>>>0){aj();return 0}Q=m+16|0;if((c[Q>>2]|0)==(R|0)){c[Q>>2]=ap}else{c[m+20>>2]=ap}if((ap|0)==0){break L1267}}}while(0);if(ap>>>0<(c[232]|0)>>>0){aj();return 0}c[ap+24>>2]=m;R=am|16;P=c[ab+(R+aa)>>2]|0;do{if((P|0)!=0){if(P>>>0<(c[232]|0)>>>0){aj();return 0}else{c[ap+16>>2]=P;c[P+24>>2]=ap;break}}}while(0);P=c[ab+(R+J)>>2]|0;if((P|0)==0){break}if(P>>>0<(c[232]|0)>>>0){aj();return 0}else{c[ap+20>>2]=P;c[P+24>>2]=ap;break}}}while(0);as=ab+(($|am)+aa)|0;at=$+K|0}else{as=Z;at=K}J=as+4|0;c[J>>2]=c[J>>2]&-2;c[ab+(W+4)>>2]=at|1;c[ab+(at+W)>>2]=at;J=at>>>3;if(at>>>0<256){V=J<<1;X=952+(V<<2)|0;P=c[228]|0;m=1<<J;do{if((P&m|0)==0){c[228]=P|m;au=X;av=952+(V+2<<2)|0}else{J=952+(V+2<<2)|0;U=c[J>>2]|0;if(U>>>0>=(c[232]|0)>>>0){au=U;av=J;break}aj();return 0}}while(0);c[av>>2]=_;c[au+12>>2]=_;c[ab+(W+8)>>2]=au;c[ab+(W+12)>>2]=X;break}V=ac;m=at>>>8;do{if((m|0)==0){aw=0}else{if(at>>>0>16777215){aw=31;break}P=(m+1048320|0)>>>16&8;$=m<<P;J=($+520192|0)>>>16&4;U=$<<J;$=(U+245760|0)>>>16&2;Q=14-(J|P|$)+(U<<$>>>15)|0;aw=at>>>((Q+7|0)>>>0)&1|Q<<1}}while(0);m=1216+(aw<<2)|0;c[ab+(W+28)>>2]=aw;c[ab+(W+20)>>2]=0;c[ab+(W+16)>>2]=0;X=c[229]|0;Q=1<<aw;if((X&Q|0)==0){c[229]=X|Q;c[m>>2]=V;c[ab+(W+24)>>2]=m;c[ab+(W+12)>>2]=V;c[ab+(W+8)>>2]=V;break}if((aw|0)==31){ax=0}else{ax=25-(aw>>>1)|0}Q=at<<ax;X=c[m>>2]|0;while(1){if((c[X+4>>2]&-8|0)==(at|0)){break}aA=X+16+(Q>>>31<<2)|0;m=c[aA>>2]|0;if((m|0)==0){T=974;break}else{Q=Q<<1;X=m}}if((T|0)==974){if(aA>>>0<(c[232]|0)>>>0){aj();return 0}else{c[aA>>2]=V;c[ab+(W+24)>>2]=X;c[ab+(W+12)>>2]=V;c[ab+(W+8)>>2]=V;break}}Q=X+8|0;m=c[Q>>2]|0;$=c[232]|0;if(X>>>0<$>>>0){aj();return 0}if(m>>>0<$>>>0){aj();return 0}else{c[m+12>>2]=V;c[Q>>2]=V;c[ab+(W+8)>>2]=m;c[ab+(W+12)>>2]=X;c[ab+(W+24)>>2]=0;break}}}while(0);n=ab+(al|8)|0;return n|0}}while(0);Y=ad;W=1360;while(1){aB=c[W>>2]|0;if(aB>>>0<=Y>>>0){aD=c[W+4>>2]|0;aE=aB+aD|0;if(aE>>>0>Y>>>0){break}}W=c[W+8>>2]|0}W=aB+(aD-39)|0;if((W&7|0)==0){aF=0}else{aF=-W&7}W=aB+(aD-47+aF)|0;ac=W>>>0<(ad+16|0)>>>0?Y:W;W=ac+8|0;_=ab+8|0;if((_&7|0)==0){aG=0}else{aG=-_&7}_=aa-40-aG|0;c[234]=ab+aG;c[231]=_;c[ab+(aG+4)>>2]=_|1;c[ab+(aa-36)>>2]=40;c[235]=c[226];c[ac+4>>2]=27;c[W>>2]=c[340];c[W+4>>2]=c[341];c[W+8>>2]=c[342];c[W+12>>2]=c[343];c[340]=ab;c[341]=aa;c[343]=0;c[342]=W;W=ac+28|0;c[W>>2]=7;if((ac+32|0)>>>0<aE>>>0){_=W;while(1){W=_+4|0;c[W>>2]=7;if((_+8|0)>>>0<aE>>>0){_=W}else{break}}}if((ac|0)==(Y|0)){break}_=ac-ad|0;W=Y+(_+4)|0;c[W>>2]=c[W>>2]&-2;c[ad+4>>2]=_|1;c[Y+_>>2]=_;W=_>>>3;if(_>>>0<256){K=W<<1;Z=952+(K<<2)|0;S=c[228]|0;m=1<<W;do{if((S&m|0)==0){c[228]=S|m;aH=Z;aI=952+(K+2<<2)|0}else{W=952+(K+2<<2)|0;Q=c[W>>2]|0;if(Q>>>0>=(c[232]|0)>>>0){aH=Q;aI=W;break}aj();return 0}}while(0);c[aI>>2]=ad;c[aH+12>>2]=ad;c[ad+8>>2]=aH;c[ad+12>>2]=Z;break}K=ad;m=_>>>8;do{if((m|0)==0){aJ=0}else{if(_>>>0>16777215){aJ=31;break}S=(m+1048320|0)>>>16&8;Y=m<<S;ac=(Y+520192|0)>>>16&4;W=Y<<ac;Y=(W+245760|0)>>>16&2;Q=14-(ac|S|Y)+(W<<Y>>>15)|0;aJ=_>>>((Q+7|0)>>>0)&1|Q<<1}}while(0);m=1216+(aJ<<2)|0;c[ad+28>>2]=aJ;c[ad+20>>2]=0;c[ad+16>>2]=0;Z=c[229]|0;Q=1<<aJ;if((Z&Q|0)==0){c[229]=Z|Q;c[m>>2]=K;c[ad+24>>2]=m;c[ad+12>>2]=ad;c[ad+8>>2]=ad;break}if((aJ|0)==31){aK=0}else{aK=25-(aJ>>>1)|0}Q=_<<aK;Z=c[m>>2]|0;while(1){if((c[Z+4>>2]&-8|0)==(_|0)){break}aL=Z+16+(Q>>>31<<2)|0;m=c[aL>>2]|0;if((m|0)==0){T=1009;break}else{Q=Q<<1;Z=m}}if((T|0)==1009){if(aL>>>0<(c[232]|0)>>>0){aj();return 0}else{c[aL>>2]=K;c[ad+24>>2]=Z;c[ad+12>>2]=ad;c[ad+8>>2]=ad;break}}Q=Z+8|0;_=c[Q>>2]|0;m=c[232]|0;if(Z>>>0<m>>>0){aj();return 0}if(_>>>0<m>>>0){aj();return 0}else{c[_+12>>2]=K;c[Q>>2]=K;c[ad+8>>2]=_;c[ad+12>>2]=Z;c[ad+24>>2]=0;break}}}while(0);ad=c[231]|0;if(ad>>>0<=o>>>0){break}_=ad-o|0;c[231]=_;ad=c[234]|0;Q=ad;c[234]=Q+o;c[Q+(o+4)>>2]=_|1;c[ad+4>>2]=o|3;n=ad+8|0;return n|0}}while(0);c[(az()|0)>>2]=12;n=0;return n|0}function bf(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0;if((a|0)==0){return}b=a-8|0;d=b;e=c[232]|0;if(b>>>0<e>>>0){aj()}f=c[a-4>>2]|0;g=f&3;if((g|0)==1){aj()}h=f&-8;i=a+(h-8)|0;j=i;L1439:do{if((f&1|0)==0){k=c[b>>2]|0;if((g|0)==0){return}l=-8-k|0;m=a+l|0;n=m;o=k+h|0;if(m>>>0<e>>>0){aj()}if((n|0)==(c[233]|0)){p=a+(h-4)|0;if((c[p>>2]&3|0)!=3){q=n;r=o;break}c[230]=o;c[p>>2]=c[p>>2]&-2;c[a+(l+4)>>2]=o|1;c[i>>2]=o;return}p=k>>>3;if(k>>>0<256){k=c[a+(l+8)>>2]|0;s=c[a+(l+12)>>2]|0;t=952+(p<<1<<2)|0;do{if((k|0)!=(t|0)){if(k>>>0<e>>>0){aj()}if((c[k+12>>2]|0)==(n|0)){break}aj()}}while(0);if((s|0)==(k|0)){c[228]=c[228]&~(1<<p);q=n;r=o;break}do{if((s|0)==(t|0)){u=s+8|0}else{if(s>>>0<e>>>0){aj()}v=s+8|0;if((c[v>>2]|0)==(n|0)){u=v;break}aj()}}while(0);c[k+12>>2]=s;c[u>>2]=k;q=n;r=o;break}t=m;p=c[a+(l+24)>>2]|0;v=c[a+(l+12)>>2]|0;do{if((v|0)==(t|0)){w=a+(l+20)|0;x=c[w>>2]|0;if((x|0)==0){y=a+(l+16)|0;z=c[y>>2]|0;if((z|0)==0){A=0;break}else{B=z;C=y}}else{B=x;C=w}while(1){w=B+20|0;x=c[w>>2]|0;if((x|0)!=0){B=x;C=w;continue}w=B+16|0;x=c[w>>2]|0;if((x|0)==0){break}else{B=x;C=w}}if(C>>>0<e>>>0){aj()}else{c[C>>2]=0;A=B;break}}else{w=c[a+(l+8)>>2]|0;if(w>>>0<e>>>0){aj()}x=w+12|0;if((c[x>>2]|0)!=(t|0)){aj()}y=v+8|0;if((c[y>>2]|0)==(t|0)){c[x>>2]=v;c[y>>2]=w;A=v;break}else{aj()}}}while(0);if((p|0)==0){q=n;r=o;break}v=a+(l+28)|0;m=1216+(c[v>>2]<<2)|0;do{if((t|0)==(c[m>>2]|0)){c[m>>2]=A;if((A|0)!=0){break}c[229]=c[229]&~(1<<c[v>>2]);q=n;r=o;break L1439}else{if(p>>>0<(c[232]|0)>>>0){aj()}k=p+16|0;if((c[k>>2]|0)==(t|0)){c[k>>2]=A}else{c[p+20>>2]=A}if((A|0)==0){q=n;r=o;break L1439}}}while(0);if(A>>>0<(c[232]|0)>>>0){aj()}c[A+24>>2]=p;t=c[a+(l+16)>>2]|0;do{if((t|0)!=0){if(t>>>0<(c[232]|0)>>>0){aj()}else{c[A+16>>2]=t;c[t+24>>2]=A;break}}}while(0);t=c[a+(l+20)>>2]|0;if((t|0)==0){q=n;r=o;break}if(t>>>0<(c[232]|0)>>>0){aj()}else{c[A+20>>2]=t;c[t+24>>2]=A;q=n;r=o;break}}else{q=d;r=h}}while(0);d=q;if(d>>>0>=i>>>0){aj()}A=a+(h-4)|0;e=c[A>>2]|0;if((e&1|0)==0){aj()}do{if((e&2|0)==0){if((j|0)==(c[234]|0)){B=(c[231]|0)+r|0;c[231]=B;c[234]=q;c[q+4>>2]=B|1;if((q|0)!=(c[233]|0)){return}c[233]=0;c[230]=0;return}if((j|0)==(c[233]|0)){B=(c[230]|0)+r|0;c[230]=B;c[233]=q;c[q+4>>2]=B|1;c[d+B>>2]=B;return}B=(e&-8)+r|0;C=e>>>3;L1542:do{if(e>>>0<256){u=c[a+h>>2]|0;g=c[a+(h|4)>>2]|0;b=952+(C<<1<<2)|0;do{if((u|0)!=(b|0)){if(u>>>0<(c[232]|0)>>>0){aj()}if((c[u+12>>2]|0)==(j|0)){break}aj()}}while(0);if((g|0)==(u|0)){c[228]=c[228]&~(1<<C);break}do{if((g|0)==(b|0)){D=g+8|0}else{if(g>>>0<(c[232]|0)>>>0){aj()}f=g+8|0;if((c[f>>2]|0)==(j|0)){D=f;break}aj()}}while(0);c[u+12>>2]=g;c[D>>2]=u}else{b=i;f=c[a+(h+16)>>2]|0;t=c[a+(h|4)>>2]|0;do{if((t|0)==(b|0)){p=a+(h+12)|0;v=c[p>>2]|0;if((v|0)==0){m=a+(h+8)|0;k=c[m>>2]|0;if((k|0)==0){E=0;break}else{F=k;G=m}}else{F=v;G=p}while(1){p=F+20|0;v=c[p>>2]|0;if((v|0)!=0){F=v;G=p;continue}p=F+16|0;v=c[p>>2]|0;if((v|0)==0){break}else{F=v;G=p}}if(G>>>0<(c[232]|0)>>>0){aj()}else{c[G>>2]=0;E=F;break}}else{p=c[a+h>>2]|0;if(p>>>0<(c[232]|0)>>>0){aj()}v=p+12|0;if((c[v>>2]|0)!=(b|0)){aj()}m=t+8|0;if((c[m>>2]|0)==(b|0)){c[v>>2]=t;c[m>>2]=p;E=t;break}else{aj()}}}while(0);if((f|0)==0){break}t=a+(h+20)|0;u=1216+(c[t>>2]<<2)|0;do{if((b|0)==(c[u>>2]|0)){c[u>>2]=E;if((E|0)!=0){break}c[229]=c[229]&~(1<<c[t>>2]);break L1542}else{if(f>>>0<(c[232]|0)>>>0){aj()}g=f+16|0;if((c[g>>2]|0)==(b|0)){c[g>>2]=E}else{c[f+20>>2]=E}if((E|0)==0){break L1542}}}while(0);if(E>>>0<(c[232]|0)>>>0){aj()}c[E+24>>2]=f;b=c[a+(h+8)>>2]|0;do{if((b|0)!=0){if(b>>>0<(c[232]|0)>>>0){aj()}else{c[E+16>>2]=b;c[b+24>>2]=E;break}}}while(0);b=c[a+(h+12)>>2]|0;if((b|0)==0){break}if(b>>>0<(c[232]|0)>>>0){aj()}else{c[E+20>>2]=b;c[b+24>>2]=E;break}}}while(0);c[q+4>>2]=B|1;c[d+B>>2]=B;if((q|0)!=(c[233]|0)){H=B;break}c[230]=B;return}else{c[A>>2]=e&-2;c[q+4>>2]=r|1;c[d+r>>2]=r;H=r}}while(0);r=H>>>3;if(H>>>0<256){d=r<<1;e=952+(d<<2)|0;A=c[228]|0;E=1<<r;do{if((A&E|0)==0){c[228]=A|E;I=e;J=952+(d+2<<2)|0}else{r=952+(d+2<<2)|0;h=c[r>>2]|0;if(h>>>0>=(c[232]|0)>>>0){I=h;J=r;break}aj()}}while(0);c[J>>2]=q;c[I+12>>2]=q;c[q+8>>2]=I;c[q+12>>2]=e;return}e=q;I=H>>>8;do{if((I|0)==0){K=0}else{if(H>>>0>16777215){K=31;break}J=(I+1048320|0)>>>16&8;d=I<<J;E=(d+520192|0)>>>16&4;A=d<<E;d=(A+245760|0)>>>16&2;r=14-(E|J|d)+(A<<d>>>15)|0;K=H>>>((r+7|0)>>>0)&1|r<<1}}while(0);I=1216+(K<<2)|0;c[q+28>>2]=K;c[q+20>>2]=0;c[q+16>>2]=0;r=c[229]|0;d=1<<K;do{if((r&d|0)==0){c[229]=r|d;c[I>>2]=e;c[q+24>>2]=I;c[q+12>>2]=q;c[q+8>>2]=q}else{if((K|0)==31){L=0}else{L=25-(K>>>1)|0}A=H<<L;J=c[I>>2]|0;while(1){if((c[J+4>>2]&-8|0)==(H|0)){break}M=J+16+(A>>>31<<2)|0;E=c[M>>2]|0;if((E|0)==0){N=1186;break}else{A=A<<1;J=E}}if((N|0)==1186){if(M>>>0<(c[232]|0)>>>0){aj()}else{c[M>>2]=e;c[q+24>>2]=J;c[q+12>>2]=q;c[q+8>>2]=q;break}}A=J+8|0;B=c[A>>2]|0;E=c[232]|0;if(J>>>0<E>>>0){aj()}if(B>>>0<E>>>0){aj()}else{c[B+12>>2]=e;c[A>>2]=e;c[q+8>>2]=B;c[q+12>>2]=J;c[q+24>>2]=0;break}}}while(0);q=(c[236]|0)-1|0;c[236]=q;if((q|0)==0){O=1368}else{return}while(1){q=c[O>>2]|0;if((q|0)==0){break}else{O=q+8|0}}c[236]=-1;return}function bg(a,b){a=a|0;b=b|0;var d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0;if((a|0)==0){d=be(b)|0;return d|0}if(b>>>0>4294967231){c[(az()|0)>>2]=12;d=0;return d|0}if(b>>>0<11){e=16}else{e=b+11&-8}f=a-8|0;g=a-4|0;h=c[g>>2]|0;i=h&-8;j=i-8|0;k=a+j|0;l=k;m=c[232]|0;if(f>>>0<m>>>0){aj();return 0}n=h&3;if(!((n|0)!=1&(j|0)>-8)){aj();return 0}j=i|4;o=a+(j-8)|0;p=c[o>>2]|0;if((p&1|0)==0){aj();return 0}L1677:do{if((n|0)==0){if(e>>>0<256|i>>>0<(e|4)>>>0){break}if((i-e|0)>>>0>c[224]<<1>>>0|(f|0)==0){break}else{d=a}return d|0}else{do{if(i>>>0<e>>>0){if((l|0)==(c[234]|0)){q=(c[231]|0)+i|0;if(q>>>0<=e>>>0){break L1677}r=q-e|0;c[g>>2]=h&1|e|2;c[a+((e|4)-8)>>2]=r|1;c[234]=a+(e-8);c[231]=r;break}if((l|0)==(c[233]|0)){r=(c[230]|0)+i|0;if(r>>>0<e>>>0){break L1677}q=r-e|0;if(q>>>0>15){c[g>>2]=h&1|e|2;c[a+((e|4)-8)>>2]=q|1;c[a+(r-8)>>2]=q;s=a+(r-4)|0;c[s>>2]=c[s>>2]&-2;t=a+(e-8)|0;u=q}else{c[g>>2]=h&1|r|2;q=a+(r-4)|0;c[q>>2]=c[q>>2]|1;t=0;u=0}c[230]=u;c[233]=t;break}if((p&2|0)!=0){break L1677}q=(p&-8)+i|0;if(q>>>0<e>>>0){break L1677}r=q-e|0;s=p>>>3;L1695:do{if(p>>>0<256){v=c[a+i>>2]|0;w=c[a+j>>2]|0;x=952+(s<<1<<2)|0;do{if((v|0)!=(x|0)){if(v>>>0<m>>>0){aj();return 0}if((c[v+12>>2]|0)==(l|0)){break}aj();return 0}}while(0);if((w|0)==(v|0)){c[228]=c[228]&~(1<<s);break}do{if((w|0)==(x|0)){y=w+8|0}else{if(w>>>0<m>>>0){aj();return 0}z=w+8|0;if((c[z>>2]|0)==(l|0)){y=z;break}aj();return 0}}while(0);c[v+12>>2]=w;c[y>>2]=v}else{x=k;z=c[a+(i+16)>>2]|0;A=c[a+j>>2]|0;do{if((A|0)==(x|0)){B=a+(i+12)|0;C=c[B>>2]|0;if((C|0)==0){D=a+(i+8)|0;E=c[D>>2]|0;if((E|0)==0){F=0;break}else{G=E;H=D}}else{G=C;H=B}while(1){B=G+20|0;C=c[B>>2]|0;if((C|0)!=0){G=C;H=B;continue}B=G+16|0;C=c[B>>2]|0;if((C|0)==0){break}else{G=C;H=B}}if(H>>>0<m>>>0){aj();return 0}else{c[H>>2]=0;F=G;break}}else{B=c[a+i>>2]|0;if(B>>>0<m>>>0){aj();return 0}C=B+12|0;if((c[C>>2]|0)!=(x|0)){aj();return 0}D=A+8|0;if((c[D>>2]|0)==(x|0)){c[C>>2]=A;c[D>>2]=B;F=A;break}else{aj();return 0}}}while(0);if((z|0)==0){break}A=a+(i+20)|0;v=1216+(c[A>>2]<<2)|0;do{if((x|0)==(c[v>>2]|0)){c[v>>2]=F;if((F|0)!=0){break}c[229]=c[229]&~(1<<c[A>>2]);break L1695}else{if(z>>>0<(c[232]|0)>>>0){aj();return 0}w=z+16|0;if((c[w>>2]|0)==(x|0)){c[w>>2]=F}else{c[z+20>>2]=F}if((F|0)==0){break L1695}}}while(0);if(F>>>0<(c[232]|0)>>>0){aj();return 0}c[F+24>>2]=z;x=c[a+(i+8)>>2]|0;do{if((x|0)!=0){if(x>>>0<(c[232]|0)>>>0){aj();return 0}else{c[F+16>>2]=x;c[x+24>>2]=F;break}}}while(0);x=c[a+(i+12)>>2]|0;if((x|0)==0){break}if(x>>>0<(c[232]|0)>>>0){aj();return 0}else{c[F+20>>2]=x;c[x+24>>2]=F;break}}}while(0);if(r>>>0>=16){c[g>>2]=c[g>>2]&1|e|2;c[a+((e|4)-8)>>2]=r|3;s=a+((q|4)-8)|0;c[s>>2]=c[s>>2]|1;bh(a+(e-8)|0,r);break}c[g>>2]=q|c[g>>2]&1|2;s=a+((q|4)-8)|0;c[s>>2]=c[s>>2]|1;d=a;return d|0}else{s=i-e|0;if(s>>>0<=15){break}c[g>>2]=h&1|e|2;c[a+((e|4)-8)>>2]=s|3;c[o>>2]=c[o>>2]|1;bh(a+(e-8)|0,s);d=a;return d|0}}while(0);if((f|0)==0){break}else{d=a}return d|0}}while(0);f=be(b)|0;if((f|0)==0){d=0;return d|0}e=c[g>>2]|0;g=(e&-8)-((e&3|0)==0?8:4)|0;e=g>>>0<b>>>0?g:b;bk(f|0,a|0,e)|0;bf(a);d=f;return d|0}function bh(a,b){a=a|0;b=b|0;var d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0;d=a;e=d+b|0;f=e;g=c[a+4>>2]|0;L1783:do{if((g&1|0)==0){h=c[a>>2]|0;if((g&3|0)==0){return}i=d+(-h|0)|0;j=i;k=h+b|0;l=c[232]|0;if(i>>>0<l>>>0){aj()}if((j|0)==(c[233]|0)){m=d+(b+4)|0;if((c[m>>2]&3|0)!=3){n=j;o=k;break}c[230]=k;c[m>>2]=c[m>>2]&-2;c[d+(4-h)>>2]=k|1;c[e>>2]=k;return}m=h>>>3;if(h>>>0<256){p=c[d+(8-h)>>2]|0;q=c[d+(12-h)>>2]|0;r=952+(m<<1<<2)|0;do{if((p|0)!=(r|0)){if(p>>>0<l>>>0){aj()}if((c[p+12>>2]|0)==(j|0)){break}aj()}}while(0);if((q|0)==(p|0)){c[228]=c[228]&~(1<<m);n=j;o=k;break}do{if((q|0)==(r|0)){s=q+8|0}else{if(q>>>0<l>>>0){aj()}t=q+8|0;if((c[t>>2]|0)==(j|0)){s=t;break}aj()}}while(0);c[p+12>>2]=q;c[s>>2]=p;n=j;o=k;break}r=i;m=c[d+(24-h)>>2]|0;t=c[d+(12-h)>>2]|0;do{if((t|0)==(r|0)){u=16-h|0;v=d+(u+4)|0;w=c[v>>2]|0;if((w|0)==0){x=d+u|0;u=c[x>>2]|0;if((u|0)==0){y=0;break}else{z=u;A=x}}else{z=w;A=v}while(1){v=z+20|0;w=c[v>>2]|0;if((w|0)!=0){z=w;A=v;continue}v=z+16|0;w=c[v>>2]|0;if((w|0)==0){break}else{z=w;A=v}}if(A>>>0<l>>>0){aj()}else{c[A>>2]=0;y=z;break}}else{v=c[d+(8-h)>>2]|0;if(v>>>0<l>>>0){aj()}w=v+12|0;if((c[w>>2]|0)!=(r|0)){aj()}x=t+8|0;if((c[x>>2]|0)==(r|0)){c[w>>2]=t;c[x>>2]=v;y=t;break}else{aj()}}}while(0);if((m|0)==0){n=j;o=k;break}t=d+(28-h)|0;l=1216+(c[t>>2]<<2)|0;do{if((r|0)==(c[l>>2]|0)){c[l>>2]=y;if((y|0)!=0){break}c[229]=c[229]&~(1<<c[t>>2]);n=j;o=k;break L1783}else{if(m>>>0<(c[232]|0)>>>0){aj()}i=m+16|0;if((c[i>>2]|0)==(r|0)){c[i>>2]=y}else{c[m+20>>2]=y}if((y|0)==0){n=j;o=k;break L1783}}}while(0);if(y>>>0<(c[232]|0)>>>0){aj()}c[y+24>>2]=m;r=16-h|0;t=c[d+r>>2]|0;do{if((t|0)!=0){if(t>>>0<(c[232]|0)>>>0){aj()}else{c[y+16>>2]=t;c[t+24>>2]=y;break}}}while(0);t=c[d+(r+4)>>2]|0;if((t|0)==0){n=j;o=k;break}if(t>>>0<(c[232]|0)>>>0){aj()}else{c[y+20>>2]=t;c[t+24>>2]=y;n=j;o=k;break}}else{n=a;o=b}}while(0);a=c[232]|0;if(e>>>0<a>>>0){aj()}y=d+(b+4)|0;z=c[y>>2]|0;do{if((z&2|0)==0){if((f|0)==(c[234]|0)){A=(c[231]|0)+o|0;c[231]=A;c[234]=n;c[n+4>>2]=A|1;if((n|0)!=(c[233]|0)){return}c[233]=0;c[230]=0;return}if((f|0)==(c[233]|0)){A=(c[230]|0)+o|0;c[230]=A;c[233]=n;c[n+4>>2]=A|1;c[n+A>>2]=A;return}A=(z&-8)+o|0;s=z>>>3;L1883:do{if(z>>>0<256){g=c[d+(b+8)>>2]|0;t=c[d+(b+12)>>2]|0;h=952+(s<<1<<2)|0;do{if((g|0)!=(h|0)){if(g>>>0<a>>>0){aj()}if((c[g+12>>2]|0)==(f|0)){break}aj()}}while(0);if((t|0)==(g|0)){c[228]=c[228]&~(1<<s);break}do{if((t|0)==(h|0)){B=t+8|0}else{if(t>>>0<a>>>0){aj()}m=t+8|0;if((c[m>>2]|0)==(f|0)){B=m;break}aj()}}while(0);c[g+12>>2]=t;c[B>>2]=g}else{h=e;m=c[d+(b+24)>>2]|0;l=c[d+(b+12)>>2]|0;do{if((l|0)==(h|0)){i=d+(b+20)|0;p=c[i>>2]|0;if((p|0)==0){q=d+(b+16)|0;v=c[q>>2]|0;if((v|0)==0){C=0;break}else{D=v;E=q}}else{D=p;E=i}while(1){i=D+20|0;p=c[i>>2]|0;if((p|0)!=0){D=p;E=i;continue}i=D+16|0;p=c[i>>2]|0;if((p|0)==0){break}else{D=p;E=i}}if(E>>>0<a>>>0){aj()}else{c[E>>2]=0;C=D;break}}else{i=c[d+(b+8)>>2]|0;if(i>>>0<a>>>0){aj()}p=i+12|0;if((c[p>>2]|0)!=(h|0)){aj()}q=l+8|0;if((c[q>>2]|0)==(h|0)){c[p>>2]=l;c[q>>2]=i;C=l;break}else{aj()}}}while(0);if((m|0)==0){break}l=d+(b+28)|0;g=1216+(c[l>>2]<<2)|0;do{if((h|0)==(c[g>>2]|0)){c[g>>2]=C;if((C|0)!=0){break}c[229]=c[229]&~(1<<c[l>>2]);break L1883}else{if(m>>>0<(c[232]|0)>>>0){aj()}t=m+16|0;if((c[t>>2]|0)==(h|0)){c[t>>2]=C}else{c[m+20>>2]=C}if((C|0)==0){break L1883}}}while(0);if(C>>>0<(c[232]|0)>>>0){aj()}c[C+24>>2]=m;h=c[d+(b+16)>>2]|0;do{if((h|0)!=0){if(h>>>0<(c[232]|0)>>>0){aj()}else{c[C+16>>2]=h;c[h+24>>2]=C;break}}}while(0);h=c[d+(b+20)>>2]|0;if((h|0)==0){break}if(h>>>0<(c[232]|0)>>>0){aj()}else{c[C+20>>2]=h;c[h+24>>2]=C;break}}}while(0);c[n+4>>2]=A|1;c[n+A>>2]=A;if((n|0)!=(c[233]|0)){F=A;break}c[230]=A;return}else{c[y>>2]=z&-2;c[n+4>>2]=o|1;c[n+o>>2]=o;F=o}}while(0);o=F>>>3;if(F>>>0<256){z=o<<1;y=952+(z<<2)|0;C=c[228]|0;b=1<<o;do{if((C&b|0)==0){c[228]=C|b;G=y;H=952+(z+2<<2)|0}else{o=952+(z+2<<2)|0;d=c[o>>2]|0;if(d>>>0>=(c[232]|0)>>>0){G=d;H=o;break}aj()}}while(0);c[H>>2]=n;c[G+12>>2]=n;c[n+8>>2]=G;c[n+12>>2]=y;return}y=n;G=F>>>8;do{if((G|0)==0){I=0}else{if(F>>>0>16777215){I=31;break}H=(G+1048320|0)>>>16&8;z=G<<H;b=(z+520192|0)>>>16&4;C=z<<b;z=(C+245760|0)>>>16&2;o=14-(b|H|z)+(C<<z>>>15)|0;I=F>>>((o+7|0)>>>0)&1|o<<1}}while(0);G=1216+(I<<2)|0;c[n+28>>2]=I;c[n+20>>2]=0;c[n+16>>2]=0;o=c[229]|0;z=1<<I;if((o&z|0)==0){c[229]=o|z;c[G>>2]=y;c[n+24>>2]=G;c[n+12>>2]=n;c[n+8>>2]=n;return}if((I|0)==31){J=0}else{J=25-(I>>>1)|0}I=F<<J;J=c[G>>2]|0;while(1){if((c[J+4>>2]&-8|0)==(F|0)){break}K=J+16+(I>>>31<<2)|0;G=c[K>>2]|0;if((G|0)==0){L=1452;break}else{I=I<<1;J=G}}if((L|0)==1452){if(K>>>0<(c[232]|0)>>>0){aj()}c[K>>2]=y;c[n+24>>2]=J;c[n+12>>2]=n;c[n+8>>2]=n;return}K=J+8|0;L=c[K>>2]|0;I=c[232]|0;if(J>>>0<I>>>0){aj()}if(L>>>0<I>>>0){aj()}c[L+12>>2]=y;c[K>>2]=y;c[n+8>>2]=L;c[n+12>>2]=J;c[n+24>>2]=0;return}function bi(b){b=b|0;var c=0;c=b;while(a[c]|0){c=c+1|0}return c-b|0}function bj(b,d,e){b=b|0;d=d|0;e=e|0;var f=0,g=0,h=0;f=b+e|0;if((e|0)>=20){d=d&255;e=b&3;g=d|d<<8|d<<16|d<<24;h=f&~3;if(e){e=b+4-e|0;while((b|0)<(e|0)){a[b]=d;b=b+1|0}}while((b|0)<(h|0)){c[b>>2]=g;b=b+4|0}}while((b|0)<(f|0)){a[b]=d;b=b+1|0}}function bk(b,d,e){b=b|0;d=d|0;e=e|0;var f=0;f=b|0;if((b&3)==(d&3)){while(b&3){if((e|0)==0)return f|0;a[b]=a[d]|0;b=b+1|0;d=d+1|0;e=e-1|0}while((e|0)>=4){c[b>>2]=c[d>>2];b=b+4|0;d=d+4|0;e=e-4|0}}while((e|0)>0){a[b]=a[d]|0;b=b+1|0;d=d+1|0;e=e-1|0}return f|0}function bl(a,b){a=a|0;b=b|0;return aE[a&1](b|0)|0}function bm(a){a=a|0;aF[a&1]()}function bn(a,b,c){a=a|0;b=b|0;c=c|0;return aG[a&1](b|0,c|0)|0}function bo(a,b){a=a|0;b=b|0;aH[a&1](b|0)}function bp(a){a=a|0;_(0);return 0}function bq(){_(1)}function br(a,b){a=a|0;b=b|0;_(2);return 0}function bs(a){a=a|0;_(3)}\n // EMSCRIPTEN_END_FUNCS\n var aE=[bp,bp];var aF=[bq,bq];var aG=[br,br];var aH=[bs,bs];return{_strlen:bi,_crn_get_levels:a8,_crn_get_uncompressed_size:bb,_crn_decompress:bc,_crn_get_width:a6,_realloc:bg,_crn_get_bytes_per_block:ba,_memset:bj,_malloc:be,_memcpy:bk,_free:bf,_crn_get_height:a7,_crn_get_dxt_format:a9,runPostSets:aY,stackAlloc:aI,stackSave:aJ,stackRestore:aK,setThrew:aL,setTempRet0:aO,setTempRet1:aP,setTempRet2:aQ,setTempRet3:aR,setTempRet4:aS,setTempRet5:aT,setTempRet6:aU,setTempRet7:aV,setTempRet8:aW,setTempRet9:aX,dynCall_ii:bl,dynCall_v:bm,dynCall_iii:bn,dynCall_vi:bo}\n // EMSCRIPTEN_END_ASM\n })({Math:Math,Int8Array:Int8Array,Int16Array:Int16Array,Int32Array:Int32Array,Uint8Array:Uint8Array,Uint16Array:Uint16Array,Uint32Array:Uint32Array,Float32Array:Float32Array,Float64Array:Float64Array},{abort:E,assert:A,asmPrintInt:function(a,b){s.print(\"int \"+a+\",\"+b)},asmPrintFloat:function(a,b){s.print(\"float \"+a+\",\"+b)},min:Ca,invoke_ii:function(a,b){try{return s.dynCall_ii(a,b)}catch(c){\"number\"!==typeof c&&\"longjmp\"!==c&&e(c),$.setThrew(1,0)}},invoke_v:function(a){try{s.dynCall_v(a)}catch(b){\"number\"!==\n typeof b&&\"longjmp\"!==b&&e(b),$.setThrew(1,0)}},invoke_iii:function(a,b,c){try{return s.dynCall_iii(a,b,c)}catch(d){\"number\"!==typeof d&&\"longjmp\"!==d&&e(d),$.setThrew(1,0)}},invoke_vi:function(a,b){try{s.dynCall_vi(a,b)}catch(c){\"number\"!==typeof c&&\"longjmp\"!==c&&e(c),$.setThrew(1,0)}},_llvm_lifetime_end:q(),_snprintf:nb,_abort:function(){s.abort()},_fprintf:jc,_printf:function(a,b){return jc(K[Cb>>2],a,b)},_fflush:q(),__reallyNegative:lb,_sysconf:function(a){switch(a){case 30:return 4096;case 132:case 133:case 12:case 137:case 138:case 15:case 235:case 16:case 17:case 18:case 19:case 20:case 149:case 13:case 10:case 236:case 153:case 9:case 21:case 22:case 159:case 154:case 14:case 77:case 78:case 139:case 80:case 81:case 79:case 82:case 68:case 67:case 164:case 11:case 29:case 47:case 48:case 95:case 52:case 51:case 46:return 200809;\n case 27:case 246:case 127:case 128:case 23:case 24:case 160:case 161:case 181:case 182:case 242:case 183:case 184:case 243:case 244:case 245:case 165:case 178:case 179:case 49:case 50:case 168:case 169:case 175:case 170:case 171:case 172:case 97:case 76:case 32:case 173:case 35:return-1;case 176:case 177:case 7:case 155:case 8:case 157:case 125:case 126:case 92:case 93:case 129:case 130:case 131:case 94:case 91:return 1;case 74:case 60:case 69:case 70:case 4:return 1024;case 31:case 42:case 72:return 32;\n case 87:case 26:case 33:return 2147483647;case 34:case 1:return 47839;case 38:case 36:return 99;case 43:case 37:return 2048;case 0:return 2097152;case 3:return 65536;case 28:return 32768;case 44:return 32767;case 75:return 16384;case 39:return 1E3;case 89:return 700;case 71:return 256;case 40:return 255;case 2:return 100;case 180:return 64;case 25:return 20;case 5:return 16;case 6:return 6;case 73:return 4;case 84:return 1}S(R.u);return-1},___setErrNo:S,_fwrite:ic,_send:function(a,b,c){return!Z.ub(a)?\n (S(R.ba),-1):hc(a,b,c)},_write:hc,_exit:function(a){mc(a)},_sprintf:function(a,b,c){return nb(a,j,b,c)},__formatString:mb,__ZSt9terminatev:function(){mc(-1234)},_pwrite:function(a,b,c,d){a=X[a];if(!a)return S(R.ba),-1;try{return ac(a,I,b,c,d)}catch(f){return Jb(f),-1}},_sbrk:nc,___errno_location:function(){return pb},___gxx_personality_v0:q(),_llvm_lifetime_start:q(),_time:function(a){var b=Math.floor(Date.now()/1E3);a&&(K[a>>2]=b);return b},__exit:mc,STACKTOP:x,STACK_MAX:Sa,tempDoublePtr:jb,ABORT:ua,\n NaN:NaN,Infinity:Infinity},N),kb=s._strlen=$._strlen;s._crn_get_levels=$._crn_get_levels;s._crn_get_uncompressed_size=$._crn_get_uncompressed_size;s._crn_decompress=$._crn_decompress;s._crn_get_width=$._crn_get_width;s._realloc=$._realloc;s._crn_get_bytes_per_block=$._crn_get_bytes_per_block;var kc=s._memset=$._memset,Ka=s._malloc=$._malloc,lc=s._memcpy=$._memcpy;s._free=$._free;s._crn_get_height=$._crn_get_height;s._crn_get_dxt_format=$._crn_get_dxt_format;var ib=s.runPostSets=$.runPostSets;\n s.dynCall_ii=$.dynCall_ii;s.dynCall_v=$.dynCall_v;s.dynCall_iii=$.dynCall_iii;s.dynCall_vi=$.dynCall_vi;oa=function(a){return $.stackAlloc(a)};ha=function(){return $.stackSave()};ia=function(a){$.stackRestore(a)};function Ec(a){this.name=\"ExitStatus\";this.message=\"Program terminated with exit(\"+a+\")\";this.status=a}Ec.prototype=Error();var Fc,Gc=m,fb=function Hc(){!s.calledRun&&Ic&&Jc();s.calledRun||(fb=Hc)};\n s.callMain=s.Nd=function(a){function b(){for(var a=0;3>a;a++)d.push(0)}A(0==Q,\"cannot call main when async dependencies remain! (listen on __ATMAIN__)\");A(0==Va.length,\"cannot call main when preRun functions remain to be called\");a=a||[];ba&&Gc!==m&&s.P(\"preload time: \"+(Date.now()-Gc)+\" ms\");Za||(Za=l,Ua(O));var c=a.length+1,d=[L(H(\"/bin/this.program\"),\"i8\",0)];b();for(var f=0;f<c-1;f+=1)d.push(L(H(a[f]),\"i8\",0)),b();d.push(0);d=L(d,\"i32\",0);Fc=x;try{var h=s._main(c,d,0);s.noExitRuntime||Kc(h)}catch(g){g instanceof\n Ec||(\"SimulateInfiniteLoop\"==g?s.noExitRuntime=l:(g&&(\"object\"===typeof g&&g.stack)&&s.P(\"exception thrown: \"+[g,g.stack]),e(g)))}finally{}};\n function Jc(a){function b(){Za||(Za=l,Ua(O));Ua(Wa);s.calledRun=l;s._main&&Ic&&s.callMain(a);if(s.postRun)for(\"function\"==typeof s.postRun&&(s.postRun=[s.postRun]);s.postRun.length;)ab(s.postRun.shift());Ua(Ya)}a=a||s.arguments;Gc===m&&(Gc=Date.now());if(0<Q)s.P(\"run() called, but dependencies remain, so not running\");else{if(s.preRun)for(\"function\"==typeof s.preRun&&(s.preRun=[s.preRun]);s.preRun.length;)$a(s.preRun.shift());Ua(Va);0<Q||(s.setStatus?(s.setStatus(\"Running...\"),setTimeout(function(){setTimeout(function(){s.setStatus(\"\")},\n 1);ua||b()},1)):b())}}s.run=s.ge=Jc;function Kc(a){ua=l;x=Fc;Ua(Xa);e(new Ec(a))}s.exit=s.Rd=Kc;function E(a){a&&(s.print(a),s.P(a));ua=l;e(\"abort() at \"+Ma())}s.abort=s.abort=E;if(s.preInit)for(\"function\"==typeof s.preInit&&(s.preInit=[s.preInit]);0<s.preInit.length;)s.preInit.pop()();var Ic=l;s.noInitialRun&&(Ic=p);Jc();\n\n return Module;\n}","compileImpl(cache)\n {\n // small helper to format info and error messages\n var _ = (c) => {\n return 'id=' + (c.id || '') + '|name=' + (c.name || '');\n };\n\n // the common implementation for all components\n var impl = (comp, cache, ids, names, kind) => {\n // at least one of ID and name mandatory\n if ( ! comp.name && ! comp.id ) {\n throw new Error('No ID and no name on ' + kind.kind + ' in ' + cache.href);\n }\n // default value for compose\n if ( ! comp.compose ) {\n comp.compose = 'merge';\n }\n // does it exist yet?\n var derived =\n ( comp.id && ids[comp.id] )\n || ( comp.name && names[comp.name] );\n // if it does, perform the \"compose\" action..\n if ( derived ) {\n if ( derived.compose !== comp.compose ) {\n throw new Error('Different compose actions for ' + kind.kind + 's: derived:'\n + _(derived) + '|compose=' + derived.compose + ' and base:'\n + _(comp) + '|compose=' + comp.compose);\n }\n else if ( derived.compose === 'merge' ) {\n this.ctxt.display.info('Merge ' + kind.kind + 's derived:' + _(derived) + ' and base:' + _(comp));\n var overriden = Object.keys(derived);\n for ( var p in comp ) {\n if ( overriden.indexOf(p) === -1 ) {\n derived[p] = comp[p];\n if ( p === 'id' ) {\n ids[derived.id] = derived;\n }\n else if ( p === 'name' ) {\n names[derived.name] = derived;\n }\n }\n else {\n derived[p] = kind.merge(p, derived[p], comp[p]);\n }\n }\n }\n else if ( derived.compose === 'hide' ) {\n this.ctxt.platform.info('Hide ' + kind.kind + ' base:' + _(comp) + ' by derived:' + _(derived));\n }\n else {\n throw new Error('Unknown compose on ' + kind.kind + ': ' + _(derived) + '|compose=' + derived.compose);\n }\n }\n // ...if it does not, just add it\n else {\n cache.push(comp);\n if ( comp.id ) {\n ids[comp.id] = comp;\n }\n if ( comp.name ) {\n names[comp.name] = comp;\n }\n }\n };\n\n // compile hosts\n if ( this.json.hosts ) {\n this.json.hosts.forEach(host => {\n impl(host, cache.hosts, null, cache.hostNames, cmp.Host);\n });\n }\n // compile databases\n if ( this.json.databases ) {\n this.json.databases.forEach(db => {\n impl(db, cache.dbs, cache.dbIds, cache.dbNames, cmp.Database);\n });\n }\n // compile servers\n if ( this.json.servers ) {\n this.json.servers.forEach(srv => {\n impl(srv, cache.srvs, cache.srvIds, cache.srvNames, cmp.Server);\n });\n }\n // compile sources\n if ( this.json.sources ) {\n this.json.sources.forEach(src => {\n impl(src, cache.srcs, null, cache.srcNames, cmp.SourceSet);\n });\n }\n // compile mime types\n if ( this.json['mime-types'] ) {\n this.json['mime-types'].forEach(mime => {\n impl(mime, cache.mimes, null, cache.mimeNames, cmp.MimeType);\n });\n }\n // compile privileges\n if ( this.json.privileges ) {\n const each = (privs, cache, names) => {\n if ( privs ) {\n privs.forEach(priv => {\n impl(priv, cache, null, names, cmp.Privilege);\n });\n }\n };\n each(this.json.privileges.execute, cache.execPrivs, cache.execPrivNames);\n each(this.json.privileges.uri, cache.uriPrivs, cache.uriPrivNames);\n }\n // compile roles\n if ( this.json.roles ) {\n this.json.roles.forEach(role => {\n impl(role, cache.roles, null, cache.roleNames, cmp.Role);\n });\n }\n // compile users\n if ( this.json.users ) {\n this.json.users.forEach(user => {\n impl(user, cache.users, null, cache.userNames, cmp.User);\n });\n }\n // recurse on imports\n this.imports.forEach(i => {\n cache.href = i.path;\n i.compileImpl(cache);\n });\n }","function compileFaust(name, sourcecode, x, y, callback){\n\n// Temporarily Saving parameters of compilation\n\twindow.name = name;\n\twindow.source = sourcecode;\n\twindow.x = x;\n\twindow.y = y;\n\n\tvar currentScene = \twindow.scenes[window.currentScene];\n\n// To Avoid click during compilation\n\tif(currentScene)\n\t\tcurrentScene.muteScene();\n\n\tvar args = [\"-I\", \"http://faust.grame.fr/faustcode/\"];\t\t \n\tvar factory = faust.createDSPFactory(sourcecode, args);\n callback(factory);\n\n\tif(currentScene)\n\t\tcurrentScene.unmuteScene();\n\n}","_resolveCrossEnvironment(_resource) {\n // does nothing\n }","makeCommand()\n\t{\n\t\tlet command = configs.javaBin + ' -jar -Xss2048k';\n\t\t//Ajouter le binaire\n\t\tcommand += ' ' + __dirname + '/bin/yuicompressor-2.4.8.jar';\n\t\t//Fichier de sortie\n\t\tcommand += ' --type js -o ' + this.rootDir + this.configs.outputDir + this.targetDirPath + configs.outputFilename.replace('$1', this.savedFileName);\n\t\t//Fichier d'entree\n\t\tcommand += ' ' + this.savedFilePath;\n\t\t\n//\t\tconsole.log(command);\n\t\t//Retourner la commande complete\n\t\treturn command;\n\t}","function gen_op_rscl_T0_T1_cc()\n{\n gen_opc_ptr.push({func:op_rscl_T0_T1_cc});\n}","function initCompSyntaxTools()\n{\n quadruples = [];\n quadruples[0] = [Operation.GOTO, null, null, null]; //first quadruple should be goint to main\n dirProcs = {};\n constMem = 45000;\n constants = {};\n}","startCompiling() {\n return new Promise(resolve => {\n let compiledFiles = {};\n\n let lastFile = null;\n\n for (let [key] of this.collectedComponents) {\n compiledFiles[key] = false;\n lastFile = key;\n }\n\n for (let [key, componentInfo] of this.collectedComponents) {\n if (componentInfo.htmlFile) {\n componentInfo.htmlFile = normalizePath(componentInfo.htmlFile);\n }\n\n\n let { selector, component, htmlFile, isUnique, isChild } = componentInfo;\n\n // it means the component is acting as a tag\n if (!htmlFile || isChild) {\n compiledFiles[key] = true;\n\n if (key == lastFile) {\n resolve();\n }\n continue;\n }\n\n if (!this.htmlFilesList[htmlFile]) {\n this.htmlFilesList[htmlFile] = componentInfo;\n }\n\n if (htmlFile) {\n echo.sameLine(cli.yellow('Compiling ' + cli.green(htmlFile.replace(ROOT + '/', ''))));\n }\n\n this.compileView(htmlFile, selector, component, isUnique, false).then(parsedFilePath => {\n compiledFiles[key] = true;\n // add to smart-views files list \n resources.smartViews.push(parsedFilePath.ltrim(ROOT).replace(/\\\\/g, '/').ltrim('/'));\n if (key == lastFile) {\n resolve();\n }\n });\n }\n });\n }","function logVBCS(){\r\n console.log(\" ------> RUNNING FROM EXTERNAL LIB <------\");\r\n}","function compoxUtil() {\n\t// setAdjustMetaFunc\n\tApp.prototype.setAdjustMetaFunc = setAdjustMetaFunc;\n\t// dataTable\n\tApp.prototype.addDataTable = addDataTable;\n\tApp.prototype.getDataTable = getDataTable;\n\tApp.prototype.getDataTables = getDataTables;\n\t// comp\n\tApp.prototype.createComp = createComp;\n\tApp.prototype.getComp = getComp;\n\tApp.prototype.getCompsByDataTable = getCompsByDataTable;\n\tApp.prototype.getCompsByType = getCompsByType;\n\tApp.prototype.getComps = getComps;\n\tApp.prototype.getCompsByElement = getCompsByElement;\n\tApp.prototype.showComp = showComp;\n\t// validate\n\tApp.prototype.compsValidate = compsValidate;\n\tApp.prototype.compsValidateMultiParam = compsValidateMultiParam;\n\t// cache\n\tApp.prototype.setUserCache = setUserCache;\n\tApp.prototype.getUserCache = getUserCache;\n\tApp.prototype.removeUserCache = removeUserCache;\n\tApp.prototype.setCache = setCache;\n\tApp.prototype.getCache = getCache;\n\tApp.prototype.removeCache = removeCache;\n\tApp.prototype.setSessionCache = setSessionCache;\n\tApp.prototype.getSessionCache = getSessionCache;\n\tApp.prototype.removeSessionCache = removeSessionCache;\n\t// iwebCode\n\tApp.prototype.getEnvironment = getEnvironment;\n\tApp.prototype.setClientAttribute = setClientAttribute;\n\tApp.prototype.getClientAttribute = getClientAttribute;\n\t// ajax\n\tApp.prototype.ajax = ajax;\n\t// serverEvent\n\tApp.prototype.serverEvent = serverEvent;\n\t// util\n\tApp.prototype.setEnable = setEnable;\n}","function gen_op_shrl_T1_0_cc()\n{\n gen_opc_ptr.push({func:op_shrl_T1_0_cc});\n}","exitComp_if(ctx) {\n\t}","function gen_op_rrxl_T1_cc()\n{\n gen_opc_ptr.push({func:op_rrxl_T1_cc});\n}","compile (fileName) {\n return this.compileTabLogic.compileFile(fileName)\n }","function gen_op_rsbl_T0_T1_cc()\n{\n gen_opc_ptr.push({func:op_rsbl_T0_T1_cc});\n}","static $clinit() {\n CharSequences.$clinit = function() {};\n CharSequence = goog.module.get('java.lang.CharSequence$impl');\n String = goog.module.get('java.lang.String$impl');\n }","function componentStillLoadingError(compType){var error$$1=Error(\"Can't compile synchronously as \"+stringify(compType)+\" is still being loaded!\");error$$1[ERROR_COMPONENT_TYPE]=compType;return error$$1;}","function closureCompile(src, advanced, cb) {\r\n\tfunction onError(e, e2, e3) {\r\n\t\tif(window.console)console.log('error', e, e2, e3);\r\n\t\tcb&&cb(null);\r\n\t}\r\n\tvar URL = 'http://closure-compiler.appspot.com/compile';\r\n\t$.request('post', URL, \r\n\t\t\t{\r\n\t\t\t\tjs_code: src,\r\n\t\t\t\toutput_format: 'json',\r\n\t\t\t\toutput_info: ['compiled_code', 'statistics'],\r\n\t\t\t\toutput_file_name: 'minified-custom.js',\r\n\t\t\t\tcompilation_level: advanced ? 'ADVANCED_OPTIMIZATIONS' : 'SIMPLE_OPTIMIZATIONS'\r\n\t\t\t}).then(function(txt) {\r\n\t\t\t\tcb&&cb($.parseJSON(txt));\r\n\t\t\t}, onError)\r\n\t\t\t.error(function(txt) {\r\n\t\t\t\twindow.console && console.log(txt, txt.stack || '');\r\n\t\t\t});\r\n}","function compileData () {\n console.log('compileData');\n\n /* compile data and bss segments. generate an assembly\n language include of all the labels */\n\n execSync(\n 'cl65 ' +\n '-Ln build/data.lbl ' +\n '-C ' + (passPostfix === '' ? '' : 'build/') + 'data' + passPostfix + '.cfg ' +\n 'build/data.s -vm'\n );\n\n execSync(\n '(' +\n 'echo -n \"ibase=16;scale=16;\" && ' +\n '((grep __RAM2_LAST__ build/data.lbl|' +\n \"sed -n \\\"s/al \\\\([^ ]*\\\\).*/\\\\1/p\\\")|tr -d '\\n')\" +\n ' && echo -n \"-\" && ' +\n 'grep __RAM2_START__ build/data.lbl|' +\n 'sed -n \"s/al \\\\([^ ]*\\\\).*/\\\\1/p\"' +\n ')|bc|' +\n 'xargs -I {} dd if=/dev/zero bs=1 count={} of=build/data.bin'\n );\n\n /* TODO: confirm this: Create a combined binary of the ram segments\n so that they can be copied as one blob? */\n execSync('dd if=build/data2.bin of=build/data.bin conv=notrunc;rm build/data2.bin');\n\n const lineReader2 = readline.createInterface({\n input: fs.createReadStream('build/data.lbl')\n });\n\n const labels = fs.createWriteStream('build/labels.s');\n\n /* read the resultant memory locations and make an assembly include\n containing just their addresses */\n lineReader2.on('line', line => {\n const name = line.replace(/^al\\s+[0-9A-F]+ \\./, '');\n\n if (name.match(/l[0-9a-f]{4}/)) {\n const address = parseInt(line.match(/[0-9A-F]+/), 16);\n\n labels.write(\n name + ' = $' +\n ('0000' + address.toString(16).toUpperCase()).substr(-4) +\n '\\n'\n );\n } else if (name.match(/\\b_[0-9a-zA-Z]/) || name === 'jmpvec') { // && name !== '_main') {\n // starts with an underscore (name defined by the c source code)\n const address = parseInt(line.match(/[0-9A-F]+/), 16);\n\n labels.write('.export ' + name + '\\n');\n\n labels.write(\n name + ' = $' +\n ('0000' + address.toString(16).toUpperCase()).substr(-4) +\n '\\n'\n );\n }\n });\n\n lineReader2.on('close', () => {\n labels.end(compileHash2);\n });\n}","function Comp() {\n return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createElement(\"div\", null, /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createElement(_src__WEBPACK_IMPORTED_MODULE_4__.default, {\n lilProject: _sampleReactProject__WEBPACK_IMPORTED_MODULE_5__.default\n }));\n}","function Bundler () {\n}","function mirrorbrain_getTagOS( file ) {\n\tvar retVal;\n if ( file != null && (\n\t\tfile.indexOf( \"_install-\" ) > -1 || (\n\t\t\tfile.indexOf( \"_install_\" ) > -1 && (\n\t\t\t\tfile.indexOf( \"_Linux_\" ) > -1 || file.indexOf( \"_MacOS_\" ) > -1 || file.indexOf( \"_Win_\" ) > -1 || file.indexOf( \"_Solaris_\" ) > -1\n\t\t\t)\n ) ) ) {\n\n\t\tvar s = file.split( \"_install\" );\n\t\ts = s[0].split( \"_\" );\n\t\tretVal = s[ s.length -2 ] + s[ s.length -1 ];\n\t\tretVal = retVal.toLowerCase();\n\t\tif ( retVal.indexOf( \"winx86\" ) > -1 ) {\n\t\t\tretVal = \"win\";\n\t\t} else if ( retVal == \"linuxx86\" ) {\n\t\t\tretVal = \"linuxintel\";\n\t\t} else if ( retVal == \"macosx86\" ) {\n\t\t\tretVal = \"macosxintel\";\n\t\t} else if ( retVal == \"macosppc\" ) {\n\t\t\tretVal = \"macosxppc\";\n\t\t}\n\t\tif ( file.toLowerCase().indexOf( \"wjre\" ) > -1 ) {\n\t\t\tretVal = retVal + \"wjre\";\n\t\t} else if ( file.indexOf( \"install-deb\" ) > -1 ) {\n\t\t\tretVal = retVal + \"deb\";\n\t\t}\n\t} else if ( file != null && file.indexOf( \"_install_\" ) > -1 ) {\n\t\tvar s = file.split( \"_install_\" );\n\t\ts = s[0].split( \"_\" );\n\t\tretVal = s[ s.length -1 ];\n\t\tretVal = retVal.toLowerCase();\n\t\tif ( retVal.indexOf( \"win32intel\" ) > -1 ) {\n\t\t\tretVal = \"win\";\n\t\t}\n\t\tif ( file.toLowerCase().indexOf( \"wjre\" ) > -1 ) {\n\t\t\tretVal = retVal + \"wjre\";\n\t\t} else if ( file.indexOf( \"_deb\" ) > -1 ) {\n\t\t\tretVal = retVal + \"deb\";\n\t\t} else if ( file.indexOf( \"install-deb\" ) > -1 ) {\n\t\t\tretVal = retVal + \"deb\";\n\t\t}\n\t}\n\treturn retVal;\n}","function compras() {\n\n\tvar arroz = 1;\n\n\tthis.qualQtdArroz = function() {\n\t\treturn 'Comprar ' + arroz + ' arroz!';\n\t}\n\n\n}","function _tool() {\n return java(NAME);\n }","compilable(_locator) {\n throw new Error('Method not implemented.');\n }","compilable(_locator) {\n throw new Error('Method not implemented.');\n }","compilable(_locator) {\n throw new Error('Method not implemented.');\n }","linkBytecode (bytecode, libs) {\n const links = Object.assign({}, libs)\n const keys = Object.keys(links)\n for (let i = 0; i < keys.length; i++) {\n let name = keys[i]\n let addr = links[name]\n\n // Truncate to 37 characters\n name = name.slice(0, 36)\n\n // Prefix and suffix with __\n let label = '__' + name + Array(37 - name.length).join('_') + '__'\n\n if (addr.slice(0, 2) !== '0x' || addr.length > 42) {\n throw new Error('Invalid address specified for ' + name)\n }\n\n // Remove 0x prefix\n addr = addr.slice(2)\n addr = Array(40 - addr.length + 1).join('0') + addr\n\n while (bytecode.indexOf(label) >= 0) {\n bytecode = bytecode.replace(label, addr)\n }\n const regex = new RegExp('__' + name + '_+', 'g')\n\n bytecode = bytecode.replace(regex, addr.replace('0x', ''))\n }\n\n return bytecode\n }","function BO(t,e,n,i,r,o,a,s){var u=(\"function\"===typeof n?n.options:n)||{};return u.__file=\"source.vue\",u.render||(u.render=t.render,u.staticRenderFns=t.staticRenderFns,u._compiled=!0,r&&(u.functional=!0)),u._scopeId=i,u}","async executeCompiled() {\n if (!this.compiled) return\n\n // reset runtime environment\n spellCore.resetRuntime()\n delete this.exports\n delete this.executionError\n\n // METHOD 2 (working except we can't get line number of failure)\n // Run by importing our `outputFile` as a module.\n // This lets us catch errors and get access to module `exports`.\n // Unfortunately, we don't get the line number of the error\n // (although Chrome does get the line number if we re-throw the error.)\n try {\n // Use `?<timestamp>` to create a unique URL each time\n this.exports = await import(this.outputFile.url + `?${Date.now()}`)\n return this.exports\n } catch (e) {\n if (Error.captureStackTrace) Error.captureStackTrace(e, this.executeCompiled)\n this.executionError = e\n return e\n }\n\n // METHOD 1\n // Alternate method of running: create a <script> tag\n // Problem with this is that we don't get access to errors\n // or `exports` in the compiled code.\n //\n // const scriptEl = document.createElement(\"script\")\n // scriptEl.setAttribute(\"id\", \"compileOutput\")\n // scriptEl.setAttribute(\"type\", \"module\")\n // scriptEl.innerHTML = this.compiled\n // const existingEl = document.getElementById(\"compileOutput\")\n // if (existingEl) {\n // existingEl.replaceWith(scriptEl)\n // } else {\n // document.body.append(scriptEl)\n // }\n }","private public function m246() {}","function mainNgcc(_a) {\n var basePath = _a.basePath, targetEntryPointPath = _a.targetEntryPointPath, _b = _a.propertiesToConsider, propertiesToConsider = _b === void 0 ? entry_point_1.SUPPORTED_FORMAT_PROPERTIES : _b, _c = _a.compileAllFormats, compileAllFormats = _c === void 0 ? true : _c, _d = _a.createNewEntryPointFormats, createNewEntryPointFormats = _d === void 0 ? false : _d, _e = _a.logger, logger = _e === void 0 ? new console_logger_1.ConsoleLogger(console_logger_1.LogLevel.info) : _e;\n var transformer = new transformer_1.Transformer(logger, basePath);\n var host = new dependency_host_1.DependencyHost();\n var resolver = new dependency_resolver_1.DependencyResolver(logger, host);\n var finder = new entry_point_finder_1.EntryPointFinder(logger, resolver);\n var fileWriter = getFileWriter(createNewEntryPointFormats);\n var absoluteTargetEntryPointPath = targetEntryPointPath ?\n path_1.AbsoluteFsPath.from(canonical_path_1.resolve(basePath, targetEntryPointPath)) :\n undefined;\n if (absoluteTargetEntryPointPath &&\n hasProcessedTargetEntryPoint(absoluteTargetEntryPointPath, propertiesToConsider, compileAllFormats)) {\n logger.debug('The target entry-point has already been processed');\n return;\n }\n var entryPoints = finder.findEntryPoints(path_1.AbsoluteFsPath.from(basePath), absoluteTargetEntryPointPath).entryPoints;\n if (absoluteTargetEntryPointPath && entryPoints.every(function (entryPoint) {\n return entryPoint.path !== absoluteTargetEntryPointPath;\n })) {\n // If we get here, then the requested entry-point did not contain anything compiled by\n // the old Angular compiler. Therefore there is nothing for ngcc to do.\n // So mark all formats in this entry-point as processed so that clients of ngcc can avoid\n // triggering ngcc for this entry-point in the future.\n var packageJsonPath_1 = path_1.AbsoluteFsPath.from(canonical_path_1.resolve(absoluteTargetEntryPointPath, 'package.json'));\n var packageJson_1 = JSON.parse(fs_1.readFileSync(packageJsonPath_1, 'utf8'));\n propertiesToConsider.forEach(function (formatProperty) {\n if (packageJson_1[formatProperty])\n build_marker_1.markAsProcessed(packageJson_1, packageJsonPath_1, formatProperty);\n });\n return;\n }\n entryPoints.forEach(function (entryPoint) {\n // Are we compiling the Angular core?\n var isCore = entryPoint.name === '@angular/core';\n var compiledFormats = new Set();\n var entryPointPackageJson = entryPoint.packageJson;\n var entryPointPackageJsonPath = path_1.AbsoluteFsPath.from(canonical_path_1.resolve(entryPoint.path, 'package.json'));\n var hasProcessedDts = build_marker_1.hasBeenProcessed(entryPointPackageJson, 'typings');\n for (var i = 0; i < propertiesToConsider.length; i++) {\n var property = propertiesToConsider[i];\n var formatPath = entryPointPackageJson[property];\n var format = entry_point_1.getEntryPointFormat(property);\n // No format then this property is not supposed to be compiled.\n if (!formatPath || !format || SUPPORTED_FORMATS.indexOf(format) === -1)\n continue;\n if (build_marker_1.hasBeenProcessed(entryPointPackageJson, property)) {\n compiledFormats.add(formatPath);\n logger.debug(\"Skipping \" + entryPoint.name + \" : \" + property + \" (already compiled).\");\n continue;\n }\n var isFirstFormat = compiledFormats.size === 0;\n var processDts = !hasProcessedDts && isFirstFormat;\n // We don't break if this if statement fails because we still want to mark\n // the property as processed even if its underlying format has been built already.\n if (!compiledFormats.has(formatPath) && (compileAllFormats || isFirstFormat)) {\n var bundle = entry_point_bundle_1.makeEntryPointBundle(entryPoint.path, formatPath, entryPoint.typings, isCore, property, format, processDts);\n if (bundle) {\n logger.info(\"Compiling \" + entryPoint.name + \" : \" + property + \" as \" + format);\n var transformedFiles = transformer.transform(bundle);\n fileWriter.writeBundle(entryPoint, bundle, transformedFiles);\n compiledFormats.add(formatPath);\n }\n else {\n logger.warn(\"Skipping \" + entryPoint.name + \" : \" + format + \" (no valid entry point file for this format).\");\n }\n }\n else if (!compileAllFormats) {\n logger.debug(\"Skipping \" + entryPoint.name + \" : \" + property + \" (already compiled).\");\n }\n // Either this format was just compiled or its underlying format was compiled because of a\n // previous property.\n if (compiledFormats.has(formatPath)) {\n build_marker_1.markAsProcessed(entryPointPackageJson, entryPointPackageJsonPath, property);\n if (processDts) {\n build_marker_1.markAsProcessed(entryPointPackageJson, entryPointPackageJsonPath, 'typings');\n }\n }\n }\n if (compiledFormats.size === 0) {\n throw new Error(\"Failed to compile any formats for entry-point at (\" + entryPoint.path + \"). Tried \" + propertiesToConsider + \".\");\n }\n });\n }","function Jb(t,e,n,r,i,o,a,s){var l=(\"function\"===typeof n?n.options:n)||{};return l.__file=\"style.vue\",l.render||(l.render=t.render,l.staticRenderFns=t.staticRenderFns,l._compiled=!0,i&&(l.functional=!0)),l._scopeId=r,l}","async compile(entryPoint) {\n\t\tlet options = this.config.reify(entryPoint, this._cache);\n\t\tlet bundle = await rollup(options.input);\n\t\tlet { output } = await bundle.generate(options.output);\n\t\tif(output.length !== 1) {\n\t\t\tthrow new Error(\"unexpected chunking\"); // TODO: support for code splitting\n\t\t}\n\t\tlet { code, modules } = output[0];\n\n\t\tthis._cache = bundle.cache;\n\t\tthis._modules = modules;\n\t\treturn code;\n\t}","function Copcar(){}","transient protected internal function m189() {}","function compileModule(filename, sourceLines, options){\n//Compile a module from source in memory\n//input:\n//* filename (for error reporting),\n//* sourceLines: LiteScript code: string array | large string | Buffer\n//* options: GeneralOptions\n\n//output:\n//* moduleNode: Grammar.Module: module's code AST root node\n\n //default filename = 'unnamed'\n if(filename===undefined) filename='unnamed';\n //options.mainModuleName = filename\n options.mainModuleName = filename;\n\n //#since \"options\" come from a external source, it can be anything\n //options = prepareOptions(options)\n options = prepareOptions(options);\n\n //var project = new Project(options)\n var project = new Project(options);\n\n //var fileInfo = new Environment.FileInfo(filename)\n var fileInfo = new Environment.FileInfo(filename);\n\n //var moduleNode = project.createNewModule(fileInfo)\n var moduleNode = project.createNewModule(fileInfo);\n\n//add to module list, so WalkAllNodes includes it\n\n //project.moduleCache.set fileInfo.filename, moduleNode\n project.moduleCache.set(fileInfo.filename, moduleNode);\n\n//store result in memory\n\n //moduleNode.lexer.outCode.fileMode=false\n moduleNode.lexer.outCode.fileMode = false;\n\n//parse source lines\n\n //project.parseOnModule moduleNode, filename, sourceLines\n project.parseOnModule(moduleNode, filename, sourceLines);\n\n //if no project.options.single\n if (!project.options.single) {\n \n //project.importDependencies moduleNode\n project.importDependencies(moduleNode);\n };\n\n//validate var & property names\n\n //if no project.options.skip\n if (!project.options.skip) {\n \n\n //Validate.execute\n Validate.execute();\n //if logger.errorCount is 0, logger.info \"Validation OK\"\n if (logger.errorCount === 0) {logger.info(\"Validation OK\")};\n };\n\n//initialize out buffer & produce target code\n\n //logger.msg \"Generating #{project.options.target}\"\n logger.msg(\"Generating \" + project.options.target);\n\n //project.produceModule moduleNode\n project.produceModule(moduleNode);\n //# the produced code will be at: moduleNode.lexer.out.getResult() :string array\n\n //if logger.errorCount isnt 0, logger.throwControlled \"#{logger.errorCount} errors during compilation\"\n if (logger.errorCount !== 0) {logger.throwControlled('' + logger.errorCount + \" errors during compilation\")};\n\n//text compiled result can be obtained with: moduleNode.lexer.out.getResult() :string array\n\n //return moduleNode\n return moduleNode;\n }","function compileECMA() {\n\n console.info('\\x1b[36m','😻 transforming ECMA script...');\n\n const browserify = require(\"browserify\");\n const babelify = require(\"babelify\");\n const envify = require('envify/custom');\n\n let b = browserify({ debug: false });\n\n // Browserify entrypoint and options.\n b.require(\"./src/js/index.js\", { entry: true });\n\n // Babelify config and options.\n // If NODE_ENV is set prodution minified = true otherwise sets to false.\n b.transform(babelify, {\n presets: [\"@babel/preset-env\"],\n comments: false,\n minified: envType !== 'production' ? false : true\n });\n\n // Envify transform and options.\n // If NODE_ENV is set prodution NODE_ENV = production otherwise sets to development.\n b.transform(envify({\n NODE_ENV: envType !== 'production' ? 'development' : 'production'\n }));\n\n // Uglifyify transform and options.\n // If NODE_ENV is set to prodution uglifyify transform is invoked otherwise it's skipped.\n envType == 'production' ? b.transform('uglifyify', { global: true }) : null;\n\n // If no error(s) occur bundle is piped and written to ./dist/js/bundle.js.\n b.bundle().on(\"error\", function (err) {\n\n console.log(\"Error: \" + err.message);\n\n }).pipe(fs.createWriteStream(\"./dist/js/bundle.js\").on('finish', () => {\n\n console.log('\\x1b[32m','🍕 Transform complete!');\n\n }));\n\n }","enterComp_op(ctx) {\n\t}","function Cn(t,e){\"undefined\"!=typeof console&&(console.warn(\"[vue-i18n] \"+t),e&&console.warn(e.stack))}","SaveCompiledState() {\n\n }","function _____SHARED_functions_____(){}","function r(){throw new Error(\"Dynamic requires are not currently supported by rollup-plugin-commonjs\")}","static final protected internal function m110() {}","function getPlugoutComp() { return plugoutComp; }","compileOneFile(inputFile) {\n\t\tvar pathInPackage = inputFile.getPathInPackage();\n\t\tvar packageName = inputFile.getPackageName();\n\t\tif (packageName) {\n\t\t\tpackageName = packageName.replace('local-test:', '');\n\t\t}\n\t\tvar fullPath = pathInPackage;\n\t\tif (packageName) {\n\t\t\tfullPath = path.join(packagesPath, packageName, fullPath);\n\t\t}\n\n\t\t// console.log('Compiling...', (packageName || 'app') + '/' + pathInPackage);\n\n\t\tif (pathInPackage.indexOf('node_modules/') !== -1) {\n\t\t\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its in node_modules');\n\t\t\treturn {};\n\t\t}\n\n\t\tif (pathInPackage.indexOf('typings/') !== -1) {\n\t\t\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its in typings');\n\t\t\treturn {};\n\t\t}\n\n\t\tif (pathInPackage.substr(-5) === '.d.ts') {\n\t\t\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its a definition');\n\t\t\treturn {};\n\t\t}\n\n\t\t// generatePackageRefs();\n\t\tif (\n\t\t\tpackageName &&\n\t\t\ttypescriptPackages[packageName].client.files.indexOf(pathInPackage) === -1 &&\n\t\t\ttypescriptPackages[packageName].server.files.indexOf(pathInPackage) === -1\n\t\t) {\n\t\t\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its not added to package.js');\n\t\t\treturn {};\n\t\t}\n\n\t\t// cache check\n\t\tvar cachePath = path.join(cacheDir, isApp && !disableInApp ? path.relative('../', fullPath) : path.relative(meteorPath, fullPath));\n\t\tvar baseName = path.basename(fullPath, '.ts');\n\t\tvar changeTime = fs.statSync(fullPath).mtime;\n\t\tvar jsPath = path.join(path.dirname(cachePath), baseName + '.js');\n\t\tvar error;\n\n\t\t// references\n\t\tvar dir = path.dirname(path.relative('./', fullPath));\n\t\tif (!packageName) {\n\t\t\tif (appDirs.indexOf(dir) == -1) {\n\t\t\t\tappDirs.push(dir);\n\t\t\t}\n\t\t\tif (appRefs.indexOf(pathInPackage) == -1) {\n\t\t\t\tappRefs.push(pathInPackage);\n\t\t\t\tappDirs.forEach(function (dir) {\n\t\t\t\t\tfs.writeFileSync(path.join(dir, '.#ts', \"server.d.ts\"), '///<reference path=\"' + path.relative(dir, path.join('.meteor', '.#ts', 'app-server.d.ts')) + '\" />\\n');\n\t\t\t\t\tfs.writeFileSync(path.join(dir, '.#ts', \"client.d.ts\"), '///<reference path=\"' + path.relative(dir, path.join('.meteor', '.#ts', 'app-client.d.ts')) + '\" />\\n');\n\t\t\t\t});\n\t\t\t\tfs.writeFileSync(path.join('.meteor', '.#ts', 'app-server.d.ts'), getAppRefs('server'));\n\t\t\t\tfs.writeFileSync(path.join('.meteor', '.#ts', 'app-client.d.ts'), getAppRefs('client'));\n\t\t\t}\n\t\t}\n\n\t\tvar doesntExists = !fs.existsSync(jsPath);\n\t\tvar existingTime = !doesntExists && fs.statSync(jsPath).mtime;\n\t\tvar isTooOld = existingTime && changeTime.getTime() > existingTime.getTime();\n\t\tif (doesntExists || isTooOld) {\n\n\t\t\tif (doesntExists) {\n\t\t\t\tconsole.log('Compiling because doesnt exist:', fullPath);\n\t\t\t\t// console.log(\n\t\t\t\t// \ttypescriptPackages[packageName].client.files,\n\t\t\t\t// \ttypescriptPackages[packageName].server.files\n\t\t\t\t// );\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconsole.log('Compiling because too old:', fullPath);\n\t\t\t}\n\n\t\t\tvar exec = Npm.require('child_process').exec;\n\t\t\tvar Future = Npm.require('fibers/future');\n\n\t\t\tfunction execSync(command) {\n\t\t\t\tvar fut = new Future();\n\t\t\t\texec(command, function (error, stdout, stderr) {\n\t\t\t\t\tfut.return({\n\t\t\t\t\t\tstdout: stdout,\n\t\t\t\t\t\tstderr: stderr || error\n\t\t\t\t\t})\n\t\t\t\t});\n\t\t\t\treturn fut.wait();\n\t\t\t}\n\n\t\t\tvar compileCommand = 'node ' + compilerPath + ' ' +\n\t\t\t\t'--target ES5 ' +\n\t\t\t\t'--sourcemap ' +\n\t\t\t\t'--module amd ' +\n\t\t\t\t'--experimentalDecorators ' +\n\t\t\t\t'--emitDecoratorMetadata ' +\n\t\t\t\t//'--pretty ' +\n\t\t\t\t'--emitVerboseMetadata ' +\n\t\t\t\t'--skipEmitVarForModule ' +\n\t\t\t\t'--outDir ' + cacheDir + ' ' + (disableInApp ? meteorAllPath : allPath);\n\n\t\t\t// console.log(compileCommand);\n\t\t\ttry {\n\t\t\t\tvar result = execSync(compileCommand);\n\t\t\t}\n\t\t\tcatch (e) {\n\t\t\t\tconsole.log(e);\n\t\t\t}\n\n\t\t\tif (result.stderr) {\n\t\t\t\tvar lines = (typeof result.stderr === 'string' ? result.stderr : result.stdout).split('\\n');\n\t\t\t\tvar errors = [];\n\t\t\t\tfor (var i = 0; i < lines.length; i++) {\n\t\t\t\t\tif (!lines[i]) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\terrors.push(lines[i]);\n\t\t\t\t}\n\t\t\t\tif (errors.length > 0) {\n\t\t\t\t\terror = errors.join('\\n');\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!error && !fs.existsSync(jsPath)) {\n\t\t\t\terror = 'File was not created: ' + jsPath;\n\t\t\t}\n\t\t\tif (error) {\n\t\t\t\ttry {\n\t\t\t\t\tfs.unlinkSync(jsPath);\n\t\t\t\t\tfs.unlinkSync(cachePath + '.map');\n\t\t\t\t}\n\t\t\t\tcatch (e) {\n\t\t\t\t\t// ignore\n\t\t\t\t}\n\t\t\t\t// ../meteor/packages/marketing/TransactionServer.ts(1078,10)\n\t\t\t\terror = error\n\t\t\t\t\t.replace(/(\\x1b\\[30m)/g, '\\n$1')\n\t\t\t\t\t// .replace(/([a-zA-Z0-9\\.\\/_-]+)\\(([0-9]+),([0-9]+)\\)/g, '\\n\\x1b[42;1m' + process.cwd().replace(new RegExp('^/Users/' + process.env.USER, 'g'), '~') + '/$1:$2 $3\\x1b[0m');\n\t\t\t\tinputFile.error({\n\t\t\t\t\tmessage: error\n\t\t\t\t});\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\tvar data = fs.readFileSync(jsPath).toString();\n\n\t\t//console.log('adding: ' + jsPath)\n\t\t// couple of hacks for meteor namespacing\n\t\tvar prep = '';\n\t\tdata = data\n\t\t//.replace(/(new __\\(\\);\\n\\};\\n)var ([a-zA-Z0-9_]+);/, '$1' + prep)\n\t\t\t.replace(/(<reference path=\"[a-zA-Z0-9_\\.\\/-]+\"[ ]*\\/>\\n(\\/\\*(.|\\n)+\\*\\/\\n)?)var ([a-zA-Z0-9_]+);\\n/, '$1' + prep)\n\t\t\t//.replace(/(var __decorate[\\w\\s!=\"\\(\\)&|,.;:}{]*};\\n)var ([a-zA-Z0-9_]+);\\n/, '$1' + prep)\n\t\t\t.replace(/^\\s*var ([a-zA-Z0-9_]+);/, prep)\n\t\t\t.replace(/\\/\\/# sourceMappingURL=.+/, '');\n\t\t//\t\t.replace(/\\}\\)\\(([a-zA-Z0-9_]+) \\|\\| \\(([a-zA-Z0-9_]+) = \\{\\}\\)\\);(\\n\\/\\/# sourceMappingURL)/, '})($1);$3');\n\t\t//\tdata = data\n\t\t//\t\t.replace(/(new __\\(\\);\\n\\};\\n)var ([a-zA-Z0-9_]+);/, '$1this.$2 = this.$2 || {};\\nvar $2 = this.$2;')\n\t\t//\t\t.replace(/(<reference path=\"[a-zA-Z0-9_\\.\\/-]+\"[ ]*\\/>\\n)var ([a-zA-Z0-9_]+);/, '$1this.$2 = this.$2 || {};\\nvar $2 = this.$2;')\n\t\t//\t\t.replace(/^\\s*var ([a-zA-Z0-9_]+);/, 'this.$1 = this.$1 || {};\\nvar $1 = this.$1;');\n\n\t\tvar map = fs.readFileSync(jsPath + '.map')\n\t\t\t.toString()\n\t\t\t.replace(/\"sources\":\\[\"[0-9a-zA-Z-\\/\\.-]+\"]/, '\"sources\":[\"' + inputFile.getDisplayPath() + '\"]');\n\t\tmap = map.substr(0, map.length - 1) + ',\"sourcesContent\":[\"' + fs.readFileSync(fullPath)\n\t\t\t\t.toString()\n\t\t\t\t.replace(/[\\\\]/g, '\\\\\\\\')\n\t\t\t\t.replace(/[\"]/g, '\\\\\"')\n\t\t\t\t.replace(/[\\b]/g, '\\\\b')\n\t\t\t\t.replace(/[\\f]/g, '\\\\f')\n\t\t\t\t.replace(/[\\n]/g, '\\\\n')\n\t\t\t\t.replace(/[\\r]/g, '\\\\r')\n\t\t\t\t.replace(/[\\t]/g, '\\\\t') + '\"]}';\n\t\treturn {\n\t\t\tpath: pathInPackage + \".js\",\n\t\t\tdata: data,\n\t\t\tsourceMap: map\n\t\t};\n\t}","function Yj(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};Yj.installed||(Yj.installed=!0,t.use(i,e),t.use(o,e),t.use(a,e),t.use(s,e),t.use(l,e),t.use(u,e),t.use(c,e),t.use(d,e),t.use(h,e),t.use(f,e),t.use(p,e),t.use(A,e),t.use(m,e),t.use(g,e),t.use(v,e),t.use(y,e),t.use(b,e),t.use(_,e),t.use(w,e),t.use(x,e),t.use(C,e),t.use(S,e),t.use(M,e),t.use(T,e),t.use(E,e),t.use(L,e),t.use(B,e),t.use(O,e),t.use(k,e),t.use(D,e),t.use(F,e),t.use(P,e),t.use(I,e),t.use(N,e),t.use(j,e),t.use(R,e),t.use(H,e),t.use(U,e),t.use(Y,e),t.use(z,e),t.use(Q,e),t.use($,e),t.use(V,e),t.use(G,e))}","function compileCode() {\n // Disables the compile button\n disableCompileButton();\n\n // Get the classes from the editor\n let classes = [];\n editor.getClasses().forEach(element => {\n classes.push({ name: element.name, code: element.doc.getValue() });\n });\n\n resultsComponent.componentWillReceiveProps({\n display: true,\n resultState: { compiling: true, error: false }\n });\n axios\n .post(\"/compile\", {\n challenge: editor.getChallengePath(),\n classes\n })\n .then(function(res) {\n if (res.data.error) {\n resultsComponent.componentWillReceiveProps({\n display: true,\n resultState: { error: res.data.error }\n });\n } else {\n resultsComponent.componentWillReceiveProps({\n display: true,\n resultState: {\n compiling: false,\n error: false,\n data: res.data\n }\n });\n }\n enableCompileButton();\n })\n .catch(function(err) {\n enableCompileButton();\n resultsComponent.componentWillReceiveProps({\n display: true,\n resultState: {\n compiling: false,\n error: \"The request failed. Try again later.\"\n }\n });\n });\n}","constructor() {\n this.startTime = Date.now();\n this.attributes = {\n \"version\": 0.5, \n \"lang\": \"node.js\",\n \"startTime\": this.startTime\n };\n\n this.inspectedCPU = false;\n this.inspectedMemory = false;\n this.inspectedContainer = false;\n this.inspectedPlatform = false;\n this.inspectedLinux = false;\n }"],"string":"[\n \"function compile() {\\n\\n}\",\n \"function VersionCompiler() {\\n}\",\n \"Compile() {\\n\\n }\",\n \"function Compiler() {\\n}\",\n \"function compileLibC () {\\n console.log('compileLibC');\\n\\n /* compile a fake program that uses c library */\\n execSync(\\n 'cl65 -T -t c64 -O -Os ' +\\n '-Ln build/libc.lbl ' +\\n '--static-locals ' +\\n '--config ' + (passPostfix === '' ? '' : 'build/') + 'libc' + passPostfix + '.cfg ' +\\n 'libc.c'\\n );\\n\\n /* create an zeroed binary the same size as the total ram used */\\n execSync(\\n '(' +\\n 'echo -n \\\"ibase=16;scale=16;\\\" && ' +\\n '((grep __RAM2_LAST__ build/libc.lbl|' +\\n \\\"sed -n \\\\\\\"s/al \\\\\\\\([^ ]*\\\\\\\\).*/\\\\\\\\1/p\\\\\\\")|tr -d '\\\\n')\\\" +\\n ' && echo -n \\\"-\\\" && ' +\\n 'grep __RAM2_START__ build/libc.lbl|' +\\n 'sed -n \\\"s/al \\\\\\\\([^ ]*\\\\\\\\).*/\\\\\\\\1/p\\\"' +\\n ')|bc|' +\\n 'xargs -I {} dd if=/dev/zero bs=1 count={} of=build/libcdata.bin'\\n );\\n\\n /* Create a combined binary of the ram segments\\n so that they can be copied as one blob */\\n execSync(\\n 'dd if=build/libcdata2.bin of=build/libcdata.bin conv=notrunc;' +\\n 'rm build/libcdata2.bin'\\n );\\n\\n /* read the label file and use its contents to\\n update each function address in the hashmap */\\n const lineReader = readline.createInterface({\\n input: fs.createReadStream('build/libc.lbl')\\n });\\n\\n lineReader.on('line', updateFunctionAddress.bind(2));\\n\\n /* when finished, start the next step (compiling the functions that\\n make up my program) */\\n lineReader.on('close', passPostfix === '' ? compileLexer : compileData);\\n}\",\n \"function CCUtility() {}\",\n \"function compile() {\\n cloudCompile('Compile', 'compile', function (data, terminalNeeded) {});\\n}\",\n \"getCpp(){ return this.program.generateCpp(); }\",\n \"static fromCASFile(casfile) {\\n//-----------\\nlggr.warn(\\\"fromCASFile: Not implemented\\\");\\nreturn void 0;\\n}\",\n \"compile() {\\n if (this.currentProgram.isExecutable()) {\\n this.messageBox.message = \\\"Erfolgreich übersetzt!\\\\nProgramm kann ausgeführt werden.\\\"\\n } else if (this.currentProgram.isNotExecutable()) {\\n this.messageBox.message = \\\"Übersetzungsfehler!\\\\n\\\" + this.currentProgram.errorMessage;\\n } else if (this.currentProgram.isUnknown()) {\\n this.messageBox.message = \\\"Backend ist noch nicht implementiert.\\\\nSelbst geschriebene Programme können noch nicht übersetzt werden.\\\\nBitte verwende ein Beispielprogramm.\\\";\\n } else {\\n console.error(\\\"Unbekannter Status in currentProgram.\\\");\\n }\\n }\",\n \"function __jsc(what) {\\n\\treturn window.JSC ? window.JSC[what] : null;\\n}\",\n \"function Code() {\\n // convert to comp bit code\\n}\",\n \"static final private internal function m106() {}\",\n \"function Compiler(){\\n this.reset = function() { this.descriptorsByFile = {}; }.bind(this);\\n\\n this.reset();\\n}\",\n \"function deploy(bytecode, abi, pipe) {\\n\\n}\",\n \"function comportement (){\\n\\t }\",\n \"function compile() {\\n fs.readFile(src, 'utf8', function(err, str){\\n if (err) {\\n next(err);\\n } else {\\n compiler.compile(str, function(err, str){\\n if (err) {\\n next(err);\\n } else {\\n fs.writeFile(dest, str, 'utf8', function(err){\\n next(err);\\n });\\n }\\n });\\n }\\n });\\n }\",\n \"compile() {\\n // Check if it is already compiled\\n if (!this.compiled) {\\n // Find the file and read it into memory\\n let filePath = path.resolve(__dirname, 'contracts', 'SimpleStorage.sol');\\n let fileSource = fs.readFileSync(filePath, 'UTF-8');\\n\\n // Compile the contract with the contract source and 1 for optimization\\n let compiled = solc.compile(fileSource, 1);\\n\\n // Store the bytecode, as we need it for deployment\\n this.bytecode = \\\"0x\\\" + compiled.contracts[':simplestorage'].bytecode;\\n\\n // Store the abi (application binary interface) for js to interface with the contract on the chain\\n let contractInterface = compiled.contracts[':simplestorage'].interface; // this is a json object that web3 uses as an interface\\n this.abi = JSON.parse(contractInterface);\\n this.compiled = true;\\n }\\n }\",\n \"@memoize\\n get compiler() {\\n return new TaskList({\\n debug: true,\\n name: `Compiling ${this.type}: ${this.projectName}`,\\n tasks: [\\n this.parser,\\n TaskList.forEach({\\n name: `Compiling imports`,\\n list: () => this.activeImports,\\n getTask: (file) =>\\n new Task({\\n name: `Compiling import: ${file.file}`,\\n run: () => file.compile()\\n })\\n }),\\n new Task({\\n name: \\\"Combining output\\\",\\n run: (allCompiled) => {\\n const compiled = allCompiled.join(\\\"\\\\n// -----------\\\\n\\\")\\n this.setState(\\\"compiled\\\", compiled)\\n return compiled\\n }\\n }),\\n new Task({\\n name: \\\"Saving compiled output\\\",\\n run: async (compiled) => {\\n this.outputFile.setContents(compiled)\\n return await this.outputFile.save()\\n }\\n })\\n ]\\n })\\n }\",\n \"function detectCompilerInfo(decoded) {\\n if (typeof decoded !== \\\"object\\\" || decoded === null) {\\n return undefined;\\n }\\n //cbor sometimes returns maps and sometimes objects,\\n //so let's make things consistent by converting to a map\\n //(although see note above?)\\n if (!(decoded instanceof Map)) {\\n decoded = new Map(Object.entries(decoded));\\n }\\n if (!decoded.has(\\\"solc\\\")) {\\n //return undefined if the solc version field is not present\\n //(this occurs if version <0.5.9)\\n //currently no other language attaches cbor info, so, yeah\\n return undefined;\\n }\\n const rawVersion = decoded.get(\\\"solc\\\");\\n if (typeof rawVersion === \\\"string\\\") {\\n //for prerelease versions, the version is stored as a string.\\n return {\\n name: \\\"solc\\\",\\n version: rawVersion\\n };\\n }\\n else if (rawVersion instanceof Uint8Array && rawVersion.length === 3) {\\n //for release versions, it's stored as a bytestring of length 3, with the\\n //bytes being major, minor, patch. so we just join them with \\\".\\\" to form\\n //a version string (although it's missing precise commit & etc).\\n return {\\n name: \\\"solc\\\",\\n version: rawVersion.join(\\\".\\\")\\n };\\n }\\n else {\\n //return undefined on anything else\\n return undefined;\\n }\\n}\",\n \"compile() {\\n try {\\n let code = this.state.code.replace(/\\\\t/g, \\\"\\\").replace(/ /g, \\\"\\\").replace(/\\\\r\\\\n/g, \\\"\\\\n\\\"); // delete all spaces and tabs\\n\\n this.machine.name = this.setName(code); // set name\\n this.machine.memory = this.memoryInit(code); // set variables and adressess\\n this.machine.instructions = this.setInstructions(code); // set commands\\n \\n this.machine.ready = true; // change state of machine\\n this.machine.running = false;\\n this.machine.error = false;\\n this.machine.currentOp = 0;\\n\\n this.log(\\\"Skompilowano program: \\\" + this.machine.name);\\n console.log(this.machine.memory)\\n } catch(e) {\\n this.log(e.name + \\\": \\\" + e.message, \\\"error\\\");\\n this.machine.ready = false;\\n this.machine.error = true;\\n } finally {\\n this.setState({\\n name: this.machine.name,\\n ready: this.machine.ready,\\n error: this.machine.error,\\n running: this.machine.running,\\n currentOp: this.machine.currentOp,\\n memory: this.machine.memory\\n });\\n }\\n }\",\n \"__recompile() {\\n this.__isMounted = false;\\n this.__isCompiled = false;\\n this.__evaluationComponent.__disableProxy = null;\\n this.__compiling = {};\\n this.__recompiling = {};\\n this.__setEvents();\\n this.__setParents();\\n this.__setBooleanAttributes();\\n this.__defineAttributes();\\n }\",\n \"function baseCompile(component, target) {\\n\\n const importVueTemp = () => `import _${uppercamelize(component)} from './${component}';`;\\n const importStyleTemp = () => `import './style';`;\\n const exportTemp = () => `export default _${uppercamelize(component)};`;\\n\\n const content = `${utils.tips(packageJson.author)}\\n \\n${importVueTemp()}\\n\\n${importStyleTemp()}\\n\\n${exportTemp()}`;\\n\\n fs.writeFileSync(target, content);\\n}\",\n \"function mbcs() {}\",\n \"function mbcs() {}\",\n \"function rc(){}\",\n \"async function compiler() {\\n\\ttry {\\n\\t await electronInstaller.createWindowsInstaller({\\n\\t appDirectory: '/var/www/nicoldesktop/release-builds/Insurance-win32-ia32',\\n\\t outputDirectory: '/var/www/nicoldesktop/release-builds/Insurance-win32-ia32/installer',\\n\\t authors: 'NICOL Devs',\\n\\t exe: 'Insurance.exe',\\n\\t iconUrl: '/var/www/nicoldesktop/assets/icons/win/icon.ico', \\n\\t setupIcon: '/var/www/nicoldesktop/assets/icons/win/icon.ico',\\n\\t setupExe: 'NICOL.exe',\\n\\t setupMsi: 'NICOL.exe'\\n\\t });\\n\\t console.log('It worked!');\\n\\t} catch (e) {\\n\\t console.log(`No dice: ${e.message}`);\\n\\t}\\n}\",\n \"function fos6_c() {\\n ;\\n }\",\n \"function getCompilerOpts(config)\\r\\n{\\r\\n // set vars to initial state\\r\\n VERSION = \\\"\\\";\\r\\n DEVENV = \\\"\\\";\\r\\n DEVENVFLAGS = \\\"\\\";\\r\\n CPPFLAGS = \\\"\\\";\\r\\n LDFLAGS = \\\"\\\";\\r\\n LIBS = \\\"\\\";\\r\\n CONVERT = false;\\r\\n CXX = \\\"\\\";\\r\\n LD = \\\"\\\";\\r\\n AR = \\\"\\\";\\r\\n AS = \\\"\\\";\\r\\n SLNVER=\\\"\\\";\\r\\n SLNCOMMENT=\\\"\\\";\\r\\n UNICODELOG = false;\\r\\n NOSTCRT = false;\\r\\n WINDIFF = \\\"\\\";\\r\\n ICCCONVERT = \\\"\\\";\\r\\n PLATFORM = \\\"\\\";\\r\\n CLVARSBAT = \\\"\\\";\\r\\n ICCVER = \\\"\\\";\\r\\n\\r\\n parseConfig(config);\\r\\n\\r\\n if (0 == WINDIFF.length)\\r\\n {\\r\\n if (VERSION.length)\\r\\n {\\r\\n var ver = \\\"\\\";\\r\\n if (0 <= VERSION.indexOf(\\\".\\\"))\\r\\n ver = VERSION.replace(\\\".\\\", \\\"\\\");\\r\\n var path = WshShell.Environment.Item(\\\"VS\\\" + ver + \\\"COMNTOOLS\\\");\\r\\n if (path.length)\\r\\n {\\r\\n WINDIFF = \\\"\\\\\\\"\\\" +\\r\\n fso.BuildPath(path.replace(/\\\\\\\"/g, \\\"\\\"), \\\"bin\\\\\\\\windiff\\\") +\\r\\n \\\"\\\\\\\"\\\";\\r\\n }\\r\\n }\\r\\n\\r\\n if (0 == WINDIFF.length)\\r\\n WINDIFF = \\\"windiff\\\";\\r\\n }\\r\\n}\",\n \"function cp15() {\\n this.c0_cpuid = 0;\\n this.c0_cachetype = 0;\\n this.c0_c1 = new Uint32Array(8); // Feature registers. \\n this.c0_c2 = new Uint32Array(8); // Instruction set registers. \\n this.c1_sys = 0;// System control register. \\n this.c1_coproc = 0; // Coprocessor access register. \\n this.c1_xscaleauxcr = 0; // XScale auxiliary control register. \\n this.c2_base0 = 0; // MMU translation table base 0. \\n this.c2_base1 = 0; // MMU translation table base 1. \\n this.c2_mask = 0; // MMU translation table base mask. \\n this.c2_data = 0; // MPU data cachable bits. \\n this.c2_insn = 0; // MPU instruction cachable bits. \\n this.c3 = 0; // MMU domain access control register MPU write buffer control. \\n this.c5_insn = 0; // Fault status registers. \\n this.c5_data = 0;\\n this.c6_region = new Uint32Array(8); // MPU base/size registers. \\n this.c6_insn = 0; // Fault address registers. \\n this.c6_data = 0;\\n this.c9_insn = 0; // Cache lockdown registers. \\n this.c9_data = 0;\\n this.c13_fcse = 0; // FCSE PID. \\n this.c13_context = 0; // Context ID. \\n this.c13_tls1 = 0; // User RW Thread register. \\n this.c13_tls2 = 0; // User RO Thread register. \\n this.c13_tls3 = 0; // Privileged Thread register. \\n this.c15_cpar = 0; // XScale Coprocessor Access Register \\n this.c15_ticonfig = 0; // TI925T configuration byte. \\n this.c15_i_max = 0; // Maximum D-cache dirty line index. \\n this.c15_i_min = 0; // Minimum D-cache dirty line index. \\n this.c15_threadid = 0; // TI debugger thread-ID. \\n } //} cp15;\",\n \"static startCompile() {\\n //Set compilation flag to true.\\n isCompiling = true;\\n _Functions.log('INFO: Beginning Compilation...');\\n //Get source code from text area input.\\n let code = document.getElementById(\\\"inputCode\\\").value;\\n //code = mackintosh.compilerFunctions.trim(code);\\n _Lexer.populateProgram(code);\\n _Lexer.lex();\\n //Check if there is a $ at the end of the program, if not display warning.\\n if (program[program.length - 1] != '$') {\\n _Functions.log('LEXER WARNING: End of Program $ Not Found.');\\n warnCount++;\\n }\\n return isCompiling;\\n }\",\n \"function startMyCompiler() {\\n throw new Error('You have no compiler!');\\n}\",\n \"function compliment() {\\n return \\\"Lekker bezig met die functies, Jan!\\\"\\n}\",\n \"function fetchCompileCode(base, body) {\\n return request_1.default({\\n base: base,\\n url: '/utils/script/compileCode',\\n options: {\\n method: 'POST',\\n body: body,\\n headers: {\\n 'Content-Type': 'application/json'\\n }\\n }\\n });\\n}\",\n \"function b(){var a,b=\\\"axe\\\",c=\\\"\\\";return\\\"undefined\\\"!=typeof axe&&axe._audit&&!axe._audit.application&&(b=axe._audit.application),\\\"undefined\\\"!=typeof axe&&(c=axe.version),a=b+\\\".\\\"+c}\",\n \"function compile_fun() {\\n exec(\\\"mi \\\" + sourceFile + ' > ' + __dirname +'/webpage/js/data-source.js', (error, stdout, stderr) => {\\n\\tif (error) {\\n\\t fs.readFile(__dirname +'/webpage/js/data-source.js', function(err, buf) {\\n\\t\\tfs.writeFile(__dirname +'/webpage/js/data-source.js',\\n\\t\\t\\t \\\"let inputModel = '\\\" + buf.toString().replace(/(\\\\r\\\\n|\\\\n|\\\\r)/gm, \\\"\\\")\\n\\t\\t\\t + \\\"';\\\" , function (err) {if (err) return console.log(err);});});return;}\\n\\tif (stderr) {\\n console.log(`stderr: ${stderr}`);\\n return;\\n\\t}\\n });\\n}\",\n \"transient private internal function m185() {}\",\n \"function InterpreterCompileAndRun( program_text )\\n{\\n\\t// Clear contents.\\n\\tinterpreter_stdout = '';\\n\\tinterpreter_stderr = '';\\n\\n\\tvar file_name = 'test.u';\\n\\tFS.writeFile( file_name, program_text );\\n\\tvar call_result = callMain( [file_name, '--entry', 'main'] );\\n\\n\\treturn [ call_result, interpreter_stdout, interpreter_stderr ];\\n}\",\n \"function ELCHNOSCompiler(printFunc, downloadBoxDOMObject){\\n\\t//printFunc省略時はconsole.logに出力。\\n\\tif(printFunc){\\n\\t\\tthis.debug = printFunc;\\n\\t} else{\\n\\t\\tthis.debug = function(s){ console.log(s); };\\n\\t}\\n\\tthis.downloadBoxDOMObject = downloadBoxDOMObject;\\n\\t\\n\\tthis.reset();\\n\\t//0はエントリポイント(main)用に予約\\n\\tthis.nextLabelID = 1;\\n\\tthis.integerRegisterAllocationTable = new Array();\\n\\tthis.pointerRegisterAllocationTable = new Array();\\n}\",\n \"function ze(e,t){arguments.length>2&&(t.dependencies=Array.prototype.slice.call(arguments,2)),ci[e]=t}\",\n \"function c(e,t,n){Array.isArray(e)?(n=t,t=e,e=void 0):\\\"string\\\"!=typeof e&&(n=e,e=t=void 0),t&&!Array.isArray(t)&&(n=t,t=void 0),t||(t=[\\\"require\\\",\\\"exports\\\",\\\"module\\\"]),\\n//Set up properties for this module. If an ID, then use\\n//internal cache. If no ID, then use the external variables\\n//for this node module.\\ne?\\n//Put the module in deep freeze until there is a\\n//require call for it.\\nd[e]=[e,t,n]:l(e,t,n)}\",\n \"function compileClicked() {\\r\\n\\t\\tvar enabledSections = {};\\r\\n\\t\\t$('.secCheck').each(function(cb) {\\r\\n\\t\\t\\tif (cb.checked)\\r\\n\\t\\t\\t\\tenabledSections[cb.id.substr(4)] = 1;\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\tvar src = compile(s.sections, s.sectionMap, enabledSections);\\r\\n\\t\\tvar header = serializeEnabledSections(s.sections, enabledSections);\\r\\n\\t\\tif ($$('#compressionAdvanced').checked) {\\r\\n\\t\\t\\t$$('#compile').disabled = true;\\r\\n\\t\\t\\tclosureCompile(src, true, function(closureResult) {\\r\\n\\t\\t\\t\\t$$('#compile').disabled = false;\\r\\n\\t\\t\\t\\t$('#resultDiv').animate({$$slide: 1, $$show: 1});\\r\\n\\t\\t\\t\\tif (closureResult) {\\r\\n\\t\\t\\t\\t\\t$('#gzipRow, #downloadRow').set({$display: 'table-row'});\\r\\n\\t\\t\\t\\t\\t$$('#resultSrc').value = header + closureResult.compiledCode;\\r\\n\\t\\t\\t\\t\\t$('#resultPlain').fill((closureResult.statistics.compressedSize/1024).toFixed(2) + 'kb (' + closureResult.statistics.compressedSize + ' bytes)');\\r\\n\\t\\t\\t\\t\\t$('#resultGzippedSize').fill((closureResult.statistics.compressedGzipSize/1024).toFixed(2) + 'kb (' + closureResult.statistics.compressedGzipSize + ' bytes)');\\r\\n\\t\\t\\t\\t\\t$$('#resultLink').setAttribute('href', 'http://closure-compiler.appspot.com' +closureResult.outputFilePath);\\r\\n\\t\\t\\t\\t\\t$('#resultGzippedComment').set({$$fade: closureResult.statistics.compressedGzipSize > MAX_SIZE ? 1 : 0});\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\talert(\\\"Google Closure Service not availble. Try again later.\\\");\\r\\n\\t\\t\\t});\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\t$('#resultDiv').animate({$$slide: 1, $$show: 1});\\r\\n\\t\\t\\t$$('#resultSrc').value = header + src.replace(/@@@VERSION@@@/, VERSION);\\r\\n\\t\\t\\t$('#resultPlain').fill((src.length/1024).toFixed(2) + 'kb');\\r\\n\\t\\t\\t$('#gzipRow, #downloadRow').set({$display: 'none'});\\r\\n\\t\\t}\\r\\n\\t\\treturn false;\\r\\n\\t}\",\n \"get compilerObject() {\\r\\n return this._compilerObject;\\r\\n }\",\n \"function runtime() {\\n\\t _dereq_(578);\\n\\t}\",\n \"function jj(t,e,n,r,i,o,a,s){var l=(\\\"function\\\"===typeof n?n.options:n)||{};return l.__file=\\\"source.vue\\\",l.render||(l.render=t.render,l.staticRenderFns=t.staticRenderFns,l._compiled=!0,i&&(l.functional=!0)),l._scopeId=r,l}\",\n \"function cO(t,e,n,i,r,o,a,s){var u=(\\\"function\\\"===typeof n?n.options:n)||{};return u.__file=\\\"source.vue\\\",u.render||(u.render=t.render,u.staticRenderFns=t.staticRenderFns,u._compiled=!0,r&&(u.functional=!0)),u._scopeId=i,u}\",\n \"systemCheck() {\\n\\n }\",\n \"function no_overlib() { return ver3fix; }\",\n \"function compile() {\\n //Return error-log to logger\\n if (document.getElementById('error-log') !== null) {\\n document.getElementById('error-log').innerHTML = \\\"\\\";\\n document.getElementById('error-log').id = 'machine-code';\\n }\\n //Start lexical analysis\\n lex();\\n}\",\n \"function Compiler () {\\n this.importPath = []\\n this.entryFile = null\\n this.typeSystem = new TypeSystem()\\n this.parser = new Parser()\\n // Setup the default import path\\n var extDir = path.join(path.dirname(__filename), '..', 'ext')\\n this.importPath.push(extDir)\\n}\",\n \"get complication() {\\n\\t\\treturn this.__complication;\\n\\t}\",\n \"private internal function m248() {}\",\n \"function LoadCrunchDecoder() {\\n function e(a){throw a;}var j=void 0,l=!0,m=null,p=!1;function q(){return function(){}}var s;s||(s=eval(\\\"(function() { try { return Module || {} } catch(e) { return {} } })()\\\"));var aa={},v;for(v in s)s.hasOwnProperty(v)&&(aa[v]=s[v]);var w=\\\"object\\\"===typeof process&&\\\"function\\\"===typeof require,ba=\\\"object\\\"===typeof window,ca=\\\"function\\\"===typeof importScripts,da=!ba&&!w&&!ca;\\n if(w){s.print=function(a){process.stdout.write(a+\\\"\\\\n\\\")};s.printErr=function(a){process.stderr.write(a+\\\"\\\\n\\\")};var ea=require(\\\"fs\\\"),fa=require(\\\"path\\\");s.read=function(a,b){var a=fa.normalize(a),c=ea.readFileSync(a);!c&&a!=fa.resolve(a)&&(a=path.join(__dirname,\\\"..\\\",\\\"src\\\",a),c=ea.readFileSync(a));c&&!b&&(c=c.toString());return c};s.readBinary=function(a){return s.read(a,l)};s.load=function(a){ga(read(a))};s.arguments=process.argv.slice(2);module.exports=s}else da?(s.print=print,\\\"undefined\\\"!=typeof printErr&&\\n (s.printErr=printErr),s.read=\\\"undefined\\\"!=typeof read?read:function(){e(\\\"no read() available (jsc?)\\\")},s.readBinary=function(a){return read(a,\\\"binary\\\")},\\\"undefined\\\"!=typeof scriptArgs?s.arguments=scriptArgs:\\\"undefined\\\"!=typeof arguments&&(s.arguments=arguments),this.Module=s):ba||ca?(s.read=function(a){var b=new XMLHttpRequest;b.open(\\\"GET\\\",a,p);b.send(m);return b.responseText},\\\"undefined\\\"!=typeof arguments&&(s.arguments=arguments),\\\"undefined\\\"!==typeof console?(s.print=function(a){console.log(a)},\\n s.printErr=function(a){console.log(a)}):s.print=q(),ba?this.Module=s:s.load=importScripts):e(\\\"Unknown runtime environment. Where are we?\\\");function ga(a){eval.call(m,a)}\\\"undefined\\\"==!s.load&&s.read&&(s.load=function(a){ga(s.read(a))});s.print||(s.print=q());s.printErr||(s.printErr=s.print);s.arguments||(s.arguments=[]);s.print=s.print;s.P=s.printErr;s.preRun=[];s.postRun=[];for(v in aa)aa.hasOwnProperty(v)&&(s[v]=aa[v]);function ha(){return x}function ia(a){x=a}\\n function ja(a){switch(a){case \\\"i1\\\":case \\\"i8\\\":return 1;case \\\"i16\\\":return 2;case \\\"i32\\\":return 4;case \\\"i64\\\":return 8;case \\\"float\\\":return 4;case \\\"double\\\":return 8;default:if(\\\"*\\\"===a[a.length-1])return ka;if(\\\"i\\\"===a[0])return a=parseInt(a.substr(1)),A(0===a%8),a/8}}function la(a,b,c){c&&c.length?(c.splice||(c=Array.prototype.slice.call(c)),c.splice(0,0,b),s[\\\"dynCall_\\\"+a].apply(m,c)):s[\\\"dynCall_\\\"+a].call(m,b)}var ma;\\n function na(){var a=[],b=0;this.za=function(c){c&=255;if(0==a.length){if(0==(c&128))return String.fromCharCode(c);a.push(c);b=192==(c&224)?1:224==(c&240)?2:3;return\\\"\\\"}if(b&&(a.push(c),b--,0<b))return\\\"\\\";var c=a[0],d=a[1],f=a[2],h=a[3];2==a.length?c=String.fromCharCode((c&31)<<6|d&63):3==a.length?c=String.fromCharCode((c&15)<<12|(d&63)<<6|f&63):(c=(c&7)<<18|(d&63)<<12|(f&63)<<6|h&63,c=String.fromCharCode(Math.floor((c-65536)/1024)+55296,(c-65536)%1024+56320));a.length=0;return c};this.Cb=function(a){for(var a=\\n unescape(encodeURIComponent(a)),b=[],f=0;f<a.length;f++)b.push(a.charCodeAt(f));return b}}function oa(a){var b=x;x=x+a|0;x=x+7&-8;return b}function pa(a){var b=B;B=B+a|0;B=B+7&-8;return b}function qa(a){var b=D;D=D+a|0;D=D+7&-8;D>=ra&&E(\\\"Cannot enlarge memory arrays in asm.js. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value \\\"+ra+\\\", or (2) set Module.TOTAL_MEMORY before the program runs.\\\");return b}function sa(a,b){return Math.ceil(a/(b?b:8))*(b?b:8)}\\n var ka=4,ta={},ua=p,va;function A(a,b){a||E(\\\"Assertion failed: \\\"+b)}s.ccall=function(a,b,c,d){return wa(xa(a),b,c,d)};function xa(a){try{var b=s[\\\"_\\\"+a];b||(b=eval(\\\"_\\\"+a))}catch(c){}A(b,\\\"Cannot call unknown function \\\"+a+\\\" (perhaps LLVM optimizations or closure removed it?)\\\");return b}\\n function wa(a,b,c,d){function f(a,b){if(\\\"string\\\"==b){if(a===m||a===j||0===a)return 0;a=H(a);b=\\\"array\\\"}if(\\\"array\\\"==b){h||(h=ha());var c=oa(a.length);ya(a,c);return c}return a}var h=0,g=0,d=d?d.map(function(a){return f(a,c[g++])}):[];a=a.apply(m,d);\\\"string\\\"==b?b=za(a):(A(\\\"array\\\"!=b),b=a);h&&ia(h);return b}s.cwrap=function(a,b,c){var d=xa(a);return function(){return wa(d,b,c,Array.prototype.slice.call(arguments))}};\\n function Aa(a,b,c){c=c||\\\"i8\\\";\\\"*\\\"===c.charAt(c.length-1)&&(c=\\\"i32\\\");switch(c){case \\\"i1\\\":I[a]=b;break;case \\\"i8\\\":I[a]=b;break;case \\\"i16\\\":J[a>>1]=b;break;case \\\"i32\\\":K[a>>2]=b;break;case \\\"i64\\\":va=[b>>>0,(tempDouble=b,1<=+Ba(tempDouble)?0<tempDouble?(Ca(+Da(tempDouble/4294967296),4294967295)|0)>>>0:~~+Ea((tempDouble-+(~~tempDouble>>>0))/4294967296)>>>0:0)];K[a>>2]=va[0];K[a+4>>2]=va[1];break;case \\\"float\\\":Fa[a>>2]=b;break;case \\\"double\\\":Ga[a>>3]=b;break;default:E(\\\"invalid type for setValue: \\\"+c)}}\\n s.setValue=Aa;s.getValue=function(a,b){b=b||\\\"i8\\\";\\\"*\\\"===b.charAt(b.length-1)&&(b=\\\"i32\\\");switch(b){case \\\"i1\\\":return I[a];case \\\"i8\\\":return I[a];case \\\"i16\\\":return J[a>>1];case \\\"i32\\\":return K[a>>2];case \\\"i64\\\":return K[a>>2];case \\\"float\\\":return Fa[a>>2];case \\\"double\\\":return Ga[a>>3];default:E(\\\"invalid type for setValue: \\\"+b)}return m};var Ha=1,Ia=2,Ja=4;s.ALLOC_NORMAL=0;s.ALLOC_STACK=Ha;s.ALLOC_STATIC=Ia;s.ALLOC_DYNAMIC=3;s.ALLOC_NONE=Ja;\\n function L(a,b,c,d){var f,h;\\\"number\\\"===typeof a?(f=l,h=a):(f=p,h=a.length);var g=\\\"string\\\"===typeof b?b:m,c=c==Ja?d:[Ka,oa,pa,qa][c===j?Ia:c](Math.max(h,g?1:b.length));if(f){d=c;A(0==(c&3));for(a=c+(h&-4);d<a;d+=4)K[d>>2]=0;for(a=c+h;d<a;)I[d++|0]=0;return c}if(\\\"i8\\\"===g)return a.subarray||a.slice?M.set(a,c):M.set(new Uint8Array(a),c),c;for(var d=0,i,r;d<h;){var t=a[d];\\\"function\\\"===typeof t&&(t=ta.Sd(t));f=g||b[d];0===f?d++:(\\\"i64\\\"==f&&(f=\\\"i32\\\"),Aa(c+d,t,f),r!==f&&(i=ja(f),r=f),d+=i)}return c}\\n s.allocate=L;function za(a,b){for(var c=p,d,f=0;;){d=M[a+f|0];if(128<=d)c=l;else if(0==d&&!b)break;f++;if(b&&f==b)break}b||(b=f);var h=\\\"\\\";if(!c){for(;0<b;)d=String.fromCharCode.apply(String,M.subarray(a,a+Math.min(b,1024))),h=h?h+d:d,a+=1024,b-=1024;return h}c=new na;for(f=0;f<b;f++)d=M[a+f|0],h+=c.za(d);return h}s.Pointer_stringify=za;s.UTF16ToString=function(a){for(var b=0,c=\\\"\\\";;){var d=J[a+2*b>>1];if(0==d)return c;++b;c+=String.fromCharCode(d)}};\\n s.stringToUTF16=function(a,b){for(var c=0;c<a.length;++c)J[b+2*c>>1]=a.charCodeAt(c);J[b+2*a.length>>1]=0};s.UTF32ToString=function(a){for(var b=0,c=\\\"\\\";;){var d=K[a+4*b>>2];if(0==d)return c;++b;65536<=d?(d-=65536,c+=String.fromCharCode(55296|d>>10,56320|d&1023)):c+=String.fromCharCode(d)}};s.stringToUTF32=function(a,b){for(var c=0,d=0;d<a.length;++d){var f=a.charCodeAt(d);if(55296<=f&&57343>=f)var h=a.charCodeAt(++d),f=65536+((f&1023)<<10)|h&1023;K[b+4*c>>2]=f;++c}K[b+4*c>>2]=0};\\n function La(a){try{\\\"number\\\"===typeof a&&(a=za(a));if(\\\"_\\\"!==a[0]||\\\"_\\\"!==a[1]||\\\"Z\\\"!==a[2])return a;var b=3,c={v:\\\"void\\\",b:\\\"bool\\\",c:\\\"char\\\",s:\\\"short\\\",i:\\\"int\\\",l:\\\"long\\\",f:\\\"float\\\",d:\\\"double\\\",w:\\\"wchar_t\\\",a:\\\"signed char\\\",h:\\\"unsigned char\\\",t:\\\"unsigned short\\\",j:\\\"unsigned int\\\",m:\\\"unsigned long\\\",x:\\\"long long\\\",y:\\\"unsigned long long\\\",z:\\\"...\\\"},d=[],f=function(h,i,r){var i=i||Infinity,t=\\\"\\\",y=[],u;if(\\\"N\\\"!==a[b]){\\\"K\\\"===a[b]&&b++;var n=parseInt(a.substr(b));if(n){var F=n.toString().length;u=a.substr(b+F,n);b+=F+n}}else{b++;\\n \\\"K\\\"===a[b]&&b++;for(u=[];\\\"E\\\"!==a[b];)if(\\\"S\\\"===a[b])b++,n=a.indexOf(\\\"_\\\",b),u.push(d[a.substring(b,n)||0]||\\\"?\\\"),b=n+1;else{n=parseInt(a.substr(b));F=n.toString().length;if(!n||!F){b--;break}var G=a.substr(b+F,n);u.push(G);d.push(G);b+=F+n}b++;u=u.join(\\\"::\\\");i--;if(0===i)return h?[u]:u}\\\"I\\\"===a[b]?(b++,n=f(l),F=f(l,1,l),t+=F[0]+\\\" \\\"+u+\\\"<\\\"+n.join(\\\", \\\")+\\\">\\\"):t=u;a:for(;b<a.length&&0<i--;)if(u=a[b++],u in c)y.push(c[u]);else switch(u){case \\\"P\\\":y.push(f(l,1,l)[0]+\\\"*\\\");break;case \\\"R\\\":y.push(f(l,1,l)[0]+\\\"&\\\");\\n break;case \\\"L\\\":b++;n=a.indexOf(\\\"E\\\",b)-b;y.push(a.substr(b,n));b+=n+2;break;case \\\"A\\\":n=parseInt(a.substr(b));b+=n.toString().length;\\\"_\\\"!==a[b]&&e(\\\"?\\\");b++;y.push(f(l,1,l)[0]+\\\" [\\\"+n+\\\"]\\\");break;case \\\"E\\\":break a;default:t+=\\\"?\\\"+u;break a}!r&&(1===y.length&&\\\"void\\\"===y[0])&&(y=[]);return h?y:t+(\\\"(\\\"+y.join(\\\", \\\")+\\\")\\\")};return f()}catch(h){return a}}function Ma(){var a=Error().stack;return a?a.replace(/__Z[\\\\w\\\\d_]+/g,function(a){var c=La(a);return a===c?a:a+\\\" [\\\"+c+\\\"]\\\"}):\\\"(no stack trace available)\\\"}\\n var I,M,J,Na,K,Oa,Fa,Ga,Qa=0,B=0,Ra=0,x=0,Sa=0,Ta=0,D=0,ra=s.TOTAL_MEMORY||16777216;A(\\\"undefined\\\"!==typeof Int32Array&&\\\"undefined\\\"!==typeof Float64Array&&!!(new Int32Array(1)).subarray&&!!(new Int32Array(1)).set,\\\"Cannot fallback to non-typed array case: Code is too specialized\\\");var N=new ArrayBuffer(ra);I=new Int8Array(N);J=new Int16Array(N);K=new Int32Array(N);M=new Uint8Array(N);Na=new Uint16Array(N);Oa=new Uint32Array(N);Fa=new Float32Array(N);Ga=new Float64Array(N);K[0]=255;\\n A(255===M[0]&&0===M[3],\\\"Typed arrays 2 must be run on a little-endian system\\\");s.HEAP=j;s.HEAP8=I;s.HEAP16=J;s.HEAP32=K;s.HEAPU8=M;s.HEAPU16=Na;s.HEAPU32=Oa;s.HEAPF32=Fa;s.HEAPF64=Ga;function Ua(a){for(;0<a.length;){var b=a.shift();if(\\\"function\\\"==typeof b)b();else{var c=b.M;\\\"number\\\"===typeof c?b.ta===j?la(\\\"v\\\",c):la(\\\"vi\\\",c,[b.ta]):c(b.ta===j?m:b.ta)}}}var Va=[],O=[],Wa=[],Xa=[],Ya=[],Za=p;function $a(a){Va.unshift(a)}s.addOnPreRun=s.Id=$a;s.addOnInit=s.Fd=function(a){O.unshift(a)};\\n s.addOnPreMain=s.Hd=function(a){Wa.unshift(a)};s.addOnExit=s.Ed=function(a){Xa.unshift(a)};function ab(a){Ya.unshift(a)}s.addOnPostRun=s.Gd=ab;function H(a,b,c){a=(new na).Cb(a);c&&(a.length=c);b||a.push(0);return a}s.intArrayFromString=H;s.intArrayToString=function(a){for(var b=[],c=0;c<a.length;c++){var d=a[c];255<d&&(d&=255);b.push(String.fromCharCode(d))}return b.join(\\\"\\\")};s.writeStringToMemory=function(a,b,c){a=H(a,c);for(c=0;c<a.length;)I[b+c|0]=a[c],c+=1};\\n function ya(a,b){for(var c=0;c<a.length;c++)I[b+c|0]=a[c]}s.writeArrayToMemory=ya;s.writeAsciiToMemory=function(a,b,c){for(var d=0;d<a.length;d++)I[b+d|0]=a.charCodeAt(d);c||(I[b+a.length|0]=0)};function bb(a,b){return 0<=a?a:32>=b?2*Math.abs(1<<b-1)+a:Math.pow(2,b)+a}function cb(a,b){if(0>=a)return a;var c=32>=b?Math.abs(1<<b-1):Math.pow(2,b-1);if(a>=c&&(32>=b||a>c))a=-2*c+a;return a}Math.imul||(Math.imul=function(a,b){var c=a&65535,d=b&65535;return c*d+((a>>>16)*d+c*(b>>>16)<<16)|0});Math.Vd=Math.imul;\\n var Ba=Math.abs,Ea=Math.ceil,Da=Math.floor,Ca=Math.min,Q=0,db={},eb=m,fb=m;function gb(a){Q++;s.monitorRunDependencies&&s.monitorRunDependencies(Q);a?(A(!db[a]),db[a]=1):s.P(\\\"warning: run dependency added without ID\\\")}s.addRunDependency=gb;function hb(a){Q--;s.monitorRunDependencies&&s.monitorRunDependencies(Q);a?(A(db[a]),delete db[a]):s.P(\\\"warning: run dependency removed without ID\\\");0==Q&&(eb!==m&&(clearInterval(eb),eb=m),fb&&(a=fb,fb=m,a()))}s.removeRunDependency=hb;s.preloadedImages={};\\n s.preloadedAudios={};Qa=8;B=Qa+1376;O.push({M:function(){ib()}});\\n L([109,95,108,111,111,107,117,112,91,116,93,32,61,61,32,99,85,73,78,84,51,50,95,77,65,88,0,0,0,0,0,0,116,32,60,32,40,49,85,32,60,60,32,116,97,98,108,101,95,98,105,116,115,41,0,0,112,67,111,100,101,115,105,122,101,115,91,115,121,109,95,105,110,100,101,120,93,32,61,61,32,99,111,100,101,115,105,122,101,0,0,0,0,0,0,0,115,111,114,116,101,100,95,112,111,115,32,60,32,116,111,116,97,108,95,117,115,101,100,95,115,121,109,115,0,0,0,0,110,117,109,95,99,111,100,101,115,91,99,93,0,0,0,0,110,101,119,95,99,97,112,\\n 97,99,105,116,121,32,38,38,32,40,110,101,119,95,99,97,112,97,99,105,116,121,32,62,32,109,95,99,97,112,97,99,105,116,121,41,0,0,0,0,0,40,108,101,110,32,62,61,32,49,41,32,38,38,32,40,108,101,110,32,60,61,32,99,77,97,120,69,120,112,101,99,116,101,100,67,111,100,101,83,105,122,101,41,0,0,0,0,0,110,101,120,116,95,108,101,118,101,108,95,111,102,115,32,62,32,99,117,114,95,108,101,118,101,108,95,111,102,115,0,0,110,117,109,32,38,38,32,40,110,117,109,32,61,61,32,126,110,117,109,95,99,104,101,99,107,41,0,0,\\n 0,0,0,0,105,32,60,32,109,95,115,105,122,101,0,0,0,0,0,0,109,105,110,95,110,101,119,95,99,97,112,97,99,105,116,121,32,60,32,40,48,120,55,70,70,70,48,48,48,48,85,32,47,32,101,108,101,109,101,110,116,95,115,105,122,101,41,0,109,111,100,101,108,46,109,95,99,111,100,101,95,115,105,122,101,115,91,115,121,109,93,32,61,61,32,108,101,110,0,0,116,32,33,61,32,99,85,73,78,84,51,50,95,77,65,88,0,0,0,0,0,0,0,0,109,95,98,105,116,95,99,111,117,110,116,32,60,61,32,99,66,105,116,66,117,102,83,105,122,101,0,0,0,0,0,\\n 0,48,0,0,0,0,0,0,0,46,46,47,105,110,99,47,99,114,110,95,100,101,99,111,109,112,46,104,0,0,0,0,0,40,116,111,116,97,108,95,115,121,109,115,32,62,61,32,49,41,32,38,38,32,40,116,111,116,97,108,95,115,121,109,115,32,60,61,32,112,114,101,102,105,120,95,99,111,100,105,110,103,58,58,99,77,97,120,83,117,112,112,111,114,116,101,100,83,121,109,115,41,0,0,0,102,97,108,115,101,0,0,0,99,114,110,100,95,102,114,101,101,58,32,98,97,100,32,112,116,114,0,0,0,0,0,0,99,114,110,100,95,114,101,97,108,108,111,99,58,32,98,\\n 97,100,32,112,116,114,0,0,0,40,40,117,105,110,116,51,50,41,112,95,110,101,119,32,38,32,40,67,82,78,68,95,77,73,78,95,65,76,76,79,67,95,65,76,73,71,78,77,69,78,84,32,45,32,49,41,41,32,61,61,32,48,0,0,0,99,114,110,100,95,109,97,108,108,111,99,58,32,111,117,116,32,111,102,32,109,101,109,111,114,121,0,0,0,0,0,0,99,114,110,100,95,109,97,108,108,111,99,58,32,115,105,122,101,32,116,111,111,32,98,105,103,0,0,0,0,0,0,0,109,95,115,105,122,101,32,60,61,32,109,95,99,97,112,97,99,105,116,121,0,0,0,0,37,115,40,\\n 37,117,41,58,32,65,115,115,101,114,116,105,111,110,32,102,97,105,108,117,114,101,58,32,34,37,115,34,10,0,0,0,0,0,0,0,0,17,18,19,20,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15,16,0,0,0,1,2,2,3,3,3,3,4,0,0,0,0,0,0,1,1,0,1,0,1,0,0,1,2,1,2,0,0,0,1,0,2,1,0,2,0,0,1,2,3,0,2,3,4,5,6,7,1,0,2,3,1,0,0,0,0],\\\"i8\\\",Ja,8);var jb=sa(L(12,\\\"i8\\\",Ia),8);A(0==jb%8);s._strlen=kb;function lb(a){return 0>a||0===a&&-Infinity===1/a}\\n function mb(a,b){function c(a){var c;\\\"double\\\"===a?c=Ga[b+f>>3]:\\\"i64\\\"==a?(c=[K[b+f>>2],K[b+(f+8)>>2]],f+=8):(a=\\\"i32\\\",c=K[b+f>>2]);f+=Math.max(Math.max(ja(a),ka),8);return c}for(var d=a,f=0,h=[],g,i;;){var r=d;g=I[d];if(0===g)break;i=I[d+1|0];if(37==g){var t=p,y=p,u=p,n=p,F=p;a:for(;;){switch(i){case 43:t=l;break;case 45:y=l;break;case 35:u=l;break;case 48:if(n)break a;else{n=l;break}case 32:F=l;break;default:break a}d++;i=I[d+1|0]}var G=0;if(42==i)G=c(\\\"i32\\\"),d++,i=I[d+1|0];else for(;48<=i&&57>=i;)G=\\n 10*G+(i-48),d++,i=I[d+1|0];var P=p;if(46==i){var C=0,P=l;d++;i=I[d+1|0];if(42==i)C=c(\\\"i32\\\"),d++;else for(;;){i=I[d+1|0];if(48>i||57<i)break;C=10*C+(i-48);d++}i=I[d+1|0]}else C=6;var z;switch(String.fromCharCode(i)){case \\\"h\\\":i=I[d+2|0];104==i?(d++,z=1):z=2;break;case \\\"l\\\":i=I[d+2|0];108==i?(d++,z=8):z=4;break;case \\\"L\\\":case \\\"q\\\":case \\\"j\\\":z=8;break;case \\\"z\\\":case \\\"t\\\":case \\\"I\\\":z=4;break;default:z=m}z&&d++;i=I[d+1|0];switch(String.fromCharCode(i)){case \\\"d\\\":case \\\"i\\\":case \\\"u\\\":case \\\"o\\\":case \\\"x\\\":case \\\"X\\\":case \\\"p\\\":r=\\n 100==i||105==i;z=z||4;g=c(\\\"i\\\"+8*z);var k;8==z&&(g=117==i?+(g[0]>>>0)+4294967296*+(g[1]>>>0):+(g[0]>>>0)+4294967296*+(g[1]|0));4>=z&&(g=(r?cb:bb)(g&Math.pow(256,z)-1,8*z));var T=Math.abs(g),r=\\\"\\\";if(100==i||105==i)k=cb(g,8*z).toString(10);else if(117==i)k=bb(g,8*z).toString(10),g=Math.abs(g);else if(111==i)k=(u?\\\"0\\\":\\\"\\\")+T.toString(8);else if(120==i||88==i){r=u&&0!=g?\\\"0x\\\":\\\"\\\";if(0>g){g=-g;k=(T-1).toString(16);T=[];for(u=0;u<k.length;u++)T.push((15-parseInt(k[u],16)).toString(16));for(k=T.join(\\\"\\\");k.length<\\n 2*z;)k=\\\"f\\\"+k}else k=T.toString(16);88==i&&(r=r.toUpperCase(),k=k.toUpperCase())}else 112==i&&(0===T?k=\\\"(nil)\\\":(r=\\\"0x\\\",k=T.toString(16)));if(P)for(;k.length<C;)k=\\\"0\\\"+k;0<=g&&(t?r=\\\"+\\\"+r:F&&(r=\\\" \\\"+r));\\\"-\\\"==k.charAt(0)&&(r=\\\"-\\\"+r,k=k.substr(1));for(;r.length+k.length<G;)y?k+=\\\" \\\":n?k=\\\"0\\\"+k:r=\\\" \\\"+r;k=r+k;k.split(\\\"\\\").forEach(function(a){h.push(a.charCodeAt(0))});break;case \\\"f\\\":case \\\"F\\\":case \\\"e\\\":case \\\"E\\\":case \\\"g\\\":case \\\"G\\\":g=c(\\\"double\\\");if(isNaN(g))k=\\\"nan\\\",n=p;else if(isFinite(g)){P=p;z=Math.min(C,20);if(103==\\n i||71==i)P=l,C=C||1,z=parseInt(g.toExponential(z).split(\\\"e\\\")[1],10),C>z&&-4<=z?(i=(103==i?\\\"f\\\":\\\"F\\\").charCodeAt(0),C-=z+1):(i=(103==i?\\\"e\\\":\\\"E\\\").charCodeAt(0),C--),z=Math.min(C,20);if(101==i||69==i)k=g.toExponential(z),/[eE][-+]\\\\d$/.test(k)&&(k=k.slice(0,-1)+\\\"0\\\"+k.slice(-1));else if(102==i||70==i)k=g.toFixed(z),0===g&&lb(g)&&(k=\\\"-\\\"+k);r=k.split(\\\"e\\\");if(P&&!u)for(;1<r[0].length&&-1!=r[0].indexOf(\\\".\\\")&&(\\\"0\\\"==r[0].slice(-1)||\\\".\\\"==r[0].slice(-1));)r[0]=r[0].slice(0,-1);else for(u&&-1==k.indexOf(\\\".\\\")&&(r[0]+=\\n \\\".\\\");C>z++;)r[0]+=\\\"0\\\";k=r[0]+(1<r.length?\\\"e\\\"+r[1]:\\\"\\\");69==i&&(k=k.toUpperCase());0<=g&&(t?k=\\\"+\\\"+k:F&&(k=\\\" \\\"+k))}else k=(0>g?\\\"-\\\":\\\"\\\")+\\\"inf\\\",n=p;for(;k.length<G;)k=y?k+\\\" \\\":n&&(\\\"-\\\"==k[0]||\\\"+\\\"==k[0])?k[0]+\\\"0\\\"+k.slice(1):(n?\\\"0\\\":\\\" \\\")+k;97>i&&(k=k.toUpperCase());k.split(\\\"\\\").forEach(function(a){h.push(a.charCodeAt(0))});break;case \\\"s\\\":n=(t=c(\\\"i8*\\\"))?kb(t):6;P&&(n=Math.min(n,C));if(!y)for(;n<G--;)h.push(32);if(t)for(u=0;u<n;u++)h.push(M[t++|0]);else h=h.concat(H(\\\"(null)\\\".substr(0,n),l));if(y)for(;n<G--;)h.push(32);\\n break;case \\\"c\\\":for(y&&h.push(c(\\\"i8\\\"));0<--G;)h.push(32);y||h.push(c(\\\"i8\\\"));break;case \\\"n\\\":y=c(\\\"i32*\\\");K[y>>2]=h.length;break;case \\\"%\\\":h.push(g);break;default:for(u=r;u<d+2;u++)h.push(I[u])}d+=2}else h.push(g),d+=1}return h}function nb(a,b,c,d){c=mb(c,d);d=b===j?c.length:Math.min(c.length,Math.max(b-1,0));if(0>a)var a=-a,f=Ka(d+1),a=K[a>>2]=f;for(f=0;f<d;f++)I[a+f|0]=c[f];if(d<b||b===j)I[a+f|0]=0;return c.length}\\n var R={W:1,qa:2,qd:3,nc:4,L:5,Ga:6,Kb:7,Kc:8,ba:9,Yb:10,V:11,Ad:11,lb:12,eb:13,ic:14,Wc:15,Wb:16,Da:17,Bd:18,Ea:19,Xc:20,oa:21,u:22,Fc:23,kb:24,ad:25,xd:26,jc:27,Sc:28,sa:29,nd:30,yc:31,fd:32,fc:33,kd:34,Oc:42,lc:43,Zb:44,pc:45,qc:46,rc:47,xc:48,yd:49,Ic:50,oc:51,dc:35,Lc:37,Pb:52,Sb:53,Cd:54,Gc:55,Tb:56,Ub:57,ec:35,Vb:59,Uc:60,Jc:61,ud:62,Tc:63,Pc:64,Qc:65,md:66,Mc:67,Nb:68,rd:69,$b:70,gd:71,Ac:72,gc:73,Rb:74,bd:76,Qb:77,ld:78,sc:79,tc:80,wc:81,vc:82,uc:83,Vc:38,Fa:39,Bc:36,pa:40,ra:95,ed:96,cc:104,\\n Hc:105,Ob:97,jd:91,Zc:88,Rc:92,od:108,bc:111,Lb:98,ac:103,Ec:101,Cc:100,vd:110,kc:112,hb:113,ib:115,fb:114,gb:89,zc:90,hd:93,pd:94,Mb:99,Dc:102,jb:106,ca:107,wd:109,zd:87,hc:122,sd:116,$c:95,Nc:123,mc:84,cd:75,Xb:125,Yc:131,dd:130,td:86},ob={\\\"0\\\":\\\"Success\\\",1:\\\"Not super-user\\\",2:\\\"No such file or directory\\\",3:\\\"No such process\\\",4:\\\"Interrupted system call\\\",5:\\\"I/O error\\\",6:\\\"No such device or address\\\",7:\\\"Arg list too long\\\",8:\\\"Exec format error\\\",9:\\\"Bad file number\\\",10:\\\"No children\\\",11:\\\"No more processes\\\",\\n 12:\\\"Not enough core\\\",13:\\\"Permission denied\\\",14:\\\"Bad address\\\",15:\\\"Block device required\\\",16:\\\"Mount device busy\\\",17:\\\"File exists\\\",18:\\\"Cross-device link\\\",19:\\\"No such device\\\",20:\\\"Not a directory\\\",21:\\\"Is a directory\\\",22:\\\"Invalid argument\\\",23:\\\"Too many open files in system\\\",24:\\\"Too many open files\\\",25:\\\"Not a typewriter\\\",26:\\\"Text file busy\\\",27:\\\"File too large\\\",28:\\\"No space left on device\\\",29:\\\"Illegal seek\\\",30:\\\"Read only file system\\\",31:\\\"Too many links\\\",32:\\\"Broken pipe\\\",33:\\\"Math arg out of domain of func\\\",\\n 34:\\\"Math result not representable\\\",35:\\\"File locking deadlock error\\\",36:\\\"File or path name too long\\\",37:\\\"No record locks available\\\",38:\\\"Function not implemented\\\",39:\\\"Directory not empty\\\",40:\\\"Too many symbolic links\\\",42:\\\"No message of desired type\\\",43:\\\"Identifier removed\\\",44:\\\"Channel number out of range\\\",45:\\\"Level 2 not synchronized\\\",46:\\\"Level 3 halted\\\",47:\\\"Level 3 reset\\\",48:\\\"Link number out of range\\\",49:\\\"Protocol driver not attached\\\",50:\\\"No CSI structure available\\\",51:\\\"Level 2 halted\\\",52:\\\"Invalid exchange\\\",\\n 53:\\\"Invalid request descriptor\\\",54:\\\"Exchange full\\\",55:\\\"No anode\\\",56:\\\"Invalid request code\\\",57:\\\"Invalid slot\\\",59:\\\"Bad font file fmt\\\",60:\\\"Device not a stream\\\",61:\\\"No data (for no delay io)\\\",62:\\\"Timer expired\\\",63:\\\"Out of streams resources\\\",64:\\\"Machine is not on the network\\\",65:\\\"Package not installed\\\",66:\\\"The object is remote\\\",67:\\\"The link has been severed\\\",68:\\\"Advertise error\\\",69:\\\"Srmount error\\\",70:\\\"Communication error on send\\\",71:\\\"Protocol error\\\",72:\\\"Multihop attempted\\\",73:\\\"Cross mount point (not really error)\\\",\\n 74:\\\"Trying to read unreadable message\\\",75:\\\"Value too large for defined data type\\\",76:\\\"Given log. name not unique\\\",77:\\\"f.d. invalid for this operation\\\",78:\\\"Remote address changed\\\",79:\\\"Can access a needed shared lib\\\",80:\\\"Accessing a corrupted shared lib\\\",81:\\\".lib section in a.out corrupted\\\",82:\\\"Attempting to link in too many libs\\\",83:\\\"Attempting to exec a shared library\\\",84:\\\"Illegal byte sequence\\\",86:\\\"Streams pipe error\\\",87:\\\"Too many users\\\",88:\\\"Socket operation on non-socket\\\",89:\\\"Destination address required\\\",\\n 90:\\\"Message too long\\\",91:\\\"Protocol wrong type for socket\\\",92:\\\"Protocol not available\\\",93:\\\"Unknown protocol\\\",94:\\\"Socket type not supported\\\",95:\\\"Not supported\\\",96:\\\"Protocol family not supported\\\",97:\\\"Address family not supported by protocol family\\\",98:\\\"Address already in use\\\",99:\\\"Address not available\\\",100:\\\"Network interface is not configured\\\",101:\\\"Network is unreachable\\\",102:\\\"Connection reset by network\\\",103:\\\"Connection aborted\\\",104:\\\"Connection reset by peer\\\",105:\\\"No buffer space available\\\",106:\\\"Socket is already connected\\\",\\n 107:\\\"Socket is not connected\\\",108:\\\"Can't send after socket shutdown\\\",109:\\\"Too many references\\\",110:\\\"Connection timed out\\\",111:\\\"Connection refused\\\",112:\\\"Host is down\\\",113:\\\"Host is unreachable\\\",114:\\\"Socket already connected\\\",115:\\\"Connection already in progress\\\",116:\\\"Stale file handle\\\",122:\\\"Quota exceeded\\\",123:\\\"No medium (in tape drive)\\\",125:\\\"Operation canceled\\\",130:\\\"Previous owner died\\\",131:\\\"State not recoverable\\\"},pb=0;function S(a){return K[pb>>2]=a}\\n function qb(a){return/^(\\\\/?|)([\\\\s\\\\S]*?)((?:\\\\.{1,2}|[^\\\\/]+?|)(\\\\.[^.\\\\/]*|))(?:[\\\\/]*)$/.exec(a).slice(1)}function rb(a,b){for(var c=0,d=a.length-1;0<=d;d--){var f=a[d];\\\".\\\"===f?a.splice(d,1):\\\"..\\\"===f?(a.splice(d,1),c++):c&&(a.splice(d,1),c--)}if(b)for(;c--;c)a.unshift(\\\"..\\\");return a}function sb(a){var b=\\\"/\\\"===a.charAt(0),c=\\\"/\\\"===a.substr(-1),a=rb(a.split(\\\"/\\\").filter(function(a){return!!a}),!b).join(\\\"/\\\");!a&&!b&&(a=\\\".\\\");a&&c&&(a+=\\\"/\\\");return(b?\\\"/\\\":\\\"\\\")+a}\\n function U(){var a=Array.prototype.slice.call(arguments,0);return sb(a.filter(function(a){\\\"string\\\"!==typeof a&&e(new TypeError(\\\"Arguments to path.join must be strings\\\"));return a}).join(\\\"/\\\"))}function tb(){for(var a=\\\"\\\",b=p,c=arguments.length-1;-1<=c&&!b;c--){var d=0<=c?arguments[c]:\\\"/\\\";\\\"string\\\"!==typeof d&&e(new TypeError(\\\"Arguments to path.resolve must be strings\\\"));d&&(a=d+\\\"/\\\"+a,b=\\\"/\\\"===d.charAt(0))}a=rb(a.split(\\\"/\\\").filter(function(a){return!!a}),!b).join(\\\"/\\\");return(b?\\\"/\\\":\\\"\\\")+a||\\\".\\\"}var ub=[];\\n function vb(a,b){ub[a]={input:[],O:[],Z:b};wb[a]={k:xb}}\\n var xb={open:function(a){var b=ub[a.g.ka];b||e(new V(R.Ea));a.B=b;a.seekable=p},close:function(a){a.B.O.length&&a.B.Z.ja(a.B,10)},K:function(a,b,c,d){(!a.B||!a.B.Z.Qa)&&e(new V(R.Ga));for(var f=0,h=0;h<d;h++){var g;try{g=a.B.Z.Qa(a.B)}catch(i){e(new V(R.L))}g===j&&0===f&&e(new V(R.V));if(g===m||g===j)break;f++;b[c+h]=g}f&&(a.g.timestamp=Date.now());return f},write:function(a,b,c,d){(!a.B||!a.B.Z.ja)&&e(new V(R.Ga));for(var f=0;f<d;f++)try{a.B.Z.ja(a.B,b[c+f])}catch(h){e(new V(R.L))}d&&(a.g.timestamp=\\n Date.now());return f}},W={cb:1,na:2,bb:3,D:function(){return W.createNode(m,\\\"/\\\",16895,0)},createNode:function(a,b,c,d){(24576===(c&61440)||4096===(c&61440))&&e(new V(R.W));c=yb(a,b,c,d);16384===(c.mode&61440)?(c.n={J:W.n.J,A:W.n.A,wa:W.n.wa,Q:W.n.Q,Q:W.n.Q,rename:W.n.rename,ab:W.n.ab,Za:W.n.Za,Xa:W.n.Xa,ma:W.n.ma},c.k={N:W.k.N},c.o={}):32768===(c.mode&61440)?(c.n={J:W.n.J,A:W.n.A},c.k={N:W.k.N,K:W.k.K,write:W.k.write,Ja:W.k.Ja,Ta:W.k.Ta},c.o=[],c.ea=W.na):40960===(c.mode&61440)?(c.n={J:W.n.J,A:W.n.A,\\n la:W.n.la},c.k={}):8192===(c.mode&61440)&&(c.n={J:W.n.J,A:W.n.A},c.k=zb);c.timestamp=Date.now();a&&(a.o[b]=c);return c},ua:function(a){a.ea!==W.na&&(a.o=Array.prototype.slice.call(a.o),a.ea=W.na)},n:{J:function(a){var b={};b.Qd=8192===(a.mode&61440)?a.id:1;b.Wd=a.id;b.mode=a.mode;b.ae=1;b.uid=0;b.Ud=0;b.ka=a.ka;b.size=16384===(a.mode&61440)?4096:32768===(a.mode&61440)?a.o.length:40960===(a.mode&61440)?a.link.length:0;b.Kd=new Date(a.timestamp);b.$d=new Date(a.timestamp);b.Pd=new Date(a.timestamp);\\n b.pb=4096;b.Md=Math.ceil(b.size/b.pb);return b},A:function(a,b){b.mode!==j&&(a.mode=b.mode);b.timestamp!==j&&(a.timestamp=b.timestamp);if(b.size!==j){W.ua(a);var c=a.o;if(b.size<c.length)c.length=b.size;else for(;b.size>c.length;)c.push(0)}},wa:function(){e(new V(R.qa))},Q:function(a,b,c,d){return W.createNode(a,b,c,d)},rename:function(a,b,c){if(16384===(a.mode&61440)){var d;try{d=Ab(b,c)}catch(f){}if(d)for(var h in d.o)e(new V(R.Fa))}delete a.parent.o[a.name];a.name=c;b.o[c]=a;a.parent=b},ab:function(a,\\n b){delete a.o[b]},Za:function(a,b){var c=Ab(a,b),d;for(d in c.o)e(new V(R.Fa));delete a.o[b]},Xa:function(a){var b=[\\\".\\\",\\\"..\\\"],c;for(c in a.o)a.o.hasOwnProperty(c)&&b.push(c);return b},ma:function(a,b,c){a=W.createNode(a,b,41471,0);a.link=c;return a},la:function(a){40960!==(a.mode&61440)&&e(new V(R.u));return a.link}},k:{K:function(a,b,c,d,f){a=a.g.o;if(f>=a.length)return 0;d=Math.min(a.length-f,d);A(0<=d);if(8<d&&a.subarray)b.set(a.subarray(f,f+d),c);else for(var h=0;h<d;h++)b[c+h]=a[f+h];return d},\\n write:function(a,b,c,d,f,h){var g=a.g;g.timestamp=Date.now();a=g.o;if(d&&0===a.length&&0===f&&b.subarray)return A(b.length),h&&b.buffer===I.buffer&&0===c?(g.o=b,g.ea=W.cb):(g.o=new Uint8Array(b.subarray(c,c+d)),g.ea=W.bb),d;W.ua(g);for(a=g.o;a.length<f;)a.push(0);for(h=0;h<d;h++)a[f+h]=b[c+h];return d},N:function(a,b,c){1===c?b+=a.position:2===c&&32768===(a.g.mode&61440)&&(b+=a.g.o.length);0>b&&e(new V(R.u));a.Hb=[];return a.position=b},Ja:function(a,b,c){W.ua(a.g);a=a.g.o;for(b+=c;b>a.length;)a.push(0)},\\n Ta:function(a,b,c,d,f,h,g){32768!==(a.g.mode&61440)&&e(new V(R.Ea));a=a.g.o;if(!(g&2)&&(a.buffer===b||a.buffer===b.buffer))f=p,d=a.byteOffset;else{if(0<f||f+d<a.length)a=a.subarray?a.subarray(f,f+d):Array.prototype.slice.call(a,f,f+d);f=l;(d=Ka(d))||e(new V(R.lb));b.set(a,d)}return{de:d,Jd:f}}}},Bb=L(1,\\\"i32*\\\",Ia),Cb=L(1,\\\"i32*\\\",Ia),Db=L(1,\\\"i32*\\\",Ia),Eb=m,Fb=[],wb=[m],X=[m],Gb=1,Hb=m,Ib=l,V=m;function Jb(a){a instanceof V||e(a+\\\" : \\\"+Ma());S(a.Na)}\\n function Y(a,b){a=tb(\\\"/\\\",a);b=b||{Aa:0};8<b.Aa&&e(new V(R.pa));for(var c=rb(a.split(\\\"/\\\").filter(function(a){return!!a}),p),d=Eb,f=\\\"/\\\",h=0;h<c.length;h++){var g=h===c.length-1;if(g&&b.parent)break;d=Ab(d,c[h]);f=U(f,c[h]);d.Ab&&(d=d.D.root);if(!g||b.X)for(g=0;40960===(d.mode&61440);){d=Y(f,{X:p}).g;d.n.la||e(new V(R.u));var d=d.n.la(d),i=tb;var r=qb(f),f=r[0],r=r[1];!f&&!r?f=\\\".\\\":(r&&(r=r.substr(0,r.length-1)),f+=r);f=i(f,d);d=Y(f,{Aa:b.Aa}).g;40<g++&&e(new V(R.pa))}}return{path:f,g:d}}\\n function Kb(a){for(var b;;){if(a===a.parent)return b?U(a.D.Ua,b):a.D.Ua;b=b?U(a.name,b):a.name;a=a.parent}}function Lb(a,b){for(var c=0,d=0;d<b.length;d++)c=(c<<5)-c+b.charCodeAt(d)|0;return(a+c>>>0)%Hb.length}function Ab(a,b){var c=Mb(a,\\\"x\\\");c&&e(new V(c));for(c=Hb[Lb(a.id,b)];c;c=c.Bb){var d=c.name;if(c.parent.id===a.id&&d===b)return c}return a.n.wa(a,b)}\\n function yb(a,b,c,d){var f={id:Gb++,name:b,mode:c,n:{},k:{},ka:d,parent:m,D:m};a||(a=f);f.parent=a;f.D=a.D;Object.defineProperties(f,{K:{get:function(){return 365===(f.mode&365)},set:function(a){a?f.mode|=365:f.mode&=-366}},write:{get:function(){return 146===(f.mode&146)},set:function(a){a?f.mode|=146:f.mode&=-147}},yb:{get:function(){return 16384===(f.mode&61440)}},xb:{get:function(){return 8192===(f.mode&61440)}}});a=Lb(f.parent.id,f.name);f.Bb=Hb[a];return Hb[a]=f}\\n var Nb={r:0,rs:1052672,\\\"r+\\\":2,w:577,wx:705,xw:705,\\\"w+\\\":578,\\\"wx+\\\":706,\\\"xw+\\\":706,a:1089,ax:1217,xa:1217,\\\"a+\\\":1090,\\\"ax+\\\":1218,\\\"xa+\\\":1218};function Ob(a){var b=Nb[a];\\\"undefined\\\"===typeof b&&e(Error(\\\"Unknown file open mode: \\\"+a));return b}function Mb(a,b){return Ib?0:-1!==b.indexOf(\\\"r\\\")&&!(a.mode&292)||-1!==b.indexOf(\\\"w\\\")&&!(a.mode&146)||-1!==b.indexOf(\\\"x\\\")&&!(a.mode&73)?R.eb:0}function Pb(a,b){try{return Ab(a,b),R.Da}catch(c){}return Mb(a,\\\"wx\\\")}\\n function Qb(a,b,c){var d;a:{b=b||1;for(c=c||4096;b<=c;b++)if(!X[b]){d=b;break a}e(new V(R.kb))}a.C=d;Object.defineProperties(a,{object:{get:function(){return a.g},set:function(b){a.g=b}},Yd:{get:function(){return 1!==(a.I&2097155)}},Zd:{get:function(){return 0!==(a.I&2097155)}},Xd:{get:function(){return a.I&1024}}});return X[d]=a}var zb={open:function(a){a.k=wb[a.g.ka].k;a.k.open&&a.k.open(a)},N:function(){e(new V(R.sa))}};\\n function Rb(a,b){var c;b&&(c=Y(b,{X:p}),b=c.path);var d={type:a,ce:{},Ua:b,root:m},f=a.D(d);f.D=d;d.root=f;c&&(c.g.D=d,c.g.Ab=l,\\\"/\\\"===b&&(Eb=d.root));Fb.push(d);return f}function Sb(a,b,c){var d=Y(a,{parent:l}).g,a=\\\"/\\\"===a?\\\"/\\\":qb(a)[2],f=Pb(d,a);f&&e(new V(f));d.n.Q||e(new V(R.W));return d.n.Q(d,a,b,c)}function Tb(a,b){b=(b!==j?b:438)&4095;b|=32768;return Sb(a,b,0)}function Ub(a,b){b=(b!==j?b:511)&1023;b|=16384;return Sb(a,b,0)}\\n function Vb(a,b,c){\\\"undefined\\\"===typeof c&&(c=b,b=438);return Sb(a,b|8192,c)}function Wb(a,b){var c=Y(b,{parent:l}).g,d=\\\"/\\\"===b?\\\"/\\\":qb(b)[2],f=Pb(c,d);f&&e(new V(f));c.n.ma||e(new V(R.W));return c.n.ma(c,d,a)}function Xb(a,b){var c;c=\\\"string\\\"===typeof a?Y(a,{X:l}).g:a;c.n.A||e(new V(R.W));c.n.A(c,{mode:b&4095|c.mode&-4096,timestamp:Date.now()})}\\n function Yb(a,b){var c,a=sb(a),b=\\\"string\\\"===typeof b?Ob(b):b;c=b&64?(\\\"undefined\\\"===typeof c?438:c)&4095|32768:0;var d;try{d=Y(a,{X:!(b&131072)}).g}catch(f){}b&64&&(d?b&128&&e(new V(R.Da)):d=Sb(a,c,0));d||e(new V(R.qa));8192===(d.mode&61440)&&(b&=-513);d?40960===(d.mode&61440)?c=R.pa:16384===(d.mode&61440)&&(0!==(b&2097155)||b&512)?c=R.oa:(c=[\\\"r\\\",\\\"w\\\",\\\"rw\\\"][b&2097155],b&512&&(c+=\\\"w\\\"),c=Mb(d,c)):c=R.qa;c&&e(new V(c));if(b&512){c=d;c=\\\"string\\\"===typeof c?Y(c,{X:l}).g:c;c.n.A||e(new V(R.W));16384===(c.mode&\\n 61440)&&e(new V(R.oa));32768!==(c.mode&61440)&&e(new V(R.u));var h=Mb(c,\\\"w\\\");h&&e(new V(h));c.n.A(c,{size:0,timestamp:Date.now()})}b&=-641;d=Qb({g:d,path:Kb(d),I:b,seekable:l,position:0,k:d.k,Hb:[],error:p},j,j);d.k.open&&d.k.open(d);s.logReadFiles&&!(b&1)&&(Zb||(Zb={}),a in Zb||(Zb[a]=1,s.printErr(\\\"read file: \\\"+a)));return d}function $b(a){try{a.k.close&&a.k.close(a)}catch(b){e(b)}finally{X[a.C]=m}}\\n function ac(a,b,c,d,f,h){(0>d||0>f)&&e(new V(R.u));0===(a.I&2097155)&&e(new V(R.ba));16384===(a.g.mode&61440)&&e(new V(R.oa));a.k.write||e(new V(R.u));var g=l;\\\"undefined\\\"===typeof f?(f=a.position,g=p):a.seekable||e(new V(R.sa));a.I&1024&&((!a.seekable||!a.k.N)&&e(new V(R.sa)),a.k.N(a,0,2));b=a.k.write(a,b,c,d,f,h);g||(a.position+=b);return b}function bc(){V||(V=function(a){this.Na=a;for(var b in R)if(R[b]===a){this.code=b;break}this.message=ob[a];this.stack=Ma()},V.prototype=Error())}var cc;\\n function dc(a,b){var c=0;a&&(c|=365);b&&(c|=146);return c}function ec(a,b,c,d,f,h){a=b?U(\\\"string\\\"===typeof a?a:Kb(a),b):a;d=dc(d,f);f=Tb(a,d);if(c){if(\\\"string\\\"===typeof c){for(var b=Array(c.length),g=0,i=c.length;g<i;++g)b[g]=c.charCodeAt(g);c=b}Xb(a,d|146);b=Yb(a,\\\"w\\\");ac(b,c,0,c.length,0,h);$b(b);Xb(a,d)}return f}\\n function fc(a,b,c,d){a=U(\\\"string\\\"===typeof a?a:Kb(a),b);b=dc(!!c,!!d);fc.Sa||(fc.Sa=64);var f;f=fc.Sa++<<8|0;wb[f]={k:{open:function(a){a.seekable=p},close:function(){d&&(d.buffer&&d.buffer.length)&&d(10)},K:function(a,b,d,f){for(var t=0,y=0;y<f;y++){var u;try{u=c()}catch(n){e(new V(R.L))}u===j&&0===t&&e(new V(R.V));if(u===m||u===j)break;t++;b[d+y]=u}t&&(a.g.timestamp=Date.now());return t},write:function(a,b,c,f){for(var t=0;t<f;t++)try{d(b[c+t])}catch(y){e(new V(R.L))}f&&(a.g.timestamp=Date.now());\\n return t}}};return Vb(a,b,f)}function gc(a){if(a.xb||a.yb||a.link||a.o)return l;var b=l;\\\"undefined\\\"!==typeof XMLHttpRequest&&e(Error(\\\"Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.\\\"));if(s.read)try{a.o=H(s.read(a.url),l)}catch(c){b=p}else e(Error(\\\"Cannot load without read() or XMLHttpRequest.\\\"));b||S(R.L);return b}\\n var Zb,Z={D:function(){return yb(m,\\\"/\\\",16895,0)},sb:function(a,b,c){c&&A(1==b==(6==c));a={tb:a,type:b,protocol:c,p:m,$:{},ya:[],R:[],T:Z.q};b=Z.ia();c=yb(Z.root,b,49152,0);c.S=a;b=Qb({path:b,g:c,I:Ob(\\\"r+\\\"),seekable:p,k:Z.k});a.$a=b;return a},ub:function(a){a=X[a];return!a||49152!==(a.g.mode&49152)?m:a.g.S},k:{Wa:function(a){a=a.g.S;return a.T.Wa(a)},Ra:function(a,b,c){a=a.g.S;return a.T.Ra(a,b,c)},K:function(a,b,c,d){a=a.g.S;d=a.T.Db(a,d);if(!d)return 0;b.set(d.buffer,c);return d.buffer.length},write:function(a,\\n b,c,d){a=a.g.S;return a.T.Fb(a,b,c,d)},close:function(a){a=a.g.S;a.T.close(a)}},ia:function(){Z.ia.Ma||(Z.ia.Ma=0);return\\\"socket[\\\"+Z.ia.Ma++ +\\\"]\\\"},q:{fa:function(a,b,c){var d;\\\"object\\\"===typeof b&&(d=b,c=b=m);if(d)d.Ha?(b=d.Ha.ee,c=d.Ha.fe):((c=/ws[s]?:\\\\/\\\\/([^:]+):(\\\\d+)/.exec(d.url))||e(Error(\\\"WebSocket URL must be in the format ws(s)://address:port\\\")),b=c[1],c=parseInt(c[2],10));else try{d=new WebSocket(\\\"ws://\\\"+b+\\\":\\\"+c,w?{}:[\\\"binary\\\"]),d.binaryType=\\\"arraybuffer\\\"}catch(f){e(new V(R.hb))}b={F:b,port:c,\\n e:d,ga:[]};Z.q.Ia(a,b);Z.q.wb(a,b);2===a.type&&\\\"undefined\\\"!==typeof a.U&&b.ga.push(new Uint8Array([255,255,255,255,112,111,114,116,(a.U&65280)>>8,a.U&255]));return b},ha:function(a,b,c){return a.$[b+\\\":\\\"+c]},Ia:function(a,b){a.$[b.F+\\\":\\\"+b.port]=b},Ya:function(a,b){delete a.$[b.F+\\\":\\\"+b.port]},wb:function(a,b){function c(c){A(\\\"string\\\"!==typeof c&&c.byteLength!==j);var c=new Uint8Array(c),d=f;f=p;d&&10===c.length&&255===c[0]&&255===c[1]&&255===c[2]&&255===c[3]&&112===c[4]&&111===c[5]&&114===c[6]&&116===\\n c[7]?(c=c[8]<<8|c[9],Z.q.Ya(a,b),b.port=c,Z.q.Ia(a,b)):a.R.push({F:b.F,port:b.port,data:c})}function d(){try{for(var a=b.ga.shift();a;)b.e.send(a),a=b.ga.shift()}catch(c){b.e.close()}}var f=l;w?(b.e.Y(\\\"open\\\",d),b.e.Y(\\\"message\\\",function(a,b){b.Ld&&c((new Uint8Array(a)).buffer)}),b.e.Y(\\\"error\\\",q())):(b.e.onopen=d,b.e.onmessage=function(a){c(a.data)})},Wa:function(a){if(1===a.type&&a.p)return a.ya.length?65:0;var b=0,c=1===a.type?Z.q.ha(a,a.G,a.H):m;if(a.R.length||!c||c&&c.e.readyState===c.e.aa||c&&\\n c.e.readyState===c.e.CLOSED)b|=65;if(!c||c&&c.e.readyState===c.e.OPEN)b|=4;if(c&&c.e.readyState===c.e.aa||c&&c.e.readyState===c.e.CLOSED)b|=16;return b},Ra:function(a,b,c){switch(b){case 21531:return b=0,a.R.length&&(b=a.R[0].data.length),K[c>>2]=b,0;default:return R.u}},close:function(a){if(a.p){try{a.p.close()}catch(b){}a.p=m}for(var c=Object.keys(a.$),d=0;d<c.length;d++){var f=a.$[c[d]];try{f.e.close()}catch(h){}Z.q.Ya(a,f)}return 0},bind:function(a,b,c){(\\\"undefined\\\"!==typeof a.Ca||\\\"undefined\\\"!==\\n typeof a.U)&&e(new V(R.u));a.Ca=b;a.U=c||_mkport();if(2===a.type){a.p&&(a.p.close(),a.p=m);try{a.T.zb(a,0)}catch(d){d instanceof V||e(d),d.Na!==R.ra&&e(d)}}},Od:function(a,b,c){a.p&&e(new V(ERRNO_CODS.ra));if(\\\"undefined\\\"!==typeof a.G&&\\\"undefined\\\"!==typeof a.H){var d=Z.q.ha(a,a.G,a.H);d&&(d.e.readyState===d.e.CONNECTING&&e(new V(R.fb)),e(new V(R.jb)))}b=Z.q.fa(a,b,c);a.G=b.F;a.H=b.port;e(new V(R.ib))},zb:function(a){w||e(new V(R.ra));a.p&&e(new V(R.u));var b=require(\\\"ws\\\").Dd;a.p=new b({host:a.Ca,port:a.U});\\n a.p.Y(\\\"connection\\\",function(b){if(1===a.type){var d=Z.sb(a.tb,a.type,a.protocol),b=Z.q.fa(d,b);d.G=b.F;d.H=b.port;a.ya.push(d)}else Z.q.fa(a,b)});a.p.Y(\\\"closed\\\",function(){a.p=m});a.p.Y(\\\"error\\\",q())},accept:function(a){a.p||e(new V(R.u));var b=a.ya.shift();b.$a.I=a.$a.I;return b},Td:function(a,b){var c,d;b?((a.G===j||a.H===j)&&e(new V(R.ca)),c=a.G,d=a.H):(c=a.Ca||0,d=a.U||0);return{F:c,port:d}},Fb:function(a,b,c,d,f,h){if(2===a.type){if(f===j||h===j)f=a.G,h=a.H;(f===j||h===j)&&e(new V(R.gb))}else f=\\n a.G,h=a.H;var g=Z.q.ha(a,f,h);1===a.type&&((!g||g.e.readyState===g.e.aa||g.e.readyState===g.e.CLOSED)&&e(new V(R.ca)),g.e.readyState===g.e.CONNECTING&&e(new V(R.V)));b=b instanceof Array||b instanceof ArrayBuffer?b.slice(c,c+d):b.buffer.slice(b.byteOffset+c,b.byteOffset+c+d);if(2===a.type&&(!g||g.e.readyState!==g.e.OPEN)){if(!g||g.e.readyState===g.e.aa||g.e.readyState===g.e.CLOSED)g=Z.q.fa(a,f,h);g.ga.push(b);return d}try{return g.e.send(b),d}catch(i){e(new V(R.u))}},Db:function(a,b){1===a.type&&\\n a.p&&e(new V(R.ca));var c=a.R.shift();if(!c){if(1===a.type){var d=Z.q.ha(a,a.G,a.H);if(d){if(d.e.readyState===d.e.aa||d.e.readyState===d.e.CLOSED)return m;e(new V(R.V))}e(new V(R.ca))}e(new V(R.V))}var d=c.data.byteLength||c.data.length,f=c.data.byteOffset||0,h=c.data.buffer||c.data,g=Math.min(b,d),i={buffer:new Uint8Array(h,f,g),F:c.F,port:c.port};1===a.type&&g<d&&(c.data=new Uint8Array(h,f+g,d-g),a.R.unshift(c));return i}}};\\n function hc(a,b,c){a=X[a];if(!a)return S(R.ba),-1;try{return ac(a,I,b,c)}catch(d){return Jb(d),-1}}function ic(a,b,c,d){c*=b;if(0==c)return 0;a=hc(d,a,c);if(-1==a){if(b=X[d])b.error=l;return 0}return Math.floor(a/b)}function jc(a,b,c){c=mb(b,c);b=ha();a=ic(L(c,\\\"i8\\\",Ha),1,c.length,a);ia(b);return a}s._memset=kc;s._memcpy=lc;function mc(a){s.print(\\\"exit(\\\"+a+\\\") called\\\");s.exit(a)}\\n function nc(a){nc.qb||(D=D+4095&-4096,nc.qb=l,A(qa),nc.ob=qa,qa=function(){E(\\\"cannot dynamically allocate, sbrk now has control\\\")});var b=D;0!=a&&nc.ob(a);return b}var oc=p,pc=p,qc=p,rc=p,sc=j,tc=j;function uc(a){return{jpg:\\\"image/jpeg\\\",jpeg:\\\"image/jpeg\\\",png:\\\"image/png\\\",bmp:\\\"image/bmp\\\",ogg:\\\"audio/ogg\\\",wav:\\\"audio/wav\\\",mp3:\\\"audio/mpeg\\\"}[a.substr(a.lastIndexOf(\\\".\\\")+1)]}var vc=[];function wc(){var a=s.canvas;vc.forEach(function(b){b(a.width,a.height)})}\\n function xc(){var a=s.canvas;this.Jb=a.width;this.Ib=a.height;a.width=screen.width;a.height=screen.height;\\\"undefined\\\"!=typeof SDL&&(a=Oa[SDL.screen+0*ka>>2],K[SDL.screen+0*ka>>2]=a|8388608);wc()}function yc(){var a=s.canvas;a.width=this.Jb;a.height=this.Ib;\\\"undefined\\\"!=typeof SDL&&(a=Oa[SDL.screen+0*ka>>2],K[SDL.screen+0*ka>>2]=a&-8388609);wc()}var zc,Ac,Bc,Cc;bc();Hb=Array(4096);Eb=yb(m,\\\"/\\\",16895,0);Rb(W,\\\"/\\\");Ub(\\\"/tmp\\\");Ub(\\\"/dev\\\");wb[259]={k:{K:function(){return 0},write:function(){return 0}}};\\n Vb(\\\"/dev/null\\\",259);vb(1280,{Qa:function(a){if(!a.input.length){var b=m;if(w){if(b=process.stdin.read(),!b){if(process.stdin._readableState&&process.stdin._readableState.ended)return m;return}}else\\\"undefined\\\"!=typeof window&&\\\"function\\\"==typeof window.prompt?(b=window.prompt(\\\"Input: \\\"),b!==m&&(b+=\\\"\\\\n\\\")):\\\"function\\\"==typeof readline&&(b=readline(),b!==m&&(b+=\\\"\\\\n\\\"));if(!b)return m;a.input=H(b,l)}return a.input.shift()},ja:function(a,b){b===m||10===b?(s.print(a.O.join(\\\"\\\")),a.O=[]):a.O.push(Dc.za(b))}});\\n vb(1536,{ja:function(a,b){b===m||10===b?(s.printErr(a.O.join(\\\"\\\")),a.O=[]):a.O.push(Dc.za(b))}});Vb(\\\"/dev/tty\\\",1280);Vb(\\\"/dev/tty1\\\",1536);Ub(\\\"/dev/shm\\\");Ub(\\\"/dev/shm/tmp\\\");\\n O.unshift({M:function(){if(!s.noFSInit&&!cc){A(!cc,\\\"FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)\\\");cc=l;bc();s.stdin=s.stdin;s.stdout=s.stdout;s.stderr=s.stderr;s.stdin?fc(\\\"/dev\\\",\\\"stdin\\\",s.stdin):Wb(\\\"/dev/tty\\\",\\\"/dev/stdin\\\");s.stdout?fc(\\\"/dev\\\",\\\"stdout\\\",m,s.stdout):Wb(\\\"/dev/tty\\\",\\\"/dev/stdout\\\");s.stderr?fc(\\\"/dev\\\",\\\"stderr\\\",m,s.stderr):Wb(\\\"/dev/tty1\\\",\\\"/dev/stderr\\\");var a=Yb(\\\"/dev/stdin\\\",\\n \\\"r\\\");K[Bb>>2]=a.C;A(1===a.C,\\\"invalid handle for stdin (\\\"+a.C+\\\")\\\");a=Yb(\\\"/dev/stdout\\\",\\\"w\\\");K[Cb>>2]=a.C;A(2===a.C,\\\"invalid handle for stdout (\\\"+a.C+\\\")\\\");a=Yb(\\\"/dev/stderr\\\",\\\"w\\\");K[Db>>2]=a.C;A(3===a.C,\\\"invalid handle for stderr (\\\"+a.C+\\\")\\\")}}});Wa.push({M:function(){Ib=p}});Xa.push({M:function(){cc=p;for(var a=0;a<X.length;a++){var b=X[a];b&&$b(b)}}});s.FS_createFolder=function(a,b,c,d){a=U(\\\"string\\\"===typeof a?a:Kb(a),b);return Ub(a,dc(c,d))};\\n s.FS_createPath=function(a,b){for(var a=\\\"string\\\"===typeof a?a:Kb(a),c=b.split(\\\"/\\\").reverse();c.length;){var d=c.pop();if(d){var f=U(a,d);try{Ub(f)}catch(h){}a=f}}return f};s.FS_createDataFile=ec;\\n s.FS_createPreloadedFile=function(a,b,c,d,f,h,g,i,r){function t(){qc=document.pointerLockElement===n||document.mozPointerLockElement===n||document.webkitPointerLockElement===n}function y(c){function k(c){i||ec(a,b,c,d,f,r);h&&h();hb(\\\"cp \\\"+F)}var n=p;s.preloadPlugins.forEach(function(a){!n&&a.canHandle(F)&&(a.handle(c,F,k,function(){g&&g();hb(\\\"cp \\\"+F)}),n=l)});n||k(c)}s.preloadPlugins||(s.preloadPlugins=[]);if(!zc&&!ca){zc=l;try{new Blob,Ac=l}catch(u){Ac=p,console.log(\\\"warning: no blob constructor, cannot create blobs with mimetypes\\\")}Bc=\\n \\\"undefined\\\"!=typeof MozBlobBuilder?MozBlobBuilder:\\\"undefined\\\"!=typeof WebKitBlobBuilder?WebKitBlobBuilder:!Ac?console.log(\\\"warning: no BlobBuilder\\\"):m;Cc=\\\"undefined\\\"!=typeof window?window.URL?window.URL:window.webkitURL:j;!s.Va&&\\\"undefined\\\"===typeof Cc&&(console.log(\\\"warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.\\\"),s.Va=l);s.preloadPlugins.push({canHandle:function(a){return!s.Va&&/\\\\.(jpg|jpeg|png|bmp)$/i.test(a)},handle:function(a,b,\\n c,d){var f=m;if(Ac)try{f=new Blob([a],{type:uc(b)}),f.size!==a.length&&(f=new Blob([(new Uint8Array(a)).buffer],{type:uc(b)}))}catch(g){var h=\\\"Blob constructor present but fails: \\\"+g+\\\"; falling back to blob builder\\\";ma||(ma={});ma[h]||(ma[h]=1,s.P(h))}f||(f=new Bc,f.append((new Uint8Array(a)).buffer),f=f.getBlob());var i=Cc.createObjectURL(f),n=new Image;n.onload=function(){A(n.complete,\\\"Image \\\"+b+\\\" could not be decoded\\\");var d=document.createElement(\\\"canvas\\\");d.width=n.width;d.height=n.height;d.getContext(\\\"2d\\\").drawImage(n,\\n 0,0);s.preloadedImages[b]=d;Cc.revokeObjectURL(i);c&&c(a)};n.onerror=function(){console.log(\\\"Image \\\"+i+\\\" could not be decoded\\\");d&&d()};n.src=i}});s.preloadPlugins.push({canHandle:function(a){return!s.be&&a.substr(-4)in{\\\".ogg\\\":1,\\\".wav\\\":1,\\\".mp3\\\":1}},handle:function(a,b,c,d){function f(d){h||(h=l,s.preloadedAudios[b]=d,c&&c(a))}function g(){h||(h=l,s.preloadedAudios[b]=new Audio,d&&d())}var h=p;if(Ac){try{var i=new Blob([a],{type:uc(b)})}catch(n){return g()}var i=Cc.createObjectURL(i),t=new Audio;t.addEventListener(\\\"canplaythrough\\\",\\n function(){f(t)},p);t.onerror=function(){if(!h){console.log(\\\"warning: browser could not fully decode audio \\\"+b+\\\", trying slower base64 approach\\\");for(var c=\\\"\\\",d=0,g=0,i=0;i<a.length;i++){d=d<<8|a[i];for(g+=8;6<=g;)var n=d>>g-6&63,g=g-6,c=c+\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\"[n]}2==g?(c+=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\"[(d&3)<<4],c+=\\\"==\\\"):4==g&&(c+=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\\\"[(d&15)<<2],c+=\\\"=\\\");\\n t.src=\\\"data:audio/x-\\\"+b.substr(-3)+\\\";base64,\\\"+c;f(t)}};t.src=i;setTimeout(function(){ua||f(t)},1E4)}else return g()}});var n=s.canvas;n.Ba=n.requestPointerLock||n.mozRequestPointerLock||n.webkitRequestPointerLock;n.Oa=document.exitPointerLock||document.mozExitPointerLock||document.webkitExitPointerLock||q();n.Oa=n.Oa.bind(document);document.addEventListener(\\\"pointerlockchange\\\",t,p);document.addEventListener(\\\"mozpointerlockchange\\\",t,p);document.addEventListener(\\\"webkitpointerlockchange\\\",t,p);s.elementPointerLock&&\\n n.addEventListener(\\\"click\\\",function(a){!qc&&n.Ba&&(n.Ba(),a.preventDefault())},p)}var F=b?tb(U(a,b)):a;gb(\\\"cp \\\"+F);if(\\\"string\\\"==typeof c){var G=g,P=function(){G?G():e('Loading data file \\\"'+c+'\\\" failed.')},C=new XMLHttpRequest;C.open(\\\"GET\\\",c,l);C.responseType=\\\"arraybuffer\\\";C.onload=function(){if(200==C.status||0==C.status&&C.response){var a=C.response;A(a,'Loading data file \\\"'+c+'\\\" failed (no arrayBuffer).');a=new Uint8Array(a);y(a);hb(\\\"al \\\"+c)}else P()};C.onerror=P;C.send(m);gb(\\\"al \\\"+c)}else y(c)};\\n s.FS_createLazyFile=function(a,b,c,d,f){var h,g;\\\"undefined\\\"!==typeof XMLHttpRequest?(ca||e(\\\"Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc\\\"),h=function(){this.va=p;this.da=[]},h.prototype.get=function(a){if(!(a>this.length-1||0>a)){var b=a%this.rb;return this.vb(Math.floor(a/this.rb))[b]}},h.prototype.Gb=function(a){this.vb=a},h.prototype.Ka=function(){var a=new XMLHttpRequest;a.open(\\\"HEAD\\\",c,p);a.send(m);200<=a.status&&300>a.status||\\n 304===a.status||e(Error(\\\"Couldn't load \\\"+c+\\\". Status: \\\"+a.status));var b=Number(a.getResponseHeader(\\\"Content-length\\\")),d,f=1048576;if(!((d=a.getResponseHeader(\\\"Accept-Ranges\\\"))&&\\\"bytes\\\"===d))f=b;var g=this;g.Gb(function(a){var d=a*f,h=(a+1)*f-1,h=Math.min(h,b-1);if(\\\"undefined\\\"===typeof g.da[a]){var i=g.da;d>h&&e(Error(\\\"invalid range (\\\"+d+\\\", \\\"+h+\\\") or no bytes requested!\\\"));h>b-1&&e(Error(\\\"only \\\"+b+\\\" bytes available! programmer error!\\\"));var k=new XMLHttpRequest;k.open(\\\"GET\\\",c,p);b!==f&&k.setRequestHeader(\\\"Range\\\",\\n \\\"bytes=\\\"+d+\\\"-\\\"+h);\\\"undefined\\\"!=typeof Uint8Array&&(k.responseType=\\\"arraybuffer\\\");k.overrideMimeType&&k.overrideMimeType(\\\"text/plain; charset=x-user-defined\\\");k.send(m);200<=k.status&&300>k.status||304===k.status||e(Error(\\\"Couldn't load \\\"+c+\\\". Status: \\\"+k.status));d=k.response!==j?new Uint8Array(k.response||[]):H(k.responseText||\\\"\\\",l);i[a]=d}\\\"undefined\\\"===typeof g.da[a]&&e(Error(\\\"doXHR failed!\\\"));return g.da[a]});this.nb=b;this.mb=f;this.va=l},h=new h,Object.defineProperty(h,\\\"length\\\",{get:function(){this.va||\\n this.Ka();return this.nb}}),Object.defineProperty(h,\\\"chunkSize\\\",{get:function(){this.va||this.Ka();return this.mb}}),g=j):(g=c,h=j);var i,a=U(\\\"string\\\"===typeof a?a:Kb(a),b);i=Tb(a,dc(d,f));h?i.o=h:g&&(i.o=m,i.url=g);var r={};Object.keys(i.k).forEach(function(a){var b=i.k[a];r[a]=function(){gc(i)||e(new V(R.L));return b.apply(m,arguments)}});r.K=function(a,b,c,d,f){gc(i)||e(new V(R.L));a=a.g.o;if(f>=a.length)return 0;d=Math.min(a.length-f,d);A(0<=d);if(a.slice)for(var g=0;g<d;g++)b[c+g]=a[f+g];else for(g=\\n 0;g<d;g++)b[c+g]=a.get(f+g);return d};i.k=r;return i};s.FS_createLink=function(a,b,c){a=U(\\\"string\\\"===typeof a?a:Kb(a),b);return Wb(c,a)};s.FS_createDevice=fc;pb=pa(4);K[pb>>2]=0;O.unshift({M:q()});Xa.push({M:q()});var Dc=new na;w&&(require(\\\"fs\\\"),process.platform.match(/^win/));O.push({M:function(){Z.root=Rb(Z,m)}});\\n s.requestFullScreen=function(a,b){function c(){pc=p;(document.webkitFullScreenElement||document.webkitFullscreenElement||document.mozFullScreenElement||document.mozFullscreenElement||document.fullScreenElement||document.fullscreenElement)===d?(d.La=document.cancelFullScreen||document.mozCancelFullScreen||document.webkitCancelFullScreen,d.La=d.La.bind(document),sc&&d.Ba(),pc=l,tc&&xc()):tc&&yc();if(s.onFullScreen)s.onFullScreen(pc)}sc=a;tc=b;\\\"undefined\\\"===typeof sc&&(sc=l);\\\"undefined\\\"===typeof tc&&\\n (tc=p);var d=s.canvas;rc||(rc=l,document.addEventListener(\\\"fullscreenchange\\\",c,p),document.addEventListener(\\\"mozfullscreenchange\\\",c,p),document.addEventListener(\\\"webkitfullscreenchange\\\",c,p));d.Eb=d.requestFullScreen||d.mozRequestFullScreen||(d.webkitRequestFullScreen?function(){d.webkitRequestFullScreen(Element.ALLOW_KEYBOARD_INPUT)}:m);d.Eb()};\\n s.requestAnimationFrame=function(a){window.requestAnimationFrame||(window.requestAnimationFrame=window.requestAnimationFrame||window.mozRequestAnimationFrame||window.webkitRequestAnimationFrame||window.msRequestAnimationFrame||window.oRequestAnimationFrame||window.setTimeout);window.requestAnimationFrame(a)};s.setCanvasSize=function(a,b,c){var d=s.canvas;d.width=a;d.height=b;c||wc()};s.pauseMainLoop=q();s.resumeMainLoop=function(){oc&&(oc=p,m())};\\n s.getUserMedia=function(){window.Pa||(window.Pa=navigator.getUserMedia||navigator.mozGetUserMedia);window.Pa(j)};Ra=x=sa(B);Sa=Ra+5242880;Ta=D=sa(Sa);A(Ta<ra);Ca=Math.min;\\n var $=(function(global,env,buffer) {\\n // EMSCRIPTEN_START_ASM\\n \\\"use asm\\\";var a=new global.Int8Array(buffer);var b=new global.Int16Array(buffer);var c=new global.Int32Array(buffer);var d=new global.Uint8Array(buffer);var e=new global.Uint16Array(buffer);var f=new global.Uint32Array(buffer);var g=new global.Float32Array(buffer);var h=new global.Float64Array(buffer);var i=env.STACKTOP|0;var j=env.STACK_MAX|0;var k=env.tempDoublePtr|0;var l=env.ABORT|0;var m=+env.NaN;var n=+env.Infinity;var o=0;var p=0;var q=0;var r=0;var s=0,t=0,u=0,v=0,w=0.0,x=0,y=0,z=0,A=0.0;var B=0;var C=0;var D=0;var E=0;var F=0;var G=0;var H=0;var I=0;var J=0;var K=0;var L=global.Math.floor;var M=global.Math.abs;var N=global.Math.sqrt;var O=global.Math.pow;var P=global.Math.cos;var Q=global.Math.sin;var R=global.Math.tan;var S=global.Math.acos;var T=global.Math.asin;var U=global.Math.atan;var V=global.Math.atan2;var W=global.Math.exp;var X=global.Math.log;var Y=global.Math.ceil;var Z=global.Math.imul;var _=env.abort;var $=env.assert;var aa=env.asmPrintInt;var ab=env.asmPrintFloat;var ac=env.min;var ad=env.invoke_ii;var ae=env.invoke_v;var af=env.invoke_iii;var ag=env.invoke_vi;var ah=env._llvm_lifetime_end;var ai=env._snprintf;var aj=env._abort;var ak=env._fprintf;var al=env._printf;var am=env._fflush;var an=env.__reallyNegative;var ao=env._sysconf;var ap=env.___setErrNo;var aq=env._fwrite;var ar=env._send;var as=env._write;var at=env._exit;var au=env._sprintf;var av=env.__formatString;var aw=env.__ZSt9terminatev;var ax=env._pwrite;var ay=env._sbrk;var az=env.___errno_location;var aA=env.___gxx_personality_v0;var aB=env._llvm_lifetime_start;var aC=env._time;var aD=env.__exit;\\n // EMSCRIPTEN_START_FUNCS\\n function aI(a){a=a|0;var b=0;b=i;i=i+a|0;i=i+7&-8;return b|0}function aJ(){return i|0}function aK(a){a=a|0;i=a}function aL(a,b){a=a|0;b=b|0;if((o|0)==0){o=a;p=b}}function aM(b){b=b|0;a[k]=a[b];a[k+1|0]=a[b+1|0];a[k+2|0]=a[b+2|0];a[k+3|0]=a[b+3|0]}function aN(b){b=b|0;a[k]=a[b];a[k+1|0]=a[b+1|0];a[k+2|0]=a[b+2|0];a[k+3|0]=a[b+3|0];a[k+4|0]=a[b+4|0];a[k+5|0]=a[b+5|0];a[k+6|0]=a[b+6|0];a[k+7|0]=a[b+7|0]}function aO(a){a=a|0;B=a}function aP(a){a=a|0;C=a}function aQ(a){a=a|0;D=a}function aR(a){a=a|0;E=a}function aS(a){a=a|0;F=a}function aT(a){a=a|0;G=a}function aU(a){a=a|0;H=a}function aV(a){a=a|0;I=a}function aW(a){a=a|0;J=a}function aX(a){a=a|0;K=a}function aY(){}function aZ(a,b,d,e){a=a|0;b=b|0;d=d|0;e=e|0;var f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0;f=i;i=i+1032|0;g=f|0;h=f+512|0;j=f+520|0;k=a+8|0;if((c[a+4>>2]|0)>>>0>(c[k>>2]|0)>>>0){l=j|0;au(l|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2121,c[m+16>>2]=744,m)|0)|0;i=m;al(l|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}if((2147418112/(e>>>0)|0)>>>0<=b>>>0){l=j|0;au(l|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2122,c[m+16>>2]=328,m)|0)|0;i=m;al(l|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}l=c[k>>2]|0;if(l>>>0>=b>>>0){n=1;i=f;return n|0}do{if(d){o=b-1|0;if((b|0)!=0){if((o&b|0)==0){p=b;break}}q=o>>>16|o;o=q>>>8|q;q=o>>>4|o;o=q>>>2|q;p=(o>>>1|o)+1|0}else{p=b}}while(0);if(!((p|0)!=0&p>>>0>l>>>0)){l=j|0;au(l|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2131,c[m+16>>2]=152,m)|0)|0;i=m;al(l|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}l=Z(p,e)|0;j=a|0;a=c[j>>2]|0;if((a&7|0)!=0){b=g|0;au(b|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2500,c[m+16>>2]=600,m)|0)|0;i=m;al(b|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m;n=0;i=f;return n|0}if(l>>>0>2147418112){b=g|0;au(b|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2500,c[m+16>>2]=712,m)|0)|0;i=m;al(b|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m;n=0;i=f;return n|0}c[h>>2]=l;b=a$(a,l,h,1)|0;a=c[h>>2]|0;if((b&7|0)!=0){h=g|0;au(h|0,768,(m=i,i=i+24|0,c[m>>2]=472,c[m+8>>2]=2552,c[m+16>>2]=624,m)|0)|0;i=m;al(h|0,(m=i,i=i+1|0,i=i+7&-8,c[m>>2]=0,m)|0)|0;i=m}if((b|0)==0){n=0;i=f;return n|0}c[j>>2]=b;if(a>>>0>l>>>0){r=(a>>>0)/(e>>>0)|0}else{r=p}c[k>>2]=r;n=1;i=f;return n|0}function a_(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,j=0,k=0;b=i;i=i+512|0;d=b|0;e=a+3&-4;a=(e|0)==0?4:e;if(a>>>0>2147418112){e=d|0;au(e|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2500,c[f+16>>2]=712,f)|0)|0;i=f;al(e|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;g=0;i=b;return g|0}e=be(a)|0;do{if((e|0)!=0){h=c[e-4>>2]|0;j=h&3;if((j|0)==1){k=0}else{k=(h&-8)-((j|0)==0?8:4)|0}if(k>>>0<a>>>0){break}if((e&7|0)==0){g=e;i=b;return g|0}j=d|0;au(j|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2527,c[f+16>>2]=624,f)|0)|0;i=f;al(j|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;g=e;i=b;return g|0}}while(0);e=d|0;au(e|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2500,c[f+16>>2]=680,f)|0)|0;i=f;al(e|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;g=0;i=b;return g|0}function a$(a,b,d,e){a=a|0;b=b|0;d=d|0;e=e|0;var f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0;if((a|0)==0){f=be(b)|0;if((d|0)==0){g=f;return g|0}do{if((f|0)==0){h=0}else{i=c[f-4>>2]|0;j=i&3;if((j|0)==1){h=0;break}h=(i&-8)-((j|0)==0?8:4)|0}}while(0);c[d>>2]=h;g=f;return g|0}if((b|0)==0){bf(a);if((d|0)==0){g=0;return g|0}c[d>>2]=0;g=0;return g|0}f=bg(a,b)|0;h=(f|0)!=0;if(h|e^1){k=h?f:a;l=f}else{f=bg(a,b)|0;k=(f|0)==0?a:f;l=f}if((d|0)==0){g=l;return g|0}do{if((k|0)==0){m=0}else{f=c[k-4>>2]|0;a=f&3;if((a|0)==1){m=0;break}m=(f&-8)-((a|0)==0?8:4)|0}}while(0);c[d>>2]=m;g=l;return g|0}function a0(b,e,f){b=b|0;e=e|0;f=f|0;var g=0,h=0;if((b|0)==0|e>>>0<74|(f|0)==0){return}if((c[f>>2]|0)!=40){return}if(((d[b]|0)<<8|(d[b+1|0]|0)|0)!=18552){return}if(((d[b+2|0]|0)<<8|(d[b+3|0]|0))>>>0<74){return}g=((d[b+7|0]|0)<<16|(d[b+6|0]|0)<<24|(d[b+8|0]|0)<<8|(d[b+9|0]|0))>>>0>e>>>0?0:b;if((g|0)==0){return}c[f+4>>2]=(d[g+12|0]|0)<<8|(d[g+13|0]|0);c[f+8>>2]=(d[g+14|0]|0)<<8|(d[g+15|0]|0);c[f+12>>2]=d[g+16|0]|0;c[f+16>>2]=d[g+17|0]|0;b=g+18|0;e=f+32|0;c[e>>2]=d[b]|0;c[e+4>>2]=0;e=a[b]|0;if(e<<24>>24==0){h=8}else{h=e<<24>>24==9?8:16}c[f+20>>2]=h;c[f+24>>2]=(d[g+26|0]|0)<<16|(d[g+25|0]|0)<<24|(d[g+27|0]|0)<<8|(d[g+28|0]|0);c[f+28>>2]=(d[g+30|0]|0)<<16|(d[g+29|0]|0)<<24|(d[g+31|0]|0)<<8|(d[g+32|0]|0);return}function a1(b){b=b|0;var d=0,e=0,f=0,g=0,h=0;d=i;i=i+512|0;e=c[b+20>>2]|0;if((e|0)!=0){a2(e)}e=b+4|0;f=c[e>>2]|0;if((f|0)==0){g=b+16|0;a[g]=0;i=d;return}if((f&7|0)==0){bf(f)}else{f=d|0;au(f|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(f|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[e>>2]=0;c[b+8>>2]=0;c[b+12>>2]=0;g=b+16|0;a[g]=0;i=d;return}function a2(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,j=0,k=0,l=0;b=i;i=i+1536|0;d=b|0;e=b+512|0;f=b+1024|0;if((a|0)==0){i=b;return}g=c[a+168>>2]|0;do{if((g|0)!=0){h=c[g-4>>2]|0;j=g-8|0;if((h|0)==0){k=94}else{if((h|0)!=(~c[j>>2]|0)){k=94}}if((k|0)==94){h=d|0;au(h|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=645,c[l+16>>2]=280,l)|0)|0;i=l;al(h|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;if((j|0)==0){break}}if((j&7|0)!=0){h=d|0;au(h|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=2500,c[l+16>>2]=576,l)|0)|0;i=l;al(h|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;break}if((j|0)==0){be(0)|0;break}else{bf(j);break}}}while(0);d=c[a+176>>2]|0;do{if((d|0)!=0){g=c[d-4>>2]|0;j=d-8|0;if((g|0)==0){k=103}else{if((g|0)!=(~c[j>>2]|0)){k=103}}if((k|0)==103){g=f|0;au(g|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=645,c[l+16>>2]=280,l)|0)|0;i=l;al(g|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;if((j|0)==0){break}}if((j&7|0)!=0){g=f|0;au(g|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=2500,c[l+16>>2]=576,l)|0)|0;i=l;al(g|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;break}if((j|0)==0){be(0)|0;break}else{bf(j);break}}}while(0);if((a&7|0)==0){bf(a);i=b;return}else{a=e|0;au(a|0,768,(l=i,i=i+24|0,c[l>>2]=472,c[l+8>>2]=2500,c[l+16>>2]=576,l)|0)|0;i=l;al(a|0,(l=i,i=i+1|0,i=i+7&-8,c[l>>2]=0,l)|0)|0;i=l;i=b;return}}function a3(f){f=f|0;var g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0;g=i;i=i+1232|0;h=g|0;j=g+512|0;k=g+576|0;l=g+648|0;m=g+720|0;n=f+8|0;o=c[n>>2]|0;if(!((o|0)!=0&o>>>0<8193)){p=m|0;au(p|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2998,c[q+16>>2]=496,q)|0)|0;i=q;al(p|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}p=f|0;c[p>>2]=o;r=f+20|0;s=c[r>>2]|0;if((s|0)==0){t=a_(180)|0;if((t|0)==0){u=0}else{bj(t+164|0,0,16);u=t}c[r>>2]=u;v=u;w=c[p>>2]|0}else{v=s;w=o}if((c[n>>2]|0)==0){n=m|0;au(n|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=904,c[q+16>>2]=312,q)|0)|0;i=q;al(n|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;x=c[p>>2]|0}else{x=w}p=c[f+4>>2]|0;if(x>>>0>16){f=x;n=0;while(1){y=n+1|0;if(f>>>0>3){f=f>>>1;n=y}else{break}}f=n+2+((y|0)!=32&1<<y>>>0<x>>>0&1)|0;z=f>>>0<11?f&255:11}else{z=0}if((w|0)==0|z>>>0>11){A=0;i=g;return A|0}c[v>>2]=w;bj(k|0,0,68);f=0;while(1){x=a[p+f|0]|0;if(x<<24>>24!=0){y=k+((x&255)<<2)|0;c[y>>2]=(c[y>>2]|0)+1}y=f+1|0;if(y>>>0<w>>>0){f=y}else{B=1;C=-1;D=0;E=0;F=0;break}}while(1){f=c[k+(B<<2)>>2]|0;if((f|0)==0){c[v+28+(B-1<<2)>>2]=0;G=F;H=E;I=D;J=C}else{y=B-1|0;c[j+(y<<2)>>2]=F;x=f+F|0;n=16-B|0;c[v+28+(y<<2)>>2]=(x-1<<n|(1<<n)-1)+1;c[v+96+(y<<2)>>2]=E;c[l+(B<<2)>>2]=E;G=x;H=f+E|0;I=D>>>0>B>>>0?D:B;J=C>>>0<B>>>0?C:B}f=B+1|0;if(f>>>0<17){B=f;C=J;D=I;E=H;F=G<<1}else{break}}c[v+4>>2]=H;G=v+172|0;do{if(H>>>0>(c[G>>2]|0)>>>0){c[G>>2]=H;F=H-1|0;if((H|0)==0){K=140}else{if((F&H|0)!=0){K=140}}if((K|0)==140){E=F>>>16|F;F=E>>>8|E;E=F>>>4|F;F=E>>>2|E;E=(F>>>1|F)+1|0;c[G>>2]=E>>>0>w>>>0?w:E}E=v+176|0;F=c[E>>2]|0;do{if((F|0)!=0){D=c[F-4>>2]|0;C=F-8|0;if((D|0)==0){K=144}else{if((D|0)!=(~c[C>>2]|0)){K=144}}if((K|0)==144){D=h|0;au(D|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=645,c[q+16>>2]=280,q)|0)|0;i=q;al(D|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;if((C|0)==0){break}}if((C&7|0)!=0){D=h|0;au(D|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2500,c[q+16>>2]=576,q)|0)|0;i=q;al(D|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;break}if((C|0)==0){be(0)|0;break}else{bf(C);break}}}while(0);F=c[G>>2]|0;C=(F|0)==0?1:F;F=a_((C<<1)+8|0)|0;if((F|0)==0){c[E>>2]=0;A=0;i=g;return A|0}else{D=F+8|0;c[F+4>>2]=C;c[F>>2]=~C;c[E>>2]=D;if((D|0)==0){A=0}else{L=E;break}i=g;return A|0}}else{L=v+176|0}}while(0);G=v+24|0;a[G]=J&255;a[v+25|0]=I&255;J=h|0;h=0;do{D=a[p+h|0]|0;C=D&255;if(D<<24>>24!=0){if((c[k+(C<<2)>>2]|0)==0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2274,c[q+16>>2]=136,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}D=l+(C<<2)|0;C=c[D>>2]|0;c[D>>2]=C+1;if(C>>>0>=H>>>0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2278,c[q+16>>2]=104,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}b[(c[L>>2]|0)+(C<<1)>>1]=h&65535}h=h+1|0;}while(h>>>0<w>>>0);w=a[G]|0;h=(w&255)>>>0<z>>>0?z:0;z=v+8|0;c[z>>2]=h;H=(h|0)!=0;if(H){l=1<<h;C=v+164|0;do{if(l>>>0>(c[C>>2]|0)>>>0){c[C>>2]=l;D=v+168|0;F=c[D>>2]|0;do{if((F|0)!=0){B=c[F-4>>2]|0;f=F-8|0;if((B|0)==0){K=169}else{if((B|0)!=(~c[f>>2]|0)){K=169}}if((K|0)==169){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=645,c[q+16>>2]=280,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;if((f|0)==0){break}}if((f&7|0)!=0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2500,c[q+16>>2]=576,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;break}if((f|0)==0){be(0)|0;break}else{bf(f);break}}}while(0);F=l<<2;E=a_(F+8|0)|0;if((E|0)==0){c[D>>2]=0;A=0;i=g;return A|0}else{f=E+8|0;B=f;c[E+4>>2]=l;c[E>>2]=~l;c[D>>2]=B;if((f|0)==0){A=0}else{M=B;N=F;break}i=g;return A|0}}else{M=c[v+168>>2]|0;N=l<<2}}while(0);K=v+168|0;bj(M|0,-1|0,N|0);N=1;do{do{if((c[k+(N<<2)>>2]|0)!=0){M=h-N|0;C=1<<M;F=N-1|0;B=c[j+(F<<2)>>2]|0;if(!((N|0)!=0&N>>>0<17)){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=1954,c[q+16>>2]=200,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}f=c[v+28+(F<<2)>>2]|0;if((f|0)==0){O=-1}else{O=(f-1|0)>>>((16-N|0)>>>0)}if(B>>>0>O>>>0){break}f=(c[v+96+(F<<2)>>2]|0)-B|0;F=N<<16;E=B;do{B=e[(c[L>>2]|0)+(f+E<<1)>>1]|0;if((d[p+B|0]|0|0)!=(N|0)){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2320,c[q+16>>2]=64,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}x=E<<M;y=B|F;B=0;do{n=B+x|0;if(n>>>0>=l>>>0){au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2326,c[q+16>>2]=40,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q}m=c[K>>2]|0;if((c[m+(n<<2)>>2]|0)==-1){P=m}else{au(J|0,768,(q=i,i=i+24|0,c[q>>2]=472,c[q+8>>2]=2328,c[q+16>>2]=8,q)|0)|0;i=q;al(J|0,(q=i,i=i+1|0,i=i+7&-8,c[q>>2]=0,q)|0)|0;i=q;P=c[K>>2]|0}c[P+(n<<2)>>2]=y;B=B+1|0;}while(B>>>0<C>>>0);E=E+1|0;}while(E>>>0<=O>>>0)}}while(0);N=N+1|0;}while(N>>>0<=h>>>0);Q=a[G]|0}else{Q=w}w=v+96|0;c[w>>2]=(c[w>>2]|0)-(c[j>>2]|0);w=v+100|0;c[w>>2]=(c[w>>2]|0)-(c[j+4>>2]|0);w=v+104|0;c[w>>2]=(c[w>>2]|0)-(c[j+8>>2]|0);w=v+108|0;c[w>>2]=(c[w>>2]|0)-(c[j+12>>2]|0);w=v+112|0;c[w>>2]=(c[w>>2]|0)-(c[j+16>>2]|0);w=v+116|0;c[w>>2]=(c[w>>2]|0)-(c[j+20>>2]|0);w=v+120|0;c[w>>2]=(c[w>>2]|0)-(c[j+24>>2]|0);w=v+124|0;c[w>>2]=(c[w>>2]|0)-(c[j+28>>2]|0);w=v+128|0;c[w>>2]=(c[w>>2]|0)-(c[j+32>>2]|0);w=v+132|0;c[w>>2]=(c[w>>2]|0)-(c[j+36>>2]|0);w=v+136|0;c[w>>2]=(c[w>>2]|0)-(c[j+40>>2]|0);w=v+140|0;c[w>>2]=(c[w>>2]|0)-(c[j+44>>2]|0);w=v+144|0;c[w>>2]=(c[w>>2]|0)-(c[j+48>>2]|0);w=v+148|0;c[w>>2]=(c[w>>2]|0)-(c[j+52>>2]|0);w=v+152|0;c[w>>2]=(c[w>>2]|0)-(c[j+56>>2]|0);w=v+156|0;c[w>>2]=(c[w>>2]|0)-(c[j+60>>2]|0);j=v+16|0;c[j>>2]=0;w=v+20|0;c[w>>2]=Q&255;L279:do{if(H){Q=h;while(1){if((Q|0)==0){break L279}R=Q-1|0;if((c[k+(Q<<2)>>2]|0)==0){Q=R}else{break}}c[j>>2]=c[v+28+(R<<2)>>2];Q=h+1|0;c[w>>2]=Q;G=Q;while(1){if(G>>>0>I>>>0){break L279}if((c[k+(G<<2)>>2]|0)==0){G=G+1|0}else{break}}c[w>>2]=G}}while(0);c[v+92>>2]=-1;c[v+160>>2]=1048575;c[v+12>>2]=32-(c[z>>2]|0);A=1;i=g;return A|0}function a4(b,e){b=b|0;e=e|0;var f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0,S=0,T=0,U=0,V=0,W=0,X=0,Y=0,Z=0,_=0,$=0,aa=0,ab=0,ac=0,ad=0,ae=0,af=0,ag=0,ah=0,ai=0,aj=0;f=i;i=i+4120|0;g=f+512|0;h=f+1024|0;j=f+1536|0;k=f+2048|0;l=f+2560|0;m=f+3072|0;n=f+3584|0;o=f+4096|0;p=b+20|0;q=c[p>>2]|0;if((q|0)<14){r=b+4|0;s=b+8|0;t=b+16|0;u=f|0;v=q;while(1){w=c[r>>2]|0;if((w|0)==(c[s>>2]|0)){x=0}else{c[r>>2]=w+1;x=d[w]|0}w=v+8|0;c[p>>2]=w;if((w|0)<33){y=w}else{au(u|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(u|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;y=c[p>>2]|0}w=x<<32-y|c[t>>2];c[t>>2]=w;if((y|0)<14){v=y}else{A=y;B=w;break}}}else{A=q;B=c[b+16>>2]|0}q=b+16|0;y=B>>>18;c[q>>2]=B<<14;c[p>>2]=A-14;if((y|0)==0){c[e>>2]=0;A=e+4|0;B=c[A>>2]|0;if((B|0)!=0){if((B&7|0)==0){bf(B)}else{B=n|0;au(B|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=2500,c[z+16>>2]=576,z)|0)|0;i=z;al(B|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}c[A>>2]=0;c[e+8>>2]=0;c[e+12>>2]=0}a[e+16|0]=0;A=e+20|0;B=c[A>>2]|0;if((B|0)==0){C=1;i=f;return C|0}a2(B);c[A>>2]=0;C=1;i=f;return C|0}A=e+4|0;B=e+8|0;v=c[B>>2]|0;if((v|0)!=(y|0)){if(v>>>0<=y>>>0){do{if((c[e+12>>2]|0)>>>0<y>>>0){if(aZ(A,y,(v+1|0)==(y|0),1)|0){D=c[B>>2]|0;break}a[e+16|0]=1;C=0;i=f;return C|0}else{D=v}}while(0);bj((c[A>>2]|0)+D|0,0,y-D|0)}c[B>>2]=y}D=A|0;bj(c[D>>2]|0,0,y|0);A=c[p>>2]|0;if((A|0)<5){v=b+4|0;t=b+8|0;x=m|0;m=A;while(1){u=c[v>>2]|0;if((u|0)==(c[t>>2]|0)){E=0}else{c[v>>2]=u+1;E=d[u]|0}u=m+8|0;c[p>>2]=u;if((u|0)<33){F=u}else{au(x|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(x|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;F=c[p>>2]|0}u=E<<32-F|c[q>>2];c[q>>2]=u;if((F|0)<5){m=F}else{G=F;H=u;break}}}else{G=A;H=c[q>>2]|0}A=H>>>27;c[q>>2]=H<<5;c[p>>2]=G-5;if((A|0)==0|H>>>0>2952790015){C=0;i=f;return C|0}c[o+20>>2]=0;bj(o|0,0,17);H=o+4|0;G=o+8|0;L345:do{if(aZ(H,21,0,1)|0){F=c[G>>2]|0;m=c[H>>2]|0;bj(m+F|0,0,21-F|0);c[G>>2]=21;F=b+4|0;E=b+8|0;x=l|0;v=0;do{t=c[p>>2]|0;if((t|0)<3){u=t;while(1){r=c[F>>2]|0;if((r|0)==(c[E>>2]|0)){I=0}else{c[F>>2]=r+1;I=d[r]|0}r=u+8|0;c[p>>2]=r;if((r|0)<33){J=r}else{au(x|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(x|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;J=c[p>>2]|0}r=I<<32-J|c[q>>2];c[q>>2]=r;if((J|0)<3){u=J}else{K=J;L=r;break}}}else{K=t;L=c[q>>2]|0}c[q>>2]=L<<3;c[p>>2]=K-3;a[m+(d[808+v|0]|0)|0]=L>>>29&255;v=v+1|0;}while(v>>>0<A>>>0);if(!(a3(o)|0)){M=0;break}v=n|0;m=h|0;x=g|0;u=k|0;r=j|0;s=0;L362:while(1){w=y-s|0;N=a5(b,o)|0;do{if(N>>>0<17){if((c[B>>2]|0)>>>0<=s>>>0){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=904,c[z+16>>2]=312,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}a[(c[D>>2]|0)+s|0]=N&255;O=s+1|0}else{if((N|0)==18){P=c[p>>2]|0;if((P|0)<7){Q=P;while(1){R=c[F>>2]|0;if((R|0)==(c[E>>2]|0)){S=0}else{c[F>>2]=R+1;S=d[R]|0}R=Q+8|0;c[p>>2]=R;if((R|0)<33){T=R}else{au(r|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(r|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;T=c[p>>2]|0}R=S<<32-T|c[q>>2];c[q>>2]=R;if((T|0)<7){Q=T}else{U=T;V=R;break}}}else{U=P;V=c[q>>2]|0}c[q>>2]=V<<7;c[p>>2]=U-7;Q=(V>>>25)+11|0;if(Q>>>0>w>>>0){M=0;break L345}O=Q+s|0;break}else if((N|0)==17){Q=c[p>>2]|0;if((Q|0)<3){R=Q;while(1){W=c[F>>2]|0;if((W|0)==(c[E>>2]|0)){X=0}else{c[F>>2]=W+1;X=d[W]|0}W=R+8|0;c[p>>2]=W;if((W|0)<33){Y=W}else{au(u|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(u|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;Y=c[p>>2]|0}W=X<<32-Y|c[q>>2];c[q>>2]=W;if((Y|0)<3){R=Y}else{Z=Y;_=W;break}}}else{Z=Q;_=c[q>>2]|0}c[q>>2]=_<<3;c[p>>2]=Z-3;R=(_>>>29)+3|0;if(R>>>0>w>>>0){M=0;break L345}O=R+s|0;break}else{if((N-19|0)>>>0>=2){$=306;break L362}R=c[p>>2]|0;if((N|0)==19){if((R|0)<2){P=R;while(1){W=c[F>>2]|0;if((W|0)==(c[E>>2]|0)){aa=0}else{c[F>>2]=W+1;aa=d[W]|0}W=P+8|0;c[p>>2]=W;if((W|0)<33){ab=W}else{au(m|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(m|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;ab=c[p>>2]|0}W=aa<<32-ab|c[q>>2];c[q>>2]=W;if((ab|0)<2){P=ab}else{ac=ab;ad=W;break}}}else{ac=R;ad=c[q>>2]|0}c[q>>2]=ad<<2;c[p>>2]=ac-2;ae=(ad>>>30)+3|0}else{if((R|0)<6){P=R;while(1){Q=c[F>>2]|0;if((Q|0)==(c[E>>2]|0)){af=0}else{c[F>>2]=Q+1;af=d[Q]|0}Q=P+8|0;c[p>>2]=Q;if((Q|0)<33){ag=Q}else{au(x|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3200,c[z+16>>2]=432,z)|0)|0;i=z;al(x|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;ag=c[p>>2]|0}Q=af<<32-ag|c[q>>2];c[q>>2]=Q;if((ag|0)<6){P=ag}else{ah=ag;ai=Q;break}}}else{ah=R;ai=c[q>>2]|0}c[q>>2]=ai<<6;c[p>>2]=ah-6;ae=(ai>>>26)+7|0}if((s|0)==0|ae>>>0>w>>>0){M=0;break L345}P=s-1|0;if((c[B>>2]|0)>>>0<=P>>>0){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=904,c[z+16>>2]=312,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}Q=a[(c[D>>2]|0)+P|0]|0;if(Q<<24>>24==0){M=0;break L345}P=ae+s|0;if(s>>>0<P>>>0){aj=s}else{O=s;break}while(1){if((c[B>>2]|0)>>>0<=aj>>>0){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=904,c[z+16>>2]=312,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z}W=aj+1|0;a[(c[D>>2]|0)+aj|0]=Q;if(W>>>0<P>>>0){aj=W}else{O=P;break}}}}}while(0);if(O>>>0<y>>>0){s=O}else{break}}if(($|0)==306){au(v|0,768,(z=i,i=i+24|0,c[z>>2]=472,c[z+8>>2]=3141,c[z+16>>2]=464,z)|0)|0;i=z;al(v|0,(z=i,i=i+1|0,i=i+7&-8,c[z>>2]=0,z)|0)|0;i=z;M=0;break}if((O|0)!=(y|0)){M=0;break}M=a3(e)|0}else{a[o+16|0]=1;M=0}}while(0);a1(o);C=M;i=f;return C|0}function a5(a,b){a=a|0;b=b|0;var f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0;f=i;i=i+512|0;g=f|0;h=c[b+20>>2]|0;j=a+20|0;k=c[j>>2]|0;do{if((k|0)<24){l=a+4|0;m=c[l>>2]|0;n=c[a+8>>2]|0;o=m>>>0<n>>>0;if((k|0)>=16){if(o){c[l>>2]=m+1;p=d[m]|0}else{p=0}c[j>>2]=k+8;q=a+16|0;r=p<<24-k|c[q>>2];c[q>>2]=r;s=r;break}if(o){t=(d[m]|0)<<8;u=m+1|0}else{t=0;u=m}if(u>>>0<n>>>0){v=d[u]|0;w=u+1|0}else{v=0;w=u}c[l>>2]=w;c[j>>2]=k+16;l=a+16|0;n=(v|t)<<16-k|c[l>>2];c[l>>2]=n;s=n}else{s=c[a+16>>2]|0}}while(0);k=a+16|0;a=(s>>>16)+1|0;do{if(a>>>0>(c[h+16>>2]|0)>>>0){t=c[h+20>>2]|0;while(1){x=t-1|0;if(a>>>0>(c[h+28+(x<<2)>>2]|0)>>>0){t=t+1|0}else{break}}v=(c[h+96+(x<<2)>>2]|0)+(s>>>((32-t|0)>>>0))|0;if(v>>>0<(c[b>>2]|0)>>>0){y=t;z=e[(c[h+176>>2]|0)+(v<<1)>>1]|0;break}v=g|0;au(v|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=3267,c[A+16>>2]=464,A)|0)|0;i=A;al(v|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A;B=0;i=f;return B|0}else{v=c[(c[h+168>>2]|0)+(s>>>((32-(c[h+8>>2]|0)|0)>>>0)<<2)>>2]|0;if((v|0)==-1){w=g|0;au(w|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=3245,c[A+16>>2]=408,A)|0)|0;i=A;al(w|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A}w=v&65535;u=v>>>16;if((c[b+8>>2]|0)>>>0<=w>>>0){v=g|0;au(v|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=903,c[A+16>>2]=312,A)|0)|0;i=A;al(v|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A}if((d[(c[b+4>>2]|0)+w|0]|0|0)==(u|0)){y=u;z=w;break}v=g|0;au(v|0,768,(A=i,i=i+24|0,c[A>>2]=472,c[A+8>>2]=3249,c[A+16>>2]=376,A)|0)|0;i=A;al(v|0,(A=i,i=i+1|0,i=i+7&-8,c[A>>2]=0,A)|0)|0;i=A;y=u;z=w}}while(0);c[k>>2]=c[k>>2]<<y;c[j>>2]=(c[j>>2]|0)-y;B=z;i=f;return B|0}function a6(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+4>>2]|0}function a7(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+8>>2]|0}function a8(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+12>>2]|0}function a9(a,b){a=a|0;b=b|0;var d=0,e=0;d=i;i=i+40|0;e=d|0;c[e>>2]=40;a0(a,b,e);i=d;return c[e+32>>2]|0}function ba(a,b){a=a|0;b=b|0;var d=0,e=0,f=0,g=0,h=0,j=0,k=0;d=i;i=i+552|0;e=d|0;f=d+512|0;c[f>>2]=40;a0(a,b,f);b=f+32|0;f=c[b>>2]|0;a=c[b+4>>2]|0;b=9;g=0;h=0;j=0;if((f|0)==1&(a|0)==0|(f|0)==2&(a|0)==0|(f|0)==7&(a|0)==0|(f|0)==8&(a|0)==0|(f|0)==3&(a|0)==0|(f|0)==4&(a|0)==0|(f|0)==5&(a|0)==0|(f|0)==6&(a|0)==0){k=16;i=d;return k|0}else if((f|0)==(h|0)&(a|0)==(j|0)|(f|0)==(b|0)&(a|0)==(g|0)){k=8;i=d;return k|0}else{g=e|0;au(g|0,768,(e=i,i=i+24|0,c[e>>2]=472,c[e+8>>2]=2664,c[e+16>>2]=568,e)|0)|0;i=e;al(g|0,(e=i,i=i+1|0,i=i+7&-8,c[e>>2]=0,e)|0)|0;i=e;k=0;i=d;return k|0}return 0}function bb(a,b,d){a=a|0;b=b|0;d=d|0;var e=0,f=0,g=0,h=0,j=0,k=0,l=0,m=0,n=0,o=0;e=i;i=i+552|0;f=e|0;g=e+512|0;c[g>>2]=40;a0(a,b,g);b=(((c[g+4>>2]|0)>>>(d>>>0))+3|0)>>>2;a=(((c[g+8>>2]|0)>>>(d>>>0))+3|0)>>>2;d=g+32|0;g=c[d>>2]|0;h=c[d+4>>2]|0;d=9;j=0;k=0;l=0;if((g|0)==1&(h|0)==0|(g|0)==2&(h|0)==0|(g|0)==7&(h|0)==0|(g|0)==8&(h|0)==0|(g|0)==3&(h|0)==0|(g|0)==4&(h|0)==0|(g|0)==5&(h|0)==0|(g|0)==6&(h|0)==0){m=16;n=Z(a,b)|0;o=Z(n,m)|0;i=e;return o|0}else if((g|0)==(k|0)&(h|0)==(l|0)|(g|0)==(d|0)&(h|0)==(j|0)){m=8;n=Z(a,b)|0;o=Z(n,m)|0;i=e;return o|0}else{j=f|0;au(j|0,768,(f=i,i=i+24|0,c[f>>2]=472,c[f+8>>2]=2664,c[f+16>>2]=568,f)|0)|0;i=f;al(j|0,(f=i,i=i+1|0,i=i+7&-8,c[f>>2]=0,f)|0)|0;i=f;m=0;n=Z(a,b)|0;o=Z(n,m)|0;i=e;return o|0}return 0}function bc(f,g,h,j,k,l){f=f|0;g=g|0;h=h|0;j=j|0;k=k|0;l=l|0;var m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0,S=0,T=0,U=0,V=0,W=0,X=0,Y=0,_=0,$=0,aa=0,ab=0,ac=0,ad=0,ae=0,af=0,ag=0,ah=0,ai=0,aj=0,ak=0,am=0,an=0,ao=0,ap=0,aq=0,ar=0,as=0,at=0,av=0,aw=0,ax=0,ay=0,az=0,aA=0,aB=0,aC=0,aD=0,aE=0,aF=0,aG=0,aH=0,aI=0,aJ=0,aK=0,aL=0,aM=0,aN=0,aO=0,aP=0,aQ=0,aR=0,aS=0,aT=0,aU=0,aV=0,aW=0,aX=0,aY=0,a$=0,a2=0,a3=0,a6=0,a7=0,a8=0,a9=0,ba=0,bb=0,bc=0,be=0,bg=0,bh=0,bi=0,bk=0,bl=0,bm=0,bn=0,bo=0,bp=0,bq=0,br=0,bs=0,bt=0,bu=0,bv=0,bw=0,bx=0,by=0,bz=0,bA=0,bB=0,bC=0,bD=0,bE=0,bF=0,bG=0,bH=0,bI=0,bJ=0,bK=0,bL=0,bM=0,bN=0,bO=0,bP=0,bQ=0,bR=0,bS=0,bT=0,bU=0,bV=0,bW=0,bX=0,bY=0,bZ=0,b_=0,b$=0,b0=0,b1=0,b2=0,b3=0,b4=0,b5=0,b6=0,b7=0,b8=0,b9=0,ca=0,cb=0,cc=0,cd=0,ce=0,cf=0,cg=0,ch=0,ci=0,cj=0,ck=0,cl=0,cm=0,cn=0,co=0,cp=0,cq=0,cr=0,cs=0;j=i;i=i+4008|0;m=j|0;n=j+16|0;o=j+32|0;p=j+56|0;q=j+960|0;r=j+1864|0;s=j+1888|0;t=j+1912|0;u=j+2112|0;v=j+2312|0;w=j+2376|0;x=j+2888|0;y=j+2936|0;z=j+3448|0;A=j+3960|0;B=j+4e3|0;c[A>>2]=40;a0(f,g,A);C=(c[A+4>>2]|0)>>>(k>>>0);D=(c[A+8>>2]|0)>>>(k>>>0);E=A+32|0;A=c[E>>2]|0;F=c[E+4>>2]|0;E=9;G=0;H=0;I=0;if((A|0)==1&(F|0)==0|(A|0)==2&(F|0)==0|(A|0)==7&(F|0)==0|(A|0)==8&(F|0)==0|(A|0)==3&(F|0)==0|(A|0)==4&(F|0)==0|(A|0)==5&(F|0)==0|(A|0)==6&(F|0)==0){J=16}else if((A|0)==(H|0)&(F|0)==(I|0)|(A|0)==(E|0)&(F|0)==(G|0)){J=8}else{G=z|0;au(G|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=2664,c[K+16>>2]=568,K)|0)|0;i=K;al(G|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;J=0}G=B|0;c[G>>2]=h;L502:do{if((f|0)==0|g>>>0<62){L=0}else{F=a_(300)|0;if((F|0)==0){L=0;break}E=F;c[F>>2]=519686845;A=F+4|0;c[A>>2]=0;I=F+8|0;c[I>>2]=0;H=F+88|0;bj(H|0,0,45);M=F+252|0;bj(M|0,0,13);N=F+268|0;bj(N|0,0,13);O=F+284|0;bj(O|0,0,13);bj(F+136|0,0,21);bj(F+160|0,0,21);bj(F+184|0,0,21);bj(F+208|0,0,21);bj(F+232|0,0,17);L505:do{if(g>>>0<74){P=369}else{if(((d[f]|0)<<8|(d[f+1|0]|0)|0)!=18552){P=369;break}if(((d[f+2|0]|0)<<8|(d[f+3|0]|0))>>>0<74){P=369;break}Q=((d[f+7|0]|0)<<16|(d[f+6|0]|0)<<24|(d[f+8|0]|0)<<8|(d[f+9|0]|0))>>>0>g>>>0?0:f;R=H;c[R>>2]=Q;if((Q|0)==0){break}c[A>>2]=f;c[I>>2]=g;S=F+92|0;T=S;U=(d[Q+68|0]|0)<<8|(d[Q+67|0]|0)<<16|(d[Q+69|0]|0);V=f+U|0;W=(d[Q+65|0]|0)<<8|(d[Q+66|0]|0);if((W|0)==0){break}Q=S;c[Q>>2]=V;S=F+96|0;c[S>>2]=V;V=F+104|0;c[V>>2]=W;X=F+100|0;c[X>>2]=f+(W+U);U=F+108|0;c[U>>2]=0;W=F+112|0;c[W>>2]=0;if(!(a4(T,F+116|0)|0)){break}Y=c[R>>2]|0;if(((d[Y+39|0]|0)<<8|(d[Y+40|0]|0)|0)==0){_=a[Y+55|0]|0;$=a[Y+56|0]|0;if(((_&255)<<8|$&255|0)==0){break}else{aa=_;ab=$;ac=Y}}else{if(!(a4(T,F+140|0)|0)){break}if(!(a4(T,F+188|0)|0)){break}Y=c[R>>2]|0;aa=a[Y+55|0]|0;ab=a[Y+56|0]|0;ac=Y}if(((aa&255)<<8|ab&255|0)==0){ad=ac}else{if(!(a4(T,F+164|0)|0)){break}if(!(a4(T,F+212|0)|0)){break}ad=c[R>>2]|0}Y=(d[ad+39|0]|0)<<8|(d[ad+40|0]|0);if((Y|0)==0){ae=ad}else{$=x;_=F+236|0;af=F+240|0;ag=c[af>>2]|0;if((ag|0)==(Y|0)){ah=ad}else{if(ag>>>0>Y>>>0){ai=ad}else{do{if((c[F+244>>2]|0)>>>0<Y>>>0){if(aZ(_,Y,(ag+1|0)==(Y|0),4)|0){aj=c[af>>2]|0;break}else{a[F+248|0]=1;break L505}}else{aj=ag}}while(0);bj((c[_>>2]|0)+(aj<<2)|0,0,Y-aj<<2|0);ai=c[R>>2]|0}c[af>>2]=Y;ah=ai}ag=c[A>>2]|0;ak=(d[ah+34|0]|0)<<8|(d[ah+33|0]|0)<<16|(d[ah+35|0]|0);am=ag+ak|0;an=(d[ah+37|0]|0)<<8|(d[ah+36|0]|0)<<16|(d[ah+38|0]|0);if((an|0)==0){break}c[Q>>2]=am;c[S>>2]=am;c[V>>2]=an;c[X>>2]=ag+(an+ak);c[U>>2]=0;c[W>>2]=0;ak=x|0;bj($|0,0,17);an=x+24|0;c[x+44>>2]=0;bj(x+20|0,0,21);ag=0;while(1){if(ag>>>0>=2){P=397;break}if(a4(T,x+(ag*24|0)|0)|0){ag=ag+1|0}else{ao=0;break}}if((P|0)==397){if((c[af>>2]|0)==0){ag=w|0;au(ag|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(ag|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}ag=0;$=0;am=0;ap=0;aq=0;ar=c[_>>2]|0;as=0;at=0;while(1){av=(a5(T,ak)|0)+at&31;aw=(a5(T,an)|0)+ag&63;ax=(a5(T,ak)|0)+$&31;ay=(a5(T,ak)|0)+am|0;az=(a5(T,an)|0)+ap&63;aA=(a5(T,ak)|0)+aq&31;c[ar>>2]=aw<<5|av<<11|ax|ay<<27|az<<21|aA<<16;aB=as+1|0;if(aB>>>0<Y>>>0){ag=aw;$=ax;am=ay&31;ap=az;aq=aA;ar=ar+4|0;as=aB;at=av}else{ao=1;break}}}a1(an);a1(ak);if(!ao){break}at=v;as=c[R>>2]|0;ar=(d[as+47|0]|0)<<8|(d[as+48|0]|0);aq=c[A>>2]|0;ap=(d[as+42|0]|0)<<8|(d[as+41|0]|0)<<16|(d[as+43|0]|0);am=aq+ap|0;$=(d[as+45|0]|0)<<8|(d[as+44|0]|0)<<16|(d[as+46|0]|0);if(($|0)==0){break}c[Q>>2]=am;c[S>>2]=am;c[V>>2]=$;c[X>>2]=aq+($+ap);c[U>>2]=0;c[W>>2]=0;c[s+20>>2]=0;bj(s|0,0,17);if(a4(T,s)|0){aC=-3;aD=-3;aE=0}else{a1(s);break}while(1){c[t+(aE<<2)>>2]=aC;c[u+(aE<<2)>>2]=aD;ap=aC+1|0;$=(ap|0)>3;aq=aE+1|0;if(aq>>>0<49){aC=$?-3:ap;aD=($&1)+aD|0;aE=aq}else{break}}bj(at|0,0,64);ak=F+256|0;an=c[ak>>2]|0;if((an|0)!=(ar|0)){if(an>>>0<=ar>>>0){do{if((c[F+260>>2]|0)>>>0<ar>>>0){if(aZ(M,ar,(an+1|0)==(ar|0),4)|0){aF=c[ak>>2]|0;break}else{a[F+264|0]=1;a1(s);break L505}}else{aF=an}}while(0);bj((c[M>>2]|0)+(aF<<2)|0,0,ar-aF<<2|0)}c[ak>>2]=ar}if((ar|0)==0){an=w|0;au(an|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(an|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}else{an=v|0;at=v+4|0;aq=v+8|0;$=v+12|0;ap=v+16|0;am=v+20|0;as=v+24|0;ag=v+28|0;Y=v+32|0;_=v+36|0;af=v+40|0;av=v+44|0;aB=v+48|0;aA=v+52|0;az=v+56|0;ay=v+60|0;ax=c[M>>2]|0;aw=0;while(1){aG=0;do{aH=a5(T,s)|0;aI=aG<<1;aJ=v+(aI<<2)|0;c[aJ>>2]=(c[aJ>>2]|0)+(c[t+(aH<<2)>>2]|0)&3;aJ=v+((aI|1)<<2)|0;c[aJ>>2]=(c[aJ>>2]|0)+(c[u+(aH<<2)>>2]|0)&3;aG=aG+1|0;}while(aG>>>0<8);c[ax>>2]=(d[880+(c[at>>2]|0)|0]|0)<<2|(d[880+(c[an>>2]|0)|0]|0)|(d[880+(c[aq>>2]|0)|0]|0)<<4|(d[880+(c[$>>2]|0)|0]|0)<<6|(d[880+(c[ap>>2]|0)|0]|0)<<8|(d[880+(c[am>>2]|0)|0]|0)<<10|(d[880+(c[as>>2]|0)|0]|0)<<12|(d[880+(c[ag>>2]|0)|0]|0)<<14|(d[880+(c[Y>>2]|0)|0]|0)<<16|(d[880+(c[_>>2]|0)|0]|0)<<18|(d[880+(c[af>>2]|0)|0]|0)<<20|(d[880+(c[av>>2]|0)|0]|0)<<22|(d[880+(c[aB>>2]|0)|0]|0)<<24|(d[880+(c[aA>>2]|0)|0]|0)<<26|(d[880+(c[az>>2]|0)|0]|0)<<28|(d[880+(c[ay>>2]|0)|0]|0)<<30;aG=aw+1|0;if(aG>>>0<ar>>>0){ax=ax+4|0;aw=aG}else{break}}}a1(s);ae=c[R>>2]|0}aw=(d[ae+55|0]|0)<<8|(d[ae+56|0]|0);if((aw|0)==0){L=F;break L502}ax=c[A>>2]|0;ar=(d[ae+50|0]|0)<<8|(d[ae+49|0]|0)<<16|(d[ae+51|0]|0);ay=ax+ar|0;az=(d[ae+53|0]|0)<<8|(d[ae+52|0]|0)<<16|(d[ae+54|0]|0);if((az|0)==0){break}c[Q>>2]=ay;c[S>>2]=ay;c[V>>2]=az;c[X>>2]=ax+(az+ar);c[U>>2]=0;c[W>>2]=0;c[r+20>>2]=0;bj(r|0,0,17);L585:do{if(a4(T,r)|0){ar=F+272|0;az=c[ar>>2]|0;if((az|0)!=(aw|0)){if(az>>>0<=aw>>>0){do{if((c[F+276>>2]|0)>>>0<aw>>>0){if(aZ(N,aw,(az+1|0)==(aw|0),2)|0){aK=c[ar>>2]|0;break}else{a[F+280|0]=1;break L585}}else{aK=az}}while(0);bj((c[N>>2]|0)+(aK<<1)|0,0,aw-aK<<1|0)}c[ar>>2]=aw}az=c[N>>2]|0;ax=0;ay=0;aA=0;while(1){aB=a5(T,r)|0;av=aB+ax&255;aB=(a5(T,r)|0)+ay&255;b[az>>1]=(aB<<8|av)&65535;af=aA+1|0;if(af>>>0<aw>>>0){az=az+2|0;ax=av;ay=aB;aA=af}else{break}}a1(r);aA=v;ay=c[R>>2]|0;ax=(d[ay+63|0]|0)<<8|(d[ay+64|0]|0);az=c[A>>2]|0;ar=(d[ay+58|0]|0)<<8|(d[ay+57|0]|0)<<16|(d[ay+59|0]|0);af=az+ar|0;aB=(d[ay+61|0]|0)<<8|(d[ay+60|0]|0)<<16|(d[ay+62|0]|0);if((aB|0)==0){aL=0}else{c[Q>>2]=af;c[S>>2]=af;c[V>>2]=aB;c[X>>2]=az+(aB+ar);c[U>>2]=0;c[W>>2]=0;c[o+20>>2]=0;bj(o|0,0,17);L605:do{if(a4(T,o)|0){ar=-7;aB=-7;az=0;while(1){c[p+(az<<2)>>2]=ar;c[q+(az<<2)>>2]=aB;af=ar+1|0;ay=(af|0)>7;av=az+1|0;if(av>>>0<225){ar=ay?-7:af;aB=(ay&1)+aB|0;az=av}else{break}}bj(aA|0,0,64);az=ax*3|0;aB=F+288|0;ar=c[aB>>2]|0;if((ar|0)!=(az|0)){if(ar>>>0<=az>>>0){do{if((c[F+292>>2]|0)>>>0<az>>>0){if(aZ(O,az,(ar+1|0)==(az|0),2)|0){aM=c[aB>>2]|0;break}else{a[F+296|0]=1;aN=0;break L605}}else{aM=ar}}while(0);bj((c[O>>2]|0)+(aM<<1)|0,0,az-aM<<1|0)}c[aB>>2]=az}if((az|0)==0){ar=w|0;au(ar|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(ar|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}if((ax|0)==0){aN=1;break}ar=v|0;av=v+4|0;ay=v+8|0;af=v+12|0;_=v+16|0;Y=v+20|0;ag=v+24|0;as=v+28|0;am=v+32|0;ap=v+36|0;$=v+40|0;aq=v+44|0;an=v+48|0;at=v+52|0;ak=v+56|0;aG=v+60|0;aH=c[O>>2]|0;aJ=0;while(1){aI=0;do{aO=a5(T,o)|0;aP=aI<<1;aQ=v+(aP<<2)|0;c[aQ>>2]=(c[aQ>>2]|0)+(c[p+(aO<<2)>>2]|0)&7;aQ=v+((aP|1)<<2)|0;c[aQ>>2]=(c[aQ>>2]|0)+(c[q+(aO<<2)>>2]|0)&7;aI=aI+1|0;}while(aI>>>0<8);b[aH>>1]=(d[872+(c[av>>2]|0)|0]|0)<<3|(d[872+(c[ar>>2]|0)|0]|0)|(d[872+(c[ay>>2]|0)|0]|0)<<6|(d[872+(c[af>>2]|0)|0]|0)<<9|(d[872+(c[_>>2]|0)|0]|0)<<12|(d[872+(c[Y>>2]|0)|0]|0)<<15;b[aH+2>>1]=(d[872+(c[ag>>2]|0)|0]|0)<<2|(a[872+(c[Y>>2]|0)|0]&255)>>>1|(d[872+(c[as>>2]|0)|0]|0)<<5|(d[872+(c[am>>2]|0)|0]|0)<<8|(d[872+(c[ap>>2]|0)|0]|0)<<11|(d[872+(c[$>>2]|0)|0]|0)<<14;b[aH+4>>1]=(d[872+(c[aq>>2]|0)|0]|0)<<1|(a[872+(c[$>>2]|0)|0]&255)>>>2|(d[872+(c[an>>2]|0)|0]|0)<<4|(d[872+(c[at>>2]|0)|0]|0)<<7|(d[872+(c[ak>>2]|0)|0]|0)<<10|(d[872+(c[aG>>2]|0)|0]|0)<<13;aI=aJ+1|0;if(aI>>>0<ax>>>0){aH=aH+6|0;aJ=aI}else{aN=1;break}}}else{aN=0}}while(0);a1(o);aL=aN}if(aL){L=aL?F:0;break L502}else{break L505}}}while(0);a1(r)}}while(0);if((P|0)==369){c[H>>2]=0}bd(E);if((F&7|0)==0){bf(F);L=0;break}else{O=y|0;au(O|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=2500,c[K+16>>2]=576,K)|0)|0;i=K;al(O|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;L=0;break}}}while(0);r=l+k|0;do{if(r>>>0>k>>>0){l=L;if((L|0)==0){aL=k;aN=D;o=C;q=h;while(1){aR=q+(Z(Z((o+3|0)>>>2,J)|0,(aN+3|0)>>>2)|0)|0;v=aL+1|0;if(v>>>0<r>>>0){aL=v;aN=aN>>>1;o=o>>>1;q=aR}else{break}}c[G>>2]=aR;break}q=L+88|0;o=L+8|0;aN=L+4|0;aL=L+92|0;F=aL;E=L+96|0;H=L+104|0;v=L+100|0;p=L+108|0;aM=L+112|0;aK=L+240|0;ae=L+256|0;s=aL;aL=L+116|0;u=L+140|0;t=L+236|0;aF=w|0;aE=L+188|0;aD=L+252|0;aC=L+272|0;ao=L+212|0;x=L+288|0;ah=L+284|0;ai=L+164|0;aj=L+268|0;ad=y|0;ac=k;ab=D;aa=C;f=h;while(1){g=Z((aa+3|0)>>>2,J)|0;O=Z(g,(ab+3|0)>>>2)|0;do{if(O>>>0<8|ac>>>0>15){aS=f}else{if((c[l>>2]|0)!=519686845){aS=f;break}A=c[q>>2]|0;N=(d[A+70+(ac<<2)+1|0]|0)<<16|(d[A+70+(ac<<2)|0]|0)<<24|(d[A+70+(ac<<2)+2|0]|0)<<8|(d[A+70+(ac<<2)+3|0]|0);M=ac+1|0;if(M>>>0<(d[A+16|0]|0)>>>0){aT=(d[A+70+(M<<2)+1|0]|0)<<16|(d[A+70+(M<<2)|0]|0)<<24|(d[A+70+(M<<2)+2|0]|0)<<8|(d[A+70+(M<<2)+3|0]|0)}else{aT=c[o>>2]|0}if(aT>>>0>N>>>0){aU=A}else{au(ad|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=3705,c[K+16>>2]=248,K)|0)|0;i=K;al(ad|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;aU=c[q>>2]|0}A=c[aN>>2]|0;M=A+N|0;I=aT-N|0;T=((d[aU+12|0]|0)<<8|(d[aU+13|0]|0))>>>(ac>>>0);W=((d[aU+14|0]|0)<<8|(d[aU+15|0]|0))>>>(ac>>>0);U=T>>>0>1?(T+3|0)>>>2:1;T=W>>>0>1?(W+3|0)>>>2:1;W=aU+18|0;X=a[W]|0;if(X<<24>>24==0){aV=8}else{aV=X<<24>>24==9?8:16}X=Z(aV,U)|0;if((g|0)==0){aW=X;P=494}else{if(X>>>0<=g>>>0){aW=g;P=494}}L663:do{if((P|0)==494){P=0;if((Z(aW,T)|0)>>>0>O>>>0){break}X=(U+1|0)>>>1;V=(T+1|0)>>>1;if((aT|0)==(N|0)){break}c[F>>2]=M;c[E>>2]=M;c[H>>2]=I;c[v>>2]=A+aT;c[p>>2]=0;c[aM>>2]=0;switch(d[W]|0|0){case 0:{S=c[aK>>2]|0;Q=c[ae>>2]|0;R=a[aU+17|0]|0;aw=R&255;ax=aW>>>2;if(R<<24>>24==0){break L663}R=(V|0)==0;aA=V-1|0;aJ=(T&1|0)!=0;aH=aW<<1;aG=ax+1|0;ak=ax+2|0;at=ax+3|0;an=X-1|0;$=an<<4;aq=(U&1|0)!=0;ap=aW+4|0;am=0;as=0;Y=0;ag=1;while(1){if(R){aX=am;aY=as;a$=ag}else{_=am;af=as;ay=0;ar=c[B+(Y<<2)>>2]|0;av=ag;while(1){if((ay&1|0)==0){a2=0;a3=X;a6=1;a7=16;a8=ar}else{a2=an;a3=-1;a6=-1;a7=-16;a8=ar+$|0}az=(ay|0)==(aA|0);aB=az&aJ;if((a2|0)==(a3|0)){a9=_;ba=af;bb=av}else{aI=az&aJ^1;az=_;aO=af;aQ=a2;aP=a8;bc=av;while(1){if((bc|0)==1){be=a5(s,aL)|0|512}else{be=bc}bg=be&7;bh=d[832+bg|0]|0;bi=az;bk=0;do{bl=(a5(s,u)|0)+bi|0;bm=bl-S|0;bn=bm>>31;bi=bn&bl|bm&~bn;if((c[aK>>2]|0)>>>0<=bi>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(bk<<2)>>2]=c[(c[t>>2]|0)+(bi<<2)>>2];bk=bk+1|0;}while(bk>>>0<bh>>>0);bh=be>>>3;bk=(aQ|0)==(an|0)&aq;bn=aP;do{if(aB|bk){if(bk){bm=(a5(s,aE)|0)+aO|0;bl=bm-Q|0;bo=bl>>31;bp=bo&bm|bl&~bo;c[bn>>2]=c[n+((d[840+(bg<<2)|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bp>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+4>>2]=c[(c[aD>>2]|0)+(bp<<2)>>2];bo=(a5(s,aE)|0)+bp|0;bp=bo-Q|0;bl=bp>>31;bm=(a5(s,aE)|0)+(bl&bo|bp&~bl)|0;bl=bm-Q|0;bp=bl>>31;bo=bp&bm|bl&~bp;if(aB){bp=(a5(s,aE)|0)+bo|0;bl=bp-Q|0;bm=bl>>31;bq=bm&bp|bl&~bm;break}c[aP+aW>>2]=c[n+((d[842+(bg<<2)|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bo>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+ap>>2]=c[(c[aD>>2]|0)+(bo<<2)>>2];bm=(a5(s,aE)|0)+bo|0;bo=bm-Q|0;bl=bo>>31;bq=bl&bm|bo&~bl;break}else{br=aO;bs=0}while(1){bl=Z(bs,aW)|0;bo=bs<<1;bm=(a5(s,aE)|0)+br|0;bp=bm-Q|0;bt=bp>>31;bu=bt&bm|bp&~bt;if((bs|0)==0|aI){c[aP+bl>>2]=c[n+((d[840+(bg<<2)+bo|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bu>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+(bl+4)>>2]=c[(c[aD>>2]|0)+(bu<<2)>>2];bt=(a5(s,aE)|0)+bu|0;bp=bt-Q|0;bm=bp>>31;bv=bm&bt|bp&~bm;c[aP+(bl+8)>>2]=c[n+((d[(bo|1)+(840+(bg<<2))|0]|0)<<2)>>2];if((c[ae>>2]|0)>>>0<=bv>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+(bl+12)>>2]=c[(c[aD>>2]|0)+(bv<<2)>>2];bw=bv}else{bv=(a5(s,aE)|0)+bu|0;bu=bv-Q|0;bl=bu>>31;bw=bl&bv|bu&~bl}bl=bs+1|0;if(bl>>>0<2){br=bw;bs=bl}else{bq=bw;break}}}else{c[bn>>2]=c[n+((d[840+(bg<<2)|0]|0)<<2)>>2];bl=(a5(s,aE)|0)+aO|0;bu=bl-Q|0;bv=bu>>31;bo=bv&bl|bu&~bv;if((c[ae>>2]|0)>>>0<=bo>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+4>>2]=c[(c[aD>>2]|0)+(bo<<2)>>2];c[aP+8>>2]=c[n+((d[841+(bg<<2)|0]|0)<<2)>>2];bv=(a5(s,aE)|0)+bo|0;bo=bv-Q|0;bu=bo>>31;bl=bu&bv|bo&~bu;if((c[ae>>2]|0)>>>0<=bl>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[aP+12>>2]=c[(c[aD>>2]|0)+(bl<<2)>>2];c[bn+(ax<<2)>>2]=c[n+((d[842+(bg<<2)|0]|0)<<2)>>2];bu=(a5(s,aE)|0)+bl|0;bl=bu-Q|0;bo=bl>>31;bv=bo&bu|bl&~bo;if((c[ae>>2]|0)>>>0<=bv>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[bn+(aG<<2)>>2]=c[(c[aD>>2]|0)+(bv<<2)>>2];c[bn+(ak<<2)>>2]=c[n+((d[843+(bg<<2)|0]|0)<<2)>>2];bo=(a5(s,aE)|0)+bv|0;bv=bo-Q|0;bl=bv>>31;bu=bl&bo|bv&~bl;if((c[ae>>2]|0)>>>0<=bu>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[bn+(at<<2)>>2]=c[(c[aD>>2]|0)+(bu<<2)>>2];bq=bu}}while(0);bn=aQ+a6|0;if((bn|0)==(a3|0)){a9=bi;ba=bq;bb=bh;break}else{az=bi;aO=bq;aQ=bn;aP=aP+a7|0;bc=bh}}}bc=ay+1|0;if(bc>>>0<V>>>0){_=a9;af=ba;ay=bc;ar=ar+aH|0;av=bb}else{aX=a9;aY=ba;a$=bb;break}}}av=Y+1|0;if(av>>>0<aw>>>0){am=aX;as=aY;Y=av;ag=a$}else{break}}break};case 2:case 3:case 5:case 6:case 4:{ag=c[aK>>2]|0;Y=c[ae>>2]|0;as=c[aC>>2]|0;am=(d[aU+63|0]|0)<<8|(d[aU+64|0]|0);aw=a[aU+17|0]|0;aH=aw&255;if(aw<<24>>24==0){break L663}aw=(V|0)==0;at=V-1|0;Q=(T&1|0)==0;ak=aW<<1;aG=(U&1|0)==0;ax=X-1|0;ap=ax<<5;aq=0;an=0;S=0;aJ=0;aA=0;$=1;while(1){if(aw){bx=aq;by=an;bz=S;bA=aJ;bB=$}else{R=aq;av=an;ar=S;ay=aJ;af=0;_=c[B+(aA<<2)>>2]|0;bc=$;while(1){if((af&1|0)==0){bC=0;bD=X;bE=1;bF=32;bG=_}else{bC=ax;bD=-1;bE=-1;bF=-32;bG=_+ap|0}aP=Q|(af|0)!=(at|0);if((bC|0)==(bD|0)){bH=R;bI=av;bJ=ar;bK=ay;bL=bc}else{aQ=R;aO=av;az=ar;aI=ay;aB=bC;bn=bG;bg=bc;while(1){if((bg|0)==1){bM=a5(s,aL)|0|512}else{bM=bg}bk=bM&7;bu=d[832+bk|0]|0;bl=(aB|0)!=(ax|0);bv=az;bo=0;do{bm=(a5(s,ai)|0)+bv|0;bp=bm-as|0;bt=bp>>31;bv=bt&bm|bp&~bt;if((c[aC>>2]|0)>>>0<=bv>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[m+(bo<<2)>>2]=e[(c[aj>>2]|0)+(bv<<1)>>1]|0;bo=bo+1|0;}while(bo>>>0<bu>>>0);bo=bM>>>3;bh=aQ;bi=0;do{bt=(a5(s,u)|0)+bh|0;bp=bt-ag|0;bm=bp>>31;bh=bm&bt|bp&~bm;if((c[aK>>2]|0)>>>0<=bh>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(bi<<2)>>2]=c[(c[t>>2]|0)+(bh<<2)>>2];bi=bi+1|0;}while(bi>>>0<bu>>>0);bu=aG|bl;bi=aO;bm=aI;bp=bn;bt=0;while(1){bN=(bt|0)==0|aP;bO=bt<<1;bP=bi;bQ=bm;bR=bp;bS=0;while(1){bT=(a5(s,ao)|0)+bQ|0;bU=bT-am|0;bV=bU>>31;bW=bV&bT|bU&~bV;bV=(a5(s,aE)|0)+bP|0;bU=bV-Y|0;bT=bU>>31;bX=bT&bV|bU&~bT;if(((bS|0)==0|bu)&bN){bT=d[bS+bO+(840+(bk<<2))|0]|0;bU=bW*3|0;if((c[x>>2]|0)>>>0<=bU>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}bV=c[ah>>2]|0;c[bR>>2]=(e[bV+(bU<<1)>>1]|0)<<16|c[m+(bT<<2)>>2];c[bR+4>>2]=(e[bV+(bU+2<<1)>>1]|0)<<16|(e[bV+(bU+1<<1)>>1]|0);c[bR+8>>2]=c[n+(bT<<2)>>2];if((c[ae>>2]|0)>>>0<=bX>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[bR+12>>2]=c[(c[aD>>2]|0)+(bX<<2)>>2]}bT=bS+1|0;if(bT>>>0<2){bP=bX;bQ=bW;bR=bR+16|0;bS=bT}else{break}}bS=bt+1|0;if(bS>>>0<2){bi=bX;bm=bW;bp=bp+aW|0;bt=bS}else{break}}bt=aB+bE|0;if((bt|0)==(bD|0)){bH=bh;bI=bX;bJ=bv;bK=bW;bL=bo;break}else{aQ=bh;aO=bX;az=bv;aI=bW;aB=bt;bn=bn+bF|0;bg=bo}}}bg=af+1|0;if(bg>>>0<V>>>0){R=bH;av=bI;ar=bJ;ay=bK;af=bg;_=_+ak|0;bc=bL}else{bx=bH;by=bI;bz=bJ;bA=bK;bB=bL;break}}}bc=aA+1|0;if(bc>>>0<aH>>>0){aq=bx;an=by;S=bz;aJ=bA;aA=bc;$=bB}else{break}}break};case 9:{$=c[aC>>2]|0;aA=(d[aU+63|0]|0)<<8|(d[aU+64|0]|0);aJ=a[aU+17|0]|0;S=aJ&255;if(aJ<<24>>24==0){break L663}aJ=(V|0)==0;an=V-1|0;aq=(T&1|0)==0;aH=aW<<1;ak=X-1|0;Y=ak<<4;am=(U&1|0)!=0;aG=0;ag=0;as=0;ax=1;while(1){if(aJ){bY=aG;bZ=ag;b_=ax}else{at=aG;Q=ag;ap=0;aw=c[B+(as<<2)>>2]|0;bc=ax;while(1){if((ap&1|0)==0){b$=0;b0=X;b1=1;b2=16;b3=aw}else{b$=ak;b0=-1;b1=-1;b2=-16;b3=aw+Y|0}_=aq|(ap|0)!=(an|0);if((b$|0)==(b0|0)){b4=at;b5=Q;b6=bc}else{af=at;ay=Q;ar=b3;av=b$;R=bc;while(1){if((R|0)==1){b7=a5(s,aL)|0|512}else{b7=R}bg=b7&7;bn=d[832+bg|0]|0;aB=af;aI=0;do{az=(a5(s,ai)|0)+aB|0;aO=az-$|0;aQ=aO>>31;aB=aQ&az|aO&~aQ;if((c[aC>>2]|0)>>>0<=aB>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(aI<<2)>>2]=e[(c[aj>>2]|0)+(aB<<1)>>1]|0;aI=aI+1|0;}while(aI>>>0<bn>>>0);bn=(av|0)==(ak|0)&am;aI=ay;bo=ar;bv=0;while(1){bh=bo;aQ=(bv|0)==0|_;aO=bv<<1;az=(a5(s,ao)|0)+aI|0;aP=az-aA|0;bt=aP>>31;bp=bt&az|aP&~bt;if(aQ){bt=d[840+(bg<<2)+aO|0]|0;aP=bp*3|0;if((c[x>>2]|0)>>>0<=aP>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}az=c[ah>>2]|0;c[bh>>2]=(e[az+(aP<<1)>>1]|0)<<16|c[n+(bt<<2)>>2];c[bo+4>>2]=(e[az+(aP+2<<1)>>1]|0)<<16|(e[az+(aP+1<<1)>>1]|0)}aP=bo+8|0;az=(a5(s,ao)|0)+bp|0;bp=az-aA|0;bt=bp>>31;b8=bt&az|bp&~bt;if(!(bn|aQ^1)){aQ=d[(aO|1)+(840+(bg<<2))|0]|0;aO=b8*3|0;if((c[x>>2]|0)>>>0<=aO>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}bt=c[ah>>2]|0;c[aP>>2]=(e[bt+(aO<<1)>>1]|0)<<16|c[n+(aQ<<2)>>2];c[bo+12>>2]=(e[bt+(aO+2<<1)>>1]|0)<<16|(e[bt+(aO+1<<1)>>1]|0)}aO=bv+1|0;if(aO>>>0<2){aI=b8;bo=bo+aW|0;bv=aO}else{break}}bv=b7>>>3;bo=av+b1|0;if((bo|0)==(b0|0)){b4=aB;b5=b8;b6=bv;break}else{af=aB;ay=b8;ar=ar+b2|0;av=bo;R=bv}}}R=ap+1|0;if(R>>>0<V>>>0){at=b4;Q=b5;ap=R;aw=aw+aH|0;bc=b6}else{bY=b4;bZ=b5;b_=b6;break}}}bc=as+1|0;if(bc>>>0<S>>>0){aG=bY;ag=bZ;as=bc;ax=b_}else{break}}break};case 7:case 8:{ax=c[aC>>2]|0;as=(d[aU+63|0]|0)<<8|(d[aU+64|0]|0);ag=a[aU+17|0]|0;aG=ag&255;if(ag<<24>>24==0){break L663}ag=(V|0)==0;S=V-1|0;aH=(T&1|0)==0;aA=aW<<1;am=(U&1|0)==0;ak=X-1|0;$=ak<<5;an=0;aq=0;Y=0;aJ=0;bc=0;aw=1;while(1){if(ag){b9=an;ca=aq;cb=Y;cc=aJ;cd=aw}else{ap=an;Q=aq;at=Y;R=aJ;av=0;ar=c[B+(bc<<2)>>2]|0;ay=aw;while(1){if((av&1|0)==0){ce=0;cf=X;cg=1;ch=32;ci=ar}else{ce=ak;cf=-1;cg=-1;ch=-32;ci=ar+$|0}af=aH|(av|0)!=(S|0);if((ce|0)==(cf|0)){cj=ap;ck=Q;cl=at;cm=R;cn=ay}else{_=ap;bv=Q;bo=at;aI=R;bg=ce;bn=ci;aO=ay;while(1){if((aO|0)==1){co=a5(s,aL)|0|512}else{co=aO}bt=co&7;aQ=d[832+bt|0]|0;aP=(bg|0)!=(ak|0);bp=_;az=0;do{bh=(a5(s,ai)|0)+bp|0;bm=bh-ax|0;bi=bm>>31;bp=bi&bh|bm&~bi;if((c[aC>>2]|0)>>>0<=bp>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[n+(az<<2)>>2]=e[(c[aj>>2]|0)+(bp<<1)>>1]|0;az=az+1|0;}while(az>>>0<aQ>>>0);az=co>>>3;aB=bo;bi=0;do{bm=(a5(s,ai)|0)+aB|0;bh=bm-ax|0;bk=bh>>31;aB=bk&bm|bh&~bk;if((c[aC>>2]|0)>>>0<=aB>>>0){au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K}c[m+(bi<<2)>>2]=e[(c[aj>>2]|0)+(aB<<1)>>1]|0;bi=bi+1|0;}while(bi>>>0<aQ>>>0);aQ=am|aP;bi=bv;bk=aI;bh=bn;bm=0;while(1){bu=(bm|0)==0|af;bl=bm<<1;bS=bi;bR=bk;bQ=bh;bP=0;while(1){bO=(a5(s,ao)|0)+bS|0;bN=bO-as|0;bT=bN>>31;cp=bT&bO|bN&~bT;bT=(a5(s,ao)|0)+bR|0;bN=bT-as|0;bO=bN>>31;cq=bO&bT|bN&~bO;if(((bP|0)==0|aQ)&bu){bO=d[bP+bl+(840+(bt<<2))|0]|0;bN=cp*3|0;bT=c[x>>2]|0;if(bT>>>0>bN>>>0){cr=bT}else{au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;cr=c[x>>2]|0}bT=c[ah>>2]|0;bU=cq*3|0;if(cr>>>0>bU>>>0){cs=bT}else{au(aF|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=904,c[K+16>>2]=312,K)|0)|0;i=K;al(aF|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;cs=c[ah>>2]|0}c[bQ>>2]=(e[bT+(bN<<1)>>1]|0)<<16|c[n+(bO<<2)>>2];c[bQ+4>>2]=(e[bT+(bN+2<<1)>>1]|0)<<16|(e[bT+(bN+1<<1)>>1]|0);c[bQ+8>>2]=(e[cs+(bU<<1)>>1]|0)<<16|c[m+(bO<<2)>>2];c[bQ+12>>2]=(e[cs+(bU+2<<1)>>1]|0)<<16|(e[cs+(bU+1<<1)>>1]|0)}bU=bP+1|0;if(bU>>>0<2){bS=cp;bR=cq;bQ=bQ+16|0;bP=bU}else{break}}bP=bm+1|0;if(bP>>>0<2){bi=cp;bk=cq;bh=bh+aW|0;bm=bP}else{break}}bm=bg+cg|0;if((bm|0)==(cf|0)){cj=bp;ck=cp;cl=aB;cm=cq;cn=az;break}else{_=bp;bv=cp;bo=aB;aI=cq;bg=bm;bn=bn+ch|0;aO=az}}}aO=av+1|0;if(aO>>>0<V>>>0){ap=cj;Q=ck;at=cl;R=cm;av=aO;ar=ar+aA|0;ay=cn}else{b9=cj;ca=ck;cb=cl;cc=cm;cd=cn;break}}}ay=bc+1|0;if(ay>>>0<aG>>>0){an=b9;aq=ca;Y=cb;aJ=cc;bc=ay;aw=cd}else{break}}break};default:{break L663}}}}while(0);aS=c[G>>2]|0}}while(0);g=aS+O|0;c[G>>2]=g;U=ac+1|0;if(U>>>0<r>>>0){ac=U;ab=ab>>>1;aa=aa>>>1;f=g}else{break}}}}while(0);if((L|0)==0){i=j;return}if((c[L>>2]|0)!=519686845){i=j;return}bd(L);if((L&7|0)==0){bf(L);i=j;return}else{L=z|0;au(L|0,768,(K=i,i=i+24|0,c[K>>2]=472,c[K+8>>2]=2500,c[K+16>>2]=576,K)|0)|0;i=K;al(L|0,(K=i,i=i+1|0,i=i+7&-8,c[K>>2]=0,K)|0)|0;i=K;i=j;return}}function bd(b){b=b|0;var d=0,e=0,f=0,g=0,h=0;d=i;i=i+512|0;e=d|0;c[b>>2]=0;f=b+284|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+288>>2]=0;c[b+292>>2]=0}a[b+296|0]=0;f=b+268|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+272>>2]=0;c[b+276>>2]=0}a[b+280|0]=0;f=b+252|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+256>>2]=0;c[b+260>>2]=0}a[b+264|0]=0;f=b+236|0;g=c[f>>2]|0;if((g|0)!=0){if((g&7|0)==0){bf(g)}else{g=e|0;au(g|0,768,(h=i,i=i+24|0,c[h>>2]=472,c[h+8>>2]=2500,c[h+16>>2]=576,h)|0)|0;i=h;al(g|0,(h=i,i=i+1|0,i=i+7&-8,c[h>>2]=0,h)|0)|0;i=h}c[f>>2]=0;c[b+240>>2]=0;c[b+244>>2]=0}a[b+248|0]=0;a1(b+212|0);a1(b+188|0);a1(b+164|0);a1(b+140|0);a1(b+116|0);i=d;return}function be(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0,P=0,Q=0,R=0,S=0,T=0,U=0,V=0,W=0,X=0,Y=0,Z=0,_=0,$=0,aa=0,ab=0,ac=0,ad=0,ae=0,af=0,ag=0,ah=0,ai=0,ak=0,al=0,am=0,an=0,ap=0,aq=0,ar=0,as=0,at=0,au=0,av=0,aw=0,ax=0,aA=0,aB=0,aD=0,aE=0,aF=0,aG=0,aH=0,aI=0,aJ=0,aK=0,aL=0;do{if(a>>>0<245){if(a>>>0<11){b=16}else{b=a+11&-8}d=b>>>3;e=c[228]|0;f=e>>>(d>>>0);if((f&3|0)!=0){g=(f&1^1)+d|0;h=g<<1;i=952+(h<<2)|0;j=952+(h+2<<2)|0;h=c[j>>2]|0;k=h+8|0;l=c[k>>2]|0;do{if((i|0)==(l|0)){c[228]=e&~(1<<g)}else{if(l>>>0<(c[232]|0)>>>0){aj();return 0}m=l+12|0;if((c[m>>2]|0)==(h|0)){c[m>>2]=i;c[j>>2]=l;break}else{aj();return 0}}}while(0);l=g<<3;c[h+4>>2]=l|3;j=h+(l|4)|0;c[j>>2]=c[j>>2]|1;n=k;return n|0}if(b>>>0<=(c[230]|0)>>>0){o=b;break}if((f|0)!=0){j=2<<d;l=f<<d&(j|-j);j=(l&-l)-1|0;l=j>>>12&16;i=j>>>(l>>>0);j=i>>>5&8;m=i>>>(j>>>0);i=m>>>2&4;p=m>>>(i>>>0);m=p>>>1&2;q=p>>>(m>>>0);p=q>>>1&1;r=(j|l|i|m|p)+(q>>>(p>>>0))|0;p=r<<1;q=952+(p<<2)|0;m=952+(p+2<<2)|0;p=c[m>>2]|0;i=p+8|0;l=c[i>>2]|0;do{if((q|0)==(l|0)){c[228]=e&~(1<<r)}else{if(l>>>0<(c[232]|0)>>>0){aj();return 0}j=l+12|0;if((c[j>>2]|0)==(p|0)){c[j>>2]=q;c[m>>2]=l;break}else{aj();return 0}}}while(0);l=r<<3;m=l-b|0;c[p+4>>2]=b|3;q=p;e=q+b|0;c[q+(b|4)>>2]=m|1;c[q+l>>2]=m;l=c[230]|0;if((l|0)!=0){q=c[233]|0;d=l>>>3;l=d<<1;f=952+(l<<2)|0;k=c[228]|0;h=1<<d;do{if((k&h|0)==0){c[228]=k|h;s=f;t=952+(l+2<<2)|0}else{d=952+(l+2<<2)|0;g=c[d>>2]|0;if(g>>>0>=(c[232]|0)>>>0){s=g;t=d;break}aj();return 0}}while(0);c[t>>2]=q;c[s+12>>2]=q;c[q+8>>2]=s;c[q+12>>2]=f}c[230]=m;c[233]=e;n=i;return n|0}l=c[229]|0;if((l|0)==0){o=b;break}h=(l&-l)-1|0;l=h>>>12&16;k=h>>>(l>>>0);h=k>>>5&8;p=k>>>(h>>>0);k=p>>>2&4;r=p>>>(k>>>0);p=r>>>1&2;d=r>>>(p>>>0);r=d>>>1&1;g=c[1216+((h|l|k|p|r)+(d>>>(r>>>0))<<2)>>2]|0;r=g;d=g;p=(c[g+4>>2]&-8)-b|0;while(1){g=c[r+16>>2]|0;if((g|0)==0){k=c[r+20>>2]|0;if((k|0)==0){break}else{u=k}}else{u=g}g=(c[u+4>>2]&-8)-b|0;k=g>>>0<p>>>0;r=u;d=k?u:d;p=k?g:p}r=d;i=c[232]|0;if(r>>>0<i>>>0){aj();return 0}e=r+b|0;m=e;if(r>>>0>=e>>>0){aj();return 0}e=c[d+24>>2]|0;f=c[d+12>>2]|0;do{if((f|0)==(d|0)){q=d+20|0;g=c[q>>2]|0;if((g|0)==0){k=d+16|0;l=c[k>>2]|0;if((l|0)==0){v=0;break}else{w=l;x=k}}else{w=g;x=q}while(1){q=w+20|0;g=c[q>>2]|0;if((g|0)!=0){w=g;x=q;continue}q=w+16|0;g=c[q>>2]|0;if((g|0)==0){break}else{w=g;x=q}}if(x>>>0<i>>>0){aj();return 0}else{c[x>>2]=0;v=w;break}}else{q=c[d+8>>2]|0;if(q>>>0<i>>>0){aj();return 0}g=q+12|0;if((c[g>>2]|0)!=(d|0)){aj();return 0}k=f+8|0;if((c[k>>2]|0)==(d|0)){c[g>>2]=f;c[k>>2]=q;v=f;break}else{aj();return 0}}}while(0);L990:do{if((e|0)!=0){f=d+28|0;i=1216+(c[f>>2]<<2)|0;do{if((d|0)==(c[i>>2]|0)){c[i>>2]=v;if((v|0)!=0){break}c[229]=c[229]&~(1<<c[f>>2]);break L990}else{if(e>>>0<(c[232]|0)>>>0){aj();return 0}q=e+16|0;if((c[q>>2]|0)==(d|0)){c[q>>2]=v}else{c[e+20>>2]=v}if((v|0)==0){break L990}}}while(0);if(v>>>0<(c[232]|0)>>>0){aj();return 0}c[v+24>>2]=e;f=c[d+16>>2]|0;do{if((f|0)!=0){if(f>>>0<(c[232]|0)>>>0){aj();return 0}else{c[v+16>>2]=f;c[f+24>>2]=v;break}}}while(0);f=c[d+20>>2]|0;if((f|0)==0){break}if(f>>>0<(c[232]|0)>>>0){aj();return 0}else{c[v+20>>2]=f;c[f+24>>2]=v;break}}}while(0);if(p>>>0<16){e=p+b|0;c[d+4>>2]=e|3;f=r+(e+4)|0;c[f>>2]=c[f>>2]|1}else{c[d+4>>2]=b|3;c[r+(b|4)>>2]=p|1;c[r+(p+b)>>2]=p;f=c[230]|0;if((f|0)!=0){e=c[233]|0;i=f>>>3;f=i<<1;q=952+(f<<2)|0;k=c[228]|0;g=1<<i;do{if((k&g|0)==0){c[228]=k|g;y=q;z=952+(f+2<<2)|0}else{i=952+(f+2<<2)|0;l=c[i>>2]|0;if(l>>>0>=(c[232]|0)>>>0){y=l;z=i;break}aj();return 0}}while(0);c[z>>2]=e;c[y+12>>2]=e;c[e+8>>2]=y;c[e+12>>2]=q}c[230]=p;c[233]=m}f=d+8|0;if((f|0)==0){o=b;break}else{n=f}return n|0}else{if(a>>>0>4294967231){o=-1;break}f=a+11|0;g=f&-8;k=c[229]|0;if((k|0)==0){o=g;break}r=-g|0;i=f>>>8;do{if((i|0)==0){A=0}else{if(g>>>0>16777215){A=31;break}f=(i+1048320|0)>>>16&8;l=i<<f;h=(l+520192|0)>>>16&4;j=l<<h;l=(j+245760|0)>>>16&2;B=14-(h|f|l)+(j<<l>>>15)|0;A=g>>>((B+7|0)>>>0)&1|B<<1}}while(0);i=c[1216+(A<<2)>>2]|0;L1038:do{if((i|0)==0){C=0;D=r;E=0}else{if((A|0)==31){F=0}else{F=25-(A>>>1)|0}d=0;m=r;p=i;q=g<<F;e=0;while(1){B=c[p+4>>2]&-8;l=B-g|0;if(l>>>0<m>>>0){if((B|0)==(g|0)){C=p;D=l;E=p;break L1038}else{G=p;H=l}}else{G=d;H=m}l=c[p+20>>2]|0;B=c[p+16+(q>>>31<<2)>>2]|0;j=(l|0)==0|(l|0)==(B|0)?e:l;if((B|0)==0){C=G;D=H;E=j;break}else{d=G;m=H;p=B;q=q<<1;e=j}}}}while(0);if((E|0)==0&(C|0)==0){i=2<<A;r=(i|-i)&k;if((r|0)==0){o=g;break}i=(r&-r)-1|0;r=i>>>12&16;e=i>>>(r>>>0);i=e>>>5&8;q=e>>>(i>>>0);e=q>>>2&4;p=q>>>(e>>>0);q=p>>>1&2;m=p>>>(q>>>0);p=m>>>1&1;I=c[1216+((i|r|e|q|p)+(m>>>(p>>>0))<<2)>>2]|0}else{I=E}if((I|0)==0){J=D;K=C}else{p=I;m=D;q=C;while(1){e=(c[p+4>>2]&-8)-g|0;r=e>>>0<m>>>0;i=r?e:m;e=r?p:q;r=c[p+16>>2]|0;if((r|0)!=0){p=r;m=i;q=e;continue}r=c[p+20>>2]|0;if((r|0)==0){J=i;K=e;break}else{p=r;m=i;q=e}}}if((K|0)==0){o=g;break}if(J>>>0>=((c[230]|0)-g|0)>>>0){o=g;break}q=K;m=c[232]|0;if(q>>>0<m>>>0){aj();return 0}p=q+g|0;k=p;if(q>>>0>=p>>>0){aj();return 0}e=c[K+24>>2]|0;i=c[K+12>>2]|0;do{if((i|0)==(K|0)){r=K+20|0;d=c[r>>2]|0;if((d|0)==0){j=K+16|0;B=c[j>>2]|0;if((B|0)==0){L=0;break}else{M=B;N=j}}else{M=d;N=r}while(1){r=M+20|0;d=c[r>>2]|0;if((d|0)!=0){M=d;N=r;continue}r=M+16|0;d=c[r>>2]|0;if((d|0)==0){break}else{M=d;N=r}}if(N>>>0<m>>>0){aj();return 0}else{c[N>>2]=0;L=M;break}}else{r=c[K+8>>2]|0;if(r>>>0<m>>>0){aj();return 0}d=r+12|0;if((c[d>>2]|0)!=(K|0)){aj();return 0}j=i+8|0;if((c[j>>2]|0)==(K|0)){c[d>>2]=i;c[j>>2]=r;L=i;break}else{aj();return 0}}}while(0);L1088:do{if((e|0)!=0){i=K+28|0;m=1216+(c[i>>2]<<2)|0;do{if((K|0)==(c[m>>2]|0)){c[m>>2]=L;if((L|0)!=0){break}c[229]=c[229]&~(1<<c[i>>2]);break L1088}else{if(e>>>0<(c[232]|0)>>>0){aj();return 0}r=e+16|0;if((c[r>>2]|0)==(K|0)){c[r>>2]=L}else{c[e+20>>2]=L}if((L|0)==0){break L1088}}}while(0);if(L>>>0<(c[232]|0)>>>0){aj();return 0}c[L+24>>2]=e;i=c[K+16>>2]|0;do{if((i|0)!=0){if(i>>>0<(c[232]|0)>>>0){aj();return 0}else{c[L+16>>2]=i;c[i+24>>2]=L;break}}}while(0);i=c[K+20>>2]|0;if((i|0)==0){break}if(i>>>0<(c[232]|0)>>>0){aj();return 0}else{c[L+20>>2]=i;c[i+24>>2]=L;break}}}while(0);do{if(J>>>0<16){e=J+g|0;c[K+4>>2]=e|3;i=q+(e+4)|0;c[i>>2]=c[i>>2]|1}else{c[K+4>>2]=g|3;c[q+(g|4)>>2]=J|1;c[q+(J+g)>>2]=J;i=J>>>3;if(J>>>0<256){e=i<<1;m=952+(e<<2)|0;r=c[228]|0;j=1<<i;do{if((r&j|0)==0){c[228]=r|j;O=m;P=952+(e+2<<2)|0}else{i=952+(e+2<<2)|0;d=c[i>>2]|0;if(d>>>0>=(c[232]|0)>>>0){O=d;P=i;break}aj();return 0}}while(0);c[P>>2]=k;c[O+12>>2]=k;c[q+(g+8)>>2]=O;c[q+(g+12)>>2]=m;break}e=p;j=J>>>8;do{if((j|0)==0){Q=0}else{if(J>>>0>16777215){Q=31;break}r=(j+1048320|0)>>>16&8;i=j<<r;d=(i+520192|0)>>>16&4;B=i<<d;i=(B+245760|0)>>>16&2;l=14-(d|r|i)+(B<<i>>>15)|0;Q=J>>>((l+7|0)>>>0)&1|l<<1}}while(0);j=1216+(Q<<2)|0;c[q+(g+28)>>2]=Q;c[q+(g+20)>>2]=0;c[q+(g+16)>>2]=0;m=c[229]|0;l=1<<Q;if((m&l|0)==0){c[229]=m|l;c[j>>2]=e;c[q+(g+24)>>2]=j;c[q+(g+12)>>2]=e;c[q+(g+8)>>2]=e;break}if((Q|0)==31){R=0}else{R=25-(Q>>>1)|0}l=J<<R;m=c[j>>2]|0;while(1){if((c[m+4>>2]&-8|0)==(J|0)){break}S=m+16+(l>>>31<<2)|0;j=c[S>>2]|0;if((j|0)==0){T=829;break}else{l=l<<1;m=j}}if((T|0)==829){if(S>>>0<(c[232]|0)>>>0){aj();return 0}else{c[S>>2]=e;c[q+(g+24)>>2]=m;c[q+(g+12)>>2]=e;c[q+(g+8)>>2]=e;break}}l=m+8|0;j=c[l>>2]|0;i=c[232]|0;if(m>>>0<i>>>0){aj();return 0}if(j>>>0<i>>>0){aj();return 0}else{c[j+12>>2]=e;c[l>>2]=e;c[q+(g+8)>>2]=j;c[q+(g+12)>>2]=m;c[q+(g+24)>>2]=0;break}}}while(0);q=K+8|0;if((q|0)==0){o=g;break}else{n=q}return n|0}}while(0);K=c[230]|0;if(o>>>0<=K>>>0){S=K-o|0;J=c[233]|0;if(S>>>0>15){R=J;c[233]=R+o;c[230]=S;c[R+(o+4)>>2]=S|1;c[R+K>>2]=S;c[J+4>>2]=o|3}else{c[230]=0;c[233]=0;c[J+4>>2]=K|3;S=J+(K+4)|0;c[S>>2]=c[S>>2]|1}n=J+8|0;return n|0}J=c[231]|0;if(o>>>0<J>>>0){S=J-o|0;c[231]=S;J=c[234]|0;K=J;c[234]=K+o;c[K+(o+4)>>2]=S|1;c[J+4>>2]=o|3;n=J+8|0;return n|0}do{if((c[222]|0)==0){J=ao(30)|0;if((J-1&J|0)==0){c[224]=J;c[223]=J;c[225]=-1;c[226]=-1;c[227]=0;c[339]=0;c[222]=(aC(0)|0)&-16^1431655768;break}else{aj();return 0}}}while(0);J=o+48|0;S=c[224]|0;K=o+47|0;R=S+K|0;Q=-S|0;S=R&Q;if(S>>>0<=o>>>0){n=0;return n|0}O=c[338]|0;do{if((O|0)!=0){P=c[336]|0;L=P+S|0;if(L>>>0<=P>>>0|L>>>0>O>>>0){n=0}else{break}return n|0}}while(0);L1180:do{if((c[339]&4|0)==0){O=c[234]|0;L1182:do{if((O|0)==0){T=859}else{L=O;P=1360;while(1){U=P|0;M=c[U>>2]|0;if(M>>>0<=L>>>0){V=P+4|0;if((M+(c[V>>2]|0)|0)>>>0>L>>>0){break}}M=c[P+8>>2]|0;if((M|0)==0){T=859;break L1182}else{P=M}}if((P|0)==0){T=859;break}L=R-(c[231]|0)&Q;if(L>>>0>=2147483647){W=0;break}m=ay(L|0)|0;e=(m|0)==((c[U>>2]|0)+(c[V>>2]|0)|0);X=e?m:-1;Y=e?L:0;Z=m;_=L;T=868}}while(0);do{if((T|0)==859){O=ay(0)|0;if((O|0)==-1){W=0;break}g=O;L=c[223]|0;m=L-1|0;if((m&g|0)==0){$=S}else{$=S-g+(m+g&-L)|0}L=c[336]|0;g=L+$|0;if(!($>>>0>o>>>0&$>>>0<2147483647)){W=0;break}m=c[338]|0;if((m|0)!=0){if(g>>>0<=L>>>0|g>>>0>m>>>0){W=0;break}}m=ay($|0)|0;g=(m|0)==(O|0);X=g?O:-1;Y=g?$:0;Z=m;_=$;T=868}}while(0);L1202:do{if((T|0)==868){m=-_|0;if((X|0)!=-1){aa=Y;ab=X;T=879;break L1180}do{if((Z|0)!=-1&_>>>0<2147483647&_>>>0<J>>>0){g=c[224]|0;O=K-_+g&-g;if(O>>>0>=2147483647){ac=_;break}if((ay(O|0)|0)==-1){ay(m|0)|0;W=Y;break L1202}else{ac=O+_|0;break}}else{ac=_}}while(0);if((Z|0)==-1){W=Y}else{aa=ac;ab=Z;T=879;break L1180}}}while(0);c[339]=c[339]|4;ad=W;T=876}else{ad=0;T=876}}while(0);do{if((T|0)==876){if(S>>>0>=2147483647){break}W=ay(S|0)|0;Z=ay(0)|0;if(!((Z|0)!=-1&(W|0)!=-1&W>>>0<Z>>>0)){break}ac=Z-W|0;Z=ac>>>0>(o+40|0)>>>0;Y=Z?W:-1;if((Y|0)!=-1){aa=Z?ac:ad;ab=Y;T=879}}}while(0);do{if((T|0)==879){ad=(c[336]|0)+aa|0;c[336]=ad;if(ad>>>0>(c[337]|0)>>>0){c[337]=ad}ad=c[234]|0;L1222:do{if((ad|0)==0){S=c[232]|0;if((S|0)==0|ab>>>0<S>>>0){c[232]=ab}c[340]=ab;c[341]=aa;c[343]=0;c[237]=c[222];c[236]=-1;S=0;do{Y=S<<1;ac=952+(Y<<2)|0;c[952+(Y+3<<2)>>2]=ac;c[952+(Y+2<<2)>>2]=ac;S=S+1|0;}while(S>>>0<32);S=ab+8|0;if((S&7|0)==0){ae=0}else{ae=-S&7}S=aa-40-ae|0;c[234]=ab+ae;c[231]=S;c[ab+(ae+4)>>2]=S|1;c[ab+(aa-36)>>2]=40;c[235]=c[226]}else{S=1360;while(1){af=c[S>>2]|0;ag=S+4|0;ah=c[ag>>2]|0;if((ab|0)==(af+ah|0)){T=891;break}ac=c[S+8>>2]|0;if((ac|0)==0){break}else{S=ac}}do{if((T|0)==891){if((c[S+12>>2]&8|0)!=0){break}ac=ad;if(!(ac>>>0>=af>>>0&ac>>>0<ab>>>0)){break}c[ag>>2]=ah+aa;ac=c[234]|0;Y=(c[231]|0)+aa|0;Z=ac;W=ac+8|0;if((W&7|0)==0){ai=0}else{ai=-W&7}W=Y-ai|0;c[234]=Z+ai;c[231]=W;c[Z+(ai+4)>>2]=W|1;c[Z+(Y+4)>>2]=40;c[235]=c[226];break L1222}}while(0);if(ab>>>0<(c[232]|0)>>>0){c[232]=ab}S=ab+aa|0;Y=1360;while(1){ak=Y|0;if((c[ak>>2]|0)==(S|0)){T=901;break}Z=c[Y+8>>2]|0;if((Z|0)==0){break}else{Y=Z}}do{if((T|0)==901){if((c[Y+12>>2]&8|0)!=0){break}c[ak>>2]=ab;S=Y+4|0;c[S>>2]=(c[S>>2]|0)+aa;S=ab+8|0;if((S&7|0)==0){al=0}else{al=-S&7}S=ab+(aa+8)|0;if((S&7|0)==0){am=0}else{am=-S&7}S=ab+(am+aa)|0;Z=S;W=al+o|0;ac=ab+W|0;_=ac;K=S-(ab+al)-o|0;c[ab+(al+4)>>2]=o|3;do{if((Z|0)==(c[234]|0)){J=(c[231]|0)+K|0;c[231]=J;c[234]=_;c[ab+(W+4)>>2]=J|1}else{if((Z|0)==(c[233]|0)){J=(c[230]|0)+K|0;c[230]=J;c[233]=_;c[ab+(W+4)>>2]=J|1;c[ab+(J+W)>>2]=J;break}J=aa+4|0;X=c[ab+(am+J)>>2]|0;if((X&3|0)==1){$=X&-8;V=X>>>3;L1267:do{if(X>>>0<256){U=c[ab+((am|8)+aa)>>2]|0;Q=c[ab+(aa+12+am)>>2]|0;R=952+(V<<1<<2)|0;do{if((U|0)!=(R|0)){if(U>>>0<(c[232]|0)>>>0){aj();return 0}if((c[U+12>>2]|0)==(Z|0)){break}aj();return 0}}while(0);if((Q|0)==(U|0)){c[228]=c[228]&~(1<<V);break}do{if((Q|0)==(R|0)){an=Q+8|0}else{if(Q>>>0<(c[232]|0)>>>0){aj();return 0}m=Q+8|0;if((c[m>>2]|0)==(Z|0)){an=m;break}aj();return 0}}while(0);c[U+12>>2]=Q;c[an>>2]=U}else{R=S;m=c[ab+((am|24)+aa)>>2]|0;P=c[ab+(aa+12+am)>>2]|0;do{if((P|0)==(R|0)){O=am|16;g=ab+(O+J)|0;L=c[g>>2]|0;if((L|0)==0){e=ab+(O+aa)|0;O=c[e>>2]|0;if((O|0)==0){ap=0;break}else{aq=O;ar=e}}else{aq=L;ar=g}while(1){g=aq+20|0;L=c[g>>2]|0;if((L|0)!=0){aq=L;ar=g;continue}g=aq+16|0;L=c[g>>2]|0;if((L|0)==0){break}else{aq=L;ar=g}}if(ar>>>0<(c[232]|0)>>>0){aj();return 0}else{c[ar>>2]=0;ap=aq;break}}else{g=c[ab+((am|8)+aa)>>2]|0;if(g>>>0<(c[232]|0)>>>0){aj();return 0}L=g+12|0;if((c[L>>2]|0)!=(R|0)){aj();return 0}e=P+8|0;if((c[e>>2]|0)==(R|0)){c[L>>2]=P;c[e>>2]=g;ap=P;break}else{aj();return 0}}}while(0);if((m|0)==0){break}P=ab+(aa+28+am)|0;U=1216+(c[P>>2]<<2)|0;do{if((R|0)==(c[U>>2]|0)){c[U>>2]=ap;if((ap|0)!=0){break}c[229]=c[229]&~(1<<c[P>>2]);break L1267}else{if(m>>>0<(c[232]|0)>>>0){aj();return 0}Q=m+16|0;if((c[Q>>2]|0)==(R|0)){c[Q>>2]=ap}else{c[m+20>>2]=ap}if((ap|0)==0){break L1267}}}while(0);if(ap>>>0<(c[232]|0)>>>0){aj();return 0}c[ap+24>>2]=m;R=am|16;P=c[ab+(R+aa)>>2]|0;do{if((P|0)!=0){if(P>>>0<(c[232]|0)>>>0){aj();return 0}else{c[ap+16>>2]=P;c[P+24>>2]=ap;break}}}while(0);P=c[ab+(R+J)>>2]|0;if((P|0)==0){break}if(P>>>0<(c[232]|0)>>>0){aj();return 0}else{c[ap+20>>2]=P;c[P+24>>2]=ap;break}}}while(0);as=ab+(($|am)+aa)|0;at=$+K|0}else{as=Z;at=K}J=as+4|0;c[J>>2]=c[J>>2]&-2;c[ab+(W+4)>>2]=at|1;c[ab+(at+W)>>2]=at;J=at>>>3;if(at>>>0<256){V=J<<1;X=952+(V<<2)|0;P=c[228]|0;m=1<<J;do{if((P&m|0)==0){c[228]=P|m;au=X;av=952+(V+2<<2)|0}else{J=952+(V+2<<2)|0;U=c[J>>2]|0;if(U>>>0>=(c[232]|0)>>>0){au=U;av=J;break}aj();return 0}}while(0);c[av>>2]=_;c[au+12>>2]=_;c[ab+(W+8)>>2]=au;c[ab+(W+12)>>2]=X;break}V=ac;m=at>>>8;do{if((m|0)==0){aw=0}else{if(at>>>0>16777215){aw=31;break}P=(m+1048320|0)>>>16&8;$=m<<P;J=($+520192|0)>>>16&4;U=$<<J;$=(U+245760|0)>>>16&2;Q=14-(J|P|$)+(U<<$>>>15)|0;aw=at>>>((Q+7|0)>>>0)&1|Q<<1}}while(0);m=1216+(aw<<2)|0;c[ab+(W+28)>>2]=aw;c[ab+(W+20)>>2]=0;c[ab+(W+16)>>2]=0;X=c[229]|0;Q=1<<aw;if((X&Q|0)==0){c[229]=X|Q;c[m>>2]=V;c[ab+(W+24)>>2]=m;c[ab+(W+12)>>2]=V;c[ab+(W+8)>>2]=V;break}if((aw|0)==31){ax=0}else{ax=25-(aw>>>1)|0}Q=at<<ax;X=c[m>>2]|0;while(1){if((c[X+4>>2]&-8|0)==(at|0)){break}aA=X+16+(Q>>>31<<2)|0;m=c[aA>>2]|0;if((m|0)==0){T=974;break}else{Q=Q<<1;X=m}}if((T|0)==974){if(aA>>>0<(c[232]|0)>>>0){aj();return 0}else{c[aA>>2]=V;c[ab+(W+24)>>2]=X;c[ab+(W+12)>>2]=V;c[ab+(W+8)>>2]=V;break}}Q=X+8|0;m=c[Q>>2]|0;$=c[232]|0;if(X>>>0<$>>>0){aj();return 0}if(m>>>0<$>>>0){aj();return 0}else{c[m+12>>2]=V;c[Q>>2]=V;c[ab+(W+8)>>2]=m;c[ab+(W+12)>>2]=X;c[ab+(W+24)>>2]=0;break}}}while(0);n=ab+(al|8)|0;return n|0}}while(0);Y=ad;W=1360;while(1){aB=c[W>>2]|0;if(aB>>>0<=Y>>>0){aD=c[W+4>>2]|0;aE=aB+aD|0;if(aE>>>0>Y>>>0){break}}W=c[W+8>>2]|0}W=aB+(aD-39)|0;if((W&7|0)==0){aF=0}else{aF=-W&7}W=aB+(aD-47+aF)|0;ac=W>>>0<(ad+16|0)>>>0?Y:W;W=ac+8|0;_=ab+8|0;if((_&7|0)==0){aG=0}else{aG=-_&7}_=aa-40-aG|0;c[234]=ab+aG;c[231]=_;c[ab+(aG+4)>>2]=_|1;c[ab+(aa-36)>>2]=40;c[235]=c[226];c[ac+4>>2]=27;c[W>>2]=c[340];c[W+4>>2]=c[341];c[W+8>>2]=c[342];c[W+12>>2]=c[343];c[340]=ab;c[341]=aa;c[343]=0;c[342]=W;W=ac+28|0;c[W>>2]=7;if((ac+32|0)>>>0<aE>>>0){_=W;while(1){W=_+4|0;c[W>>2]=7;if((_+8|0)>>>0<aE>>>0){_=W}else{break}}}if((ac|0)==(Y|0)){break}_=ac-ad|0;W=Y+(_+4)|0;c[W>>2]=c[W>>2]&-2;c[ad+4>>2]=_|1;c[Y+_>>2]=_;W=_>>>3;if(_>>>0<256){K=W<<1;Z=952+(K<<2)|0;S=c[228]|0;m=1<<W;do{if((S&m|0)==0){c[228]=S|m;aH=Z;aI=952+(K+2<<2)|0}else{W=952+(K+2<<2)|0;Q=c[W>>2]|0;if(Q>>>0>=(c[232]|0)>>>0){aH=Q;aI=W;break}aj();return 0}}while(0);c[aI>>2]=ad;c[aH+12>>2]=ad;c[ad+8>>2]=aH;c[ad+12>>2]=Z;break}K=ad;m=_>>>8;do{if((m|0)==0){aJ=0}else{if(_>>>0>16777215){aJ=31;break}S=(m+1048320|0)>>>16&8;Y=m<<S;ac=(Y+520192|0)>>>16&4;W=Y<<ac;Y=(W+245760|0)>>>16&2;Q=14-(ac|S|Y)+(W<<Y>>>15)|0;aJ=_>>>((Q+7|0)>>>0)&1|Q<<1}}while(0);m=1216+(aJ<<2)|0;c[ad+28>>2]=aJ;c[ad+20>>2]=0;c[ad+16>>2]=0;Z=c[229]|0;Q=1<<aJ;if((Z&Q|0)==0){c[229]=Z|Q;c[m>>2]=K;c[ad+24>>2]=m;c[ad+12>>2]=ad;c[ad+8>>2]=ad;break}if((aJ|0)==31){aK=0}else{aK=25-(aJ>>>1)|0}Q=_<<aK;Z=c[m>>2]|0;while(1){if((c[Z+4>>2]&-8|0)==(_|0)){break}aL=Z+16+(Q>>>31<<2)|0;m=c[aL>>2]|0;if((m|0)==0){T=1009;break}else{Q=Q<<1;Z=m}}if((T|0)==1009){if(aL>>>0<(c[232]|0)>>>0){aj();return 0}else{c[aL>>2]=K;c[ad+24>>2]=Z;c[ad+12>>2]=ad;c[ad+8>>2]=ad;break}}Q=Z+8|0;_=c[Q>>2]|0;m=c[232]|0;if(Z>>>0<m>>>0){aj();return 0}if(_>>>0<m>>>0){aj();return 0}else{c[_+12>>2]=K;c[Q>>2]=K;c[ad+8>>2]=_;c[ad+12>>2]=Z;c[ad+24>>2]=0;break}}}while(0);ad=c[231]|0;if(ad>>>0<=o>>>0){break}_=ad-o|0;c[231]=_;ad=c[234]|0;Q=ad;c[234]=Q+o;c[Q+(o+4)>>2]=_|1;c[ad+4>>2]=o|3;n=ad+8|0;return n|0}}while(0);c[(az()|0)>>2]=12;n=0;return n|0}function bf(a){a=a|0;var b=0,d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0,M=0,N=0,O=0;if((a|0)==0){return}b=a-8|0;d=b;e=c[232]|0;if(b>>>0<e>>>0){aj()}f=c[a-4>>2]|0;g=f&3;if((g|0)==1){aj()}h=f&-8;i=a+(h-8)|0;j=i;L1439:do{if((f&1|0)==0){k=c[b>>2]|0;if((g|0)==0){return}l=-8-k|0;m=a+l|0;n=m;o=k+h|0;if(m>>>0<e>>>0){aj()}if((n|0)==(c[233]|0)){p=a+(h-4)|0;if((c[p>>2]&3|0)!=3){q=n;r=o;break}c[230]=o;c[p>>2]=c[p>>2]&-2;c[a+(l+4)>>2]=o|1;c[i>>2]=o;return}p=k>>>3;if(k>>>0<256){k=c[a+(l+8)>>2]|0;s=c[a+(l+12)>>2]|0;t=952+(p<<1<<2)|0;do{if((k|0)!=(t|0)){if(k>>>0<e>>>0){aj()}if((c[k+12>>2]|0)==(n|0)){break}aj()}}while(0);if((s|0)==(k|0)){c[228]=c[228]&~(1<<p);q=n;r=o;break}do{if((s|0)==(t|0)){u=s+8|0}else{if(s>>>0<e>>>0){aj()}v=s+8|0;if((c[v>>2]|0)==(n|0)){u=v;break}aj()}}while(0);c[k+12>>2]=s;c[u>>2]=k;q=n;r=o;break}t=m;p=c[a+(l+24)>>2]|0;v=c[a+(l+12)>>2]|0;do{if((v|0)==(t|0)){w=a+(l+20)|0;x=c[w>>2]|0;if((x|0)==0){y=a+(l+16)|0;z=c[y>>2]|0;if((z|0)==0){A=0;break}else{B=z;C=y}}else{B=x;C=w}while(1){w=B+20|0;x=c[w>>2]|0;if((x|0)!=0){B=x;C=w;continue}w=B+16|0;x=c[w>>2]|0;if((x|0)==0){break}else{B=x;C=w}}if(C>>>0<e>>>0){aj()}else{c[C>>2]=0;A=B;break}}else{w=c[a+(l+8)>>2]|0;if(w>>>0<e>>>0){aj()}x=w+12|0;if((c[x>>2]|0)!=(t|0)){aj()}y=v+8|0;if((c[y>>2]|0)==(t|0)){c[x>>2]=v;c[y>>2]=w;A=v;break}else{aj()}}}while(0);if((p|0)==0){q=n;r=o;break}v=a+(l+28)|0;m=1216+(c[v>>2]<<2)|0;do{if((t|0)==(c[m>>2]|0)){c[m>>2]=A;if((A|0)!=0){break}c[229]=c[229]&~(1<<c[v>>2]);q=n;r=o;break L1439}else{if(p>>>0<(c[232]|0)>>>0){aj()}k=p+16|0;if((c[k>>2]|0)==(t|0)){c[k>>2]=A}else{c[p+20>>2]=A}if((A|0)==0){q=n;r=o;break L1439}}}while(0);if(A>>>0<(c[232]|0)>>>0){aj()}c[A+24>>2]=p;t=c[a+(l+16)>>2]|0;do{if((t|0)!=0){if(t>>>0<(c[232]|0)>>>0){aj()}else{c[A+16>>2]=t;c[t+24>>2]=A;break}}}while(0);t=c[a+(l+20)>>2]|0;if((t|0)==0){q=n;r=o;break}if(t>>>0<(c[232]|0)>>>0){aj()}else{c[A+20>>2]=t;c[t+24>>2]=A;q=n;r=o;break}}else{q=d;r=h}}while(0);d=q;if(d>>>0>=i>>>0){aj()}A=a+(h-4)|0;e=c[A>>2]|0;if((e&1|0)==0){aj()}do{if((e&2|0)==0){if((j|0)==(c[234]|0)){B=(c[231]|0)+r|0;c[231]=B;c[234]=q;c[q+4>>2]=B|1;if((q|0)!=(c[233]|0)){return}c[233]=0;c[230]=0;return}if((j|0)==(c[233]|0)){B=(c[230]|0)+r|0;c[230]=B;c[233]=q;c[q+4>>2]=B|1;c[d+B>>2]=B;return}B=(e&-8)+r|0;C=e>>>3;L1542:do{if(e>>>0<256){u=c[a+h>>2]|0;g=c[a+(h|4)>>2]|0;b=952+(C<<1<<2)|0;do{if((u|0)!=(b|0)){if(u>>>0<(c[232]|0)>>>0){aj()}if((c[u+12>>2]|0)==(j|0)){break}aj()}}while(0);if((g|0)==(u|0)){c[228]=c[228]&~(1<<C);break}do{if((g|0)==(b|0)){D=g+8|0}else{if(g>>>0<(c[232]|0)>>>0){aj()}f=g+8|0;if((c[f>>2]|0)==(j|0)){D=f;break}aj()}}while(0);c[u+12>>2]=g;c[D>>2]=u}else{b=i;f=c[a+(h+16)>>2]|0;t=c[a+(h|4)>>2]|0;do{if((t|0)==(b|0)){p=a+(h+12)|0;v=c[p>>2]|0;if((v|0)==0){m=a+(h+8)|0;k=c[m>>2]|0;if((k|0)==0){E=0;break}else{F=k;G=m}}else{F=v;G=p}while(1){p=F+20|0;v=c[p>>2]|0;if((v|0)!=0){F=v;G=p;continue}p=F+16|0;v=c[p>>2]|0;if((v|0)==0){break}else{F=v;G=p}}if(G>>>0<(c[232]|0)>>>0){aj()}else{c[G>>2]=0;E=F;break}}else{p=c[a+h>>2]|0;if(p>>>0<(c[232]|0)>>>0){aj()}v=p+12|0;if((c[v>>2]|0)!=(b|0)){aj()}m=t+8|0;if((c[m>>2]|0)==(b|0)){c[v>>2]=t;c[m>>2]=p;E=t;break}else{aj()}}}while(0);if((f|0)==0){break}t=a+(h+20)|0;u=1216+(c[t>>2]<<2)|0;do{if((b|0)==(c[u>>2]|0)){c[u>>2]=E;if((E|0)!=0){break}c[229]=c[229]&~(1<<c[t>>2]);break L1542}else{if(f>>>0<(c[232]|0)>>>0){aj()}g=f+16|0;if((c[g>>2]|0)==(b|0)){c[g>>2]=E}else{c[f+20>>2]=E}if((E|0)==0){break L1542}}}while(0);if(E>>>0<(c[232]|0)>>>0){aj()}c[E+24>>2]=f;b=c[a+(h+8)>>2]|0;do{if((b|0)!=0){if(b>>>0<(c[232]|0)>>>0){aj()}else{c[E+16>>2]=b;c[b+24>>2]=E;break}}}while(0);b=c[a+(h+12)>>2]|0;if((b|0)==0){break}if(b>>>0<(c[232]|0)>>>0){aj()}else{c[E+20>>2]=b;c[b+24>>2]=E;break}}}while(0);c[q+4>>2]=B|1;c[d+B>>2]=B;if((q|0)!=(c[233]|0)){H=B;break}c[230]=B;return}else{c[A>>2]=e&-2;c[q+4>>2]=r|1;c[d+r>>2]=r;H=r}}while(0);r=H>>>3;if(H>>>0<256){d=r<<1;e=952+(d<<2)|0;A=c[228]|0;E=1<<r;do{if((A&E|0)==0){c[228]=A|E;I=e;J=952+(d+2<<2)|0}else{r=952+(d+2<<2)|0;h=c[r>>2]|0;if(h>>>0>=(c[232]|0)>>>0){I=h;J=r;break}aj()}}while(0);c[J>>2]=q;c[I+12>>2]=q;c[q+8>>2]=I;c[q+12>>2]=e;return}e=q;I=H>>>8;do{if((I|0)==0){K=0}else{if(H>>>0>16777215){K=31;break}J=(I+1048320|0)>>>16&8;d=I<<J;E=(d+520192|0)>>>16&4;A=d<<E;d=(A+245760|0)>>>16&2;r=14-(E|J|d)+(A<<d>>>15)|0;K=H>>>((r+7|0)>>>0)&1|r<<1}}while(0);I=1216+(K<<2)|0;c[q+28>>2]=K;c[q+20>>2]=0;c[q+16>>2]=0;r=c[229]|0;d=1<<K;do{if((r&d|0)==0){c[229]=r|d;c[I>>2]=e;c[q+24>>2]=I;c[q+12>>2]=q;c[q+8>>2]=q}else{if((K|0)==31){L=0}else{L=25-(K>>>1)|0}A=H<<L;J=c[I>>2]|0;while(1){if((c[J+4>>2]&-8|0)==(H|0)){break}M=J+16+(A>>>31<<2)|0;E=c[M>>2]|0;if((E|0)==0){N=1186;break}else{A=A<<1;J=E}}if((N|0)==1186){if(M>>>0<(c[232]|0)>>>0){aj()}else{c[M>>2]=e;c[q+24>>2]=J;c[q+12>>2]=q;c[q+8>>2]=q;break}}A=J+8|0;B=c[A>>2]|0;E=c[232]|0;if(J>>>0<E>>>0){aj()}if(B>>>0<E>>>0){aj()}else{c[B+12>>2]=e;c[A>>2]=e;c[q+8>>2]=B;c[q+12>>2]=J;c[q+24>>2]=0;break}}}while(0);q=(c[236]|0)-1|0;c[236]=q;if((q|0)==0){O=1368}else{return}while(1){q=c[O>>2]|0;if((q|0)==0){break}else{O=q+8|0}}c[236]=-1;return}function bg(a,b){a=a|0;b=b|0;var d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0;if((a|0)==0){d=be(b)|0;return d|0}if(b>>>0>4294967231){c[(az()|0)>>2]=12;d=0;return d|0}if(b>>>0<11){e=16}else{e=b+11&-8}f=a-8|0;g=a-4|0;h=c[g>>2]|0;i=h&-8;j=i-8|0;k=a+j|0;l=k;m=c[232]|0;if(f>>>0<m>>>0){aj();return 0}n=h&3;if(!((n|0)!=1&(j|0)>-8)){aj();return 0}j=i|4;o=a+(j-8)|0;p=c[o>>2]|0;if((p&1|0)==0){aj();return 0}L1677:do{if((n|0)==0){if(e>>>0<256|i>>>0<(e|4)>>>0){break}if((i-e|0)>>>0>c[224]<<1>>>0|(f|0)==0){break}else{d=a}return d|0}else{do{if(i>>>0<e>>>0){if((l|0)==(c[234]|0)){q=(c[231]|0)+i|0;if(q>>>0<=e>>>0){break L1677}r=q-e|0;c[g>>2]=h&1|e|2;c[a+((e|4)-8)>>2]=r|1;c[234]=a+(e-8);c[231]=r;break}if((l|0)==(c[233]|0)){r=(c[230]|0)+i|0;if(r>>>0<e>>>0){break L1677}q=r-e|0;if(q>>>0>15){c[g>>2]=h&1|e|2;c[a+((e|4)-8)>>2]=q|1;c[a+(r-8)>>2]=q;s=a+(r-4)|0;c[s>>2]=c[s>>2]&-2;t=a+(e-8)|0;u=q}else{c[g>>2]=h&1|r|2;q=a+(r-4)|0;c[q>>2]=c[q>>2]|1;t=0;u=0}c[230]=u;c[233]=t;break}if((p&2|0)!=0){break L1677}q=(p&-8)+i|0;if(q>>>0<e>>>0){break L1677}r=q-e|0;s=p>>>3;L1695:do{if(p>>>0<256){v=c[a+i>>2]|0;w=c[a+j>>2]|0;x=952+(s<<1<<2)|0;do{if((v|0)!=(x|0)){if(v>>>0<m>>>0){aj();return 0}if((c[v+12>>2]|0)==(l|0)){break}aj();return 0}}while(0);if((w|0)==(v|0)){c[228]=c[228]&~(1<<s);break}do{if((w|0)==(x|0)){y=w+8|0}else{if(w>>>0<m>>>0){aj();return 0}z=w+8|0;if((c[z>>2]|0)==(l|0)){y=z;break}aj();return 0}}while(0);c[v+12>>2]=w;c[y>>2]=v}else{x=k;z=c[a+(i+16)>>2]|0;A=c[a+j>>2]|0;do{if((A|0)==(x|0)){B=a+(i+12)|0;C=c[B>>2]|0;if((C|0)==0){D=a+(i+8)|0;E=c[D>>2]|0;if((E|0)==0){F=0;break}else{G=E;H=D}}else{G=C;H=B}while(1){B=G+20|0;C=c[B>>2]|0;if((C|0)!=0){G=C;H=B;continue}B=G+16|0;C=c[B>>2]|0;if((C|0)==0){break}else{G=C;H=B}}if(H>>>0<m>>>0){aj();return 0}else{c[H>>2]=0;F=G;break}}else{B=c[a+i>>2]|0;if(B>>>0<m>>>0){aj();return 0}C=B+12|0;if((c[C>>2]|0)!=(x|0)){aj();return 0}D=A+8|0;if((c[D>>2]|0)==(x|0)){c[C>>2]=A;c[D>>2]=B;F=A;break}else{aj();return 0}}}while(0);if((z|0)==0){break}A=a+(i+20)|0;v=1216+(c[A>>2]<<2)|0;do{if((x|0)==(c[v>>2]|0)){c[v>>2]=F;if((F|0)!=0){break}c[229]=c[229]&~(1<<c[A>>2]);break L1695}else{if(z>>>0<(c[232]|0)>>>0){aj();return 0}w=z+16|0;if((c[w>>2]|0)==(x|0)){c[w>>2]=F}else{c[z+20>>2]=F}if((F|0)==0){break L1695}}}while(0);if(F>>>0<(c[232]|0)>>>0){aj();return 0}c[F+24>>2]=z;x=c[a+(i+8)>>2]|0;do{if((x|0)!=0){if(x>>>0<(c[232]|0)>>>0){aj();return 0}else{c[F+16>>2]=x;c[x+24>>2]=F;break}}}while(0);x=c[a+(i+12)>>2]|0;if((x|0)==0){break}if(x>>>0<(c[232]|0)>>>0){aj();return 0}else{c[F+20>>2]=x;c[x+24>>2]=F;break}}}while(0);if(r>>>0>=16){c[g>>2]=c[g>>2]&1|e|2;c[a+((e|4)-8)>>2]=r|3;s=a+((q|4)-8)|0;c[s>>2]=c[s>>2]|1;bh(a+(e-8)|0,r);break}c[g>>2]=q|c[g>>2]&1|2;s=a+((q|4)-8)|0;c[s>>2]=c[s>>2]|1;d=a;return d|0}else{s=i-e|0;if(s>>>0<=15){break}c[g>>2]=h&1|e|2;c[a+((e|4)-8)>>2]=s|3;c[o>>2]=c[o>>2]|1;bh(a+(e-8)|0,s);d=a;return d|0}}while(0);if((f|0)==0){break}else{d=a}return d|0}}while(0);f=be(b)|0;if((f|0)==0){d=0;return d|0}e=c[g>>2]|0;g=(e&-8)-((e&3|0)==0?8:4)|0;e=g>>>0<b>>>0?g:b;bk(f|0,a|0,e)|0;bf(a);d=f;return d|0}function bh(a,b){a=a|0;b=b|0;var d=0,e=0,f=0,g=0,h=0,i=0,j=0,k=0,l=0,m=0,n=0,o=0,p=0,q=0,r=0,s=0,t=0,u=0,v=0,w=0,x=0,y=0,z=0,A=0,B=0,C=0,D=0,E=0,F=0,G=0,H=0,I=0,J=0,K=0,L=0;d=a;e=d+b|0;f=e;g=c[a+4>>2]|0;L1783:do{if((g&1|0)==0){h=c[a>>2]|0;if((g&3|0)==0){return}i=d+(-h|0)|0;j=i;k=h+b|0;l=c[232]|0;if(i>>>0<l>>>0){aj()}if((j|0)==(c[233]|0)){m=d+(b+4)|0;if((c[m>>2]&3|0)!=3){n=j;o=k;break}c[230]=k;c[m>>2]=c[m>>2]&-2;c[d+(4-h)>>2]=k|1;c[e>>2]=k;return}m=h>>>3;if(h>>>0<256){p=c[d+(8-h)>>2]|0;q=c[d+(12-h)>>2]|0;r=952+(m<<1<<2)|0;do{if((p|0)!=(r|0)){if(p>>>0<l>>>0){aj()}if((c[p+12>>2]|0)==(j|0)){break}aj()}}while(0);if((q|0)==(p|0)){c[228]=c[228]&~(1<<m);n=j;o=k;break}do{if((q|0)==(r|0)){s=q+8|0}else{if(q>>>0<l>>>0){aj()}t=q+8|0;if((c[t>>2]|0)==(j|0)){s=t;break}aj()}}while(0);c[p+12>>2]=q;c[s>>2]=p;n=j;o=k;break}r=i;m=c[d+(24-h)>>2]|0;t=c[d+(12-h)>>2]|0;do{if((t|0)==(r|0)){u=16-h|0;v=d+(u+4)|0;w=c[v>>2]|0;if((w|0)==0){x=d+u|0;u=c[x>>2]|0;if((u|0)==0){y=0;break}else{z=u;A=x}}else{z=w;A=v}while(1){v=z+20|0;w=c[v>>2]|0;if((w|0)!=0){z=w;A=v;continue}v=z+16|0;w=c[v>>2]|0;if((w|0)==0){break}else{z=w;A=v}}if(A>>>0<l>>>0){aj()}else{c[A>>2]=0;y=z;break}}else{v=c[d+(8-h)>>2]|0;if(v>>>0<l>>>0){aj()}w=v+12|0;if((c[w>>2]|0)!=(r|0)){aj()}x=t+8|0;if((c[x>>2]|0)==(r|0)){c[w>>2]=t;c[x>>2]=v;y=t;break}else{aj()}}}while(0);if((m|0)==0){n=j;o=k;break}t=d+(28-h)|0;l=1216+(c[t>>2]<<2)|0;do{if((r|0)==(c[l>>2]|0)){c[l>>2]=y;if((y|0)!=0){break}c[229]=c[229]&~(1<<c[t>>2]);n=j;o=k;break L1783}else{if(m>>>0<(c[232]|0)>>>0){aj()}i=m+16|0;if((c[i>>2]|0)==(r|0)){c[i>>2]=y}else{c[m+20>>2]=y}if((y|0)==0){n=j;o=k;break L1783}}}while(0);if(y>>>0<(c[232]|0)>>>0){aj()}c[y+24>>2]=m;r=16-h|0;t=c[d+r>>2]|0;do{if((t|0)!=0){if(t>>>0<(c[232]|0)>>>0){aj()}else{c[y+16>>2]=t;c[t+24>>2]=y;break}}}while(0);t=c[d+(r+4)>>2]|0;if((t|0)==0){n=j;o=k;break}if(t>>>0<(c[232]|0)>>>0){aj()}else{c[y+20>>2]=t;c[t+24>>2]=y;n=j;o=k;break}}else{n=a;o=b}}while(0);a=c[232]|0;if(e>>>0<a>>>0){aj()}y=d+(b+4)|0;z=c[y>>2]|0;do{if((z&2|0)==0){if((f|0)==(c[234]|0)){A=(c[231]|0)+o|0;c[231]=A;c[234]=n;c[n+4>>2]=A|1;if((n|0)!=(c[233]|0)){return}c[233]=0;c[230]=0;return}if((f|0)==(c[233]|0)){A=(c[230]|0)+o|0;c[230]=A;c[233]=n;c[n+4>>2]=A|1;c[n+A>>2]=A;return}A=(z&-8)+o|0;s=z>>>3;L1883:do{if(z>>>0<256){g=c[d+(b+8)>>2]|0;t=c[d+(b+12)>>2]|0;h=952+(s<<1<<2)|0;do{if((g|0)!=(h|0)){if(g>>>0<a>>>0){aj()}if((c[g+12>>2]|0)==(f|0)){break}aj()}}while(0);if((t|0)==(g|0)){c[228]=c[228]&~(1<<s);break}do{if((t|0)==(h|0)){B=t+8|0}else{if(t>>>0<a>>>0){aj()}m=t+8|0;if((c[m>>2]|0)==(f|0)){B=m;break}aj()}}while(0);c[g+12>>2]=t;c[B>>2]=g}else{h=e;m=c[d+(b+24)>>2]|0;l=c[d+(b+12)>>2]|0;do{if((l|0)==(h|0)){i=d+(b+20)|0;p=c[i>>2]|0;if((p|0)==0){q=d+(b+16)|0;v=c[q>>2]|0;if((v|0)==0){C=0;break}else{D=v;E=q}}else{D=p;E=i}while(1){i=D+20|0;p=c[i>>2]|0;if((p|0)!=0){D=p;E=i;continue}i=D+16|0;p=c[i>>2]|0;if((p|0)==0){break}else{D=p;E=i}}if(E>>>0<a>>>0){aj()}else{c[E>>2]=0;C=D;break}}else{i=c[d+(b+8)>>2]|0;if(i>>>0<a>>>0){aj()}p=i+12|0;if((c[p>>2]|0)!=(h|0)){aj()}q=l+8|0;if((c[q>>2]|0)==(h|0)){c[p>>2]=l;c[q>>2]=i;C=l;break}else{aj()}}}while(0);if((m|0)==0){break}l=d+(b+28)|0;g=1216+(c[l>>2]<<2)|0;do{if((h|0)==(c[g>>2]|0)){c[g>>2]=C;if((C|0)!=0){break}c[229]=c[229]&~(1<<c[l>>2]);break L1883}else{if(m>>>0<(c[232]|0)>>>0){aj()}t=m+16|0;if((c[t>>2]|0)==(h|0)){c[t>>2]=C}else{c[m+20>>2]=C}if((C|0)==0){break L1883}}}while(0);if(C>>>0<(c[232]|0)>>>0){aj()}c[C+24>>2]=m;h=c[d+(b+16)>>2]|0;do{if((h|0)!=0){if(h>>>0<(c[232]|0)>>>0){aj()}else{c[C+16>>2]=h;c[h+24>>2]=C;break}}}while(0);h=c[d+(b+20)>>2]|0;if((h|0)==0){break}if(h>>>0<(c[232]|0)>>>0){aj()}else{c[C+20>>2]=h;c[h+24>>2]=C;break}}}while(0);c[n+4>>2]=A|1;c[n+A>>2]=A;if((n|0)!=(c[233]|0)){F=A;break}c[230]=A;return}else{c[y>>2]=z&-2;c[n+4>>2]=o|1;c[n+o>>2]=o;F=o}}while(0);o=F>>>3;if(F>>>0<256){z=o<<1;y=952+(z<<2)|0;C=c[228]|0;b=1<<o;do{if((C&b|0)==0){c[228]=C|b;G=y;H=952+(z+2<<2)|0}else{o=952+(z+2<<2)|0;d=c[o>>2]|0;if(d>>>0>=(c[232]|0)>>>0){G=d;H=o;break}aj()}}while(0);c[H>>2]=n;c[G+12>>2]=n;c[n+8>>2]=G;c[n+12>>2]=y;return}y=n;G=F>>>8;do{if((G|0)==0){I=0}else{if(F>>>0>16777215){I=31;break}H=(G+1048320|0)>>>16&8;z=G<<H;b=(z+520192|0)>>>16&4;C=z<<b;z=(C+245760|0)>>>16&2;o=14-(b|H|z)+(C<<z>>>15)|0;I=F>>>((o+7|0)>>>0)&1|o<<1}}while(0);G=1216+(I<<2)|0;c[n+28>>2]=I;c[n+20>>2]=0;c[n+16>>2]=0;o=c[229]|0;z=1<<I;if((o&z|0)==0){c[229]=o|z;c[G>>2]=y;c[n+24>>2]=G;c[n+12>>2]=n;c[n+8>>2]=n;return}if((I|0)==31){J=0}else{J=25-(I>>>1)|0}I=F<<J;J=c[G>>2]|0;while(1){if((c[J+4>>2]&-8|0)==(F|0)){break}K=J+16+(I>>>31<<2)|0;G=c[K>>2]|0;if((G|0)==0){L=1452;break}else{I=I<<1;J=G}}if((L|0)==1452){if(K>>>0<(c[232]|0)>>>0){aj()}c[K>>2]=y;c[n+24>>2]=J;c[n+12>>2]=n;c[n+8>>2]=n;return}K=J+8|0;L=c[K>>2]|0;I=c[232]|0;if(J>>>0<I>>>0){aj()}if(L>>>0<I>>>0){aj()}c[L+12>>2]=y;c[K>>2]=y;c[n+8>>2]=L;c[n+12>>2]=J;c[n+24>>2]=0;return}function bi(b){b=b|0;var c=0;c=b;while(a[c]|0){c=c+1|0}return c-b|0}function bj(b,d,e){b=b|0;d=d|0;e=e|0;var f=0,g=0,h=0;f=b+e|0;if((e|0)>=20){d=d&255;e=b&3;g=d|d<<8|d<<16|d<<24;h=f&~3;if(e){e=b+4-e|0;while((b|0)<(e|0)){a[b]=d;b=b+1|0}}while((b|0)<(h|0)){c[b>>2]=g;b=b+4|0}}while((b|0)<(f|0)){a[b]=d;b=b+1|0}}function bk(b,d,e){b=b|0;d=d|0;e=e|0;var f=0;f=b|0;if((b&3)==(d&3)){while(b&3){if((e|0)==0)return f|0;a[b]=a[d]|0;b=b+1|0;d=d+1|0;e=e-1|0}while((e|0)>=4){c[b>>2]=c[d>>2];b=b+4|0;d=d+4|0;e=e-4|0}}while((e|0)>0){a[b]=a[d]|0;b=b+1|0;d=d+1|0;e=e-1|0}return f|0}function bl(a,b){a=a|0;b=b|0;return aE[a&1](b|0)|0}function bm(a){a=a|0;aF[a&1]()}function bn(a,b,c){a=a|0;b=b|0;c=c|0;return aG[a&1](b|0,c|0)|0}function bo(a,b){a=a|0;b=b|0;aH[a&1](b|0)}function bp(a){a=a|0;_(0);return 0}function bq(){_(1)}function br(a,b){a=a|0;b=b|0;_(2);return 0}function bs(a){a=a|0;_(3)}\\n // EMSCRIPTEN_END_FUNCS\\n var aE=[bp,bp];var aF=[bq,bq];var aG=[br,br];var aH=[bs,bs];return{_strlen:bi,_crn_get_levels:a8,_crn_get_uncompressed_size:bb,_crn_decompress:bc,_crn_get_width:a6,_realloc:bg,_crn_get_bytes_per_block:ba,_memset:bj,_malloc:be,_memcpy:bk,_free:bf,_crn_get_height:a7,_crn_get_dxt_format:a9,runPostSets:aY,stackAlloc:aI,stackSave:aJ,stackRestore:aK,setThrew:aL,setTempRet0:aO,setTempRet1:aP,setTempRet2:aQ,setTempRet3:aR,setTempRet4:aS,setTempRet5:aT,setTempRet6:aU,setTempRet7:aV,setTempRet8:aW,setTempRet9:aX,dynCall_ii:bl,dynCall_v:bm,dynCall_iii:bn,dynCall_vi:bo}\\n // EMSCRIPTEN_END_ASM\\n })({Math:Math,Int8Array:Int8Array,Int16Array:Int16Array,Int32Array:Int32Array,Uint8Array:Uint8Array,Uint16Array:Uint16Array,Uint32Array:Uint32Array,Float32Array:Float32Array,Float64Array:Float64Array},{abort:E,assert:A,asmPrintInt:function(a,b){s.print(\\\"int \\\"+a+\\\",\\\"+b)},asmPrintFloat:function(a,b){s.print(\\\"float \\\"+a+\\\",\\\"+b)},min:Ca,invoke_ii:function(a,b){try{return s.dynCall_ii(a,b)}catch(c){\\\"number\\\"!==typeof c&&\\\"longjmp\\\"!==c&&e(c),$.setThrew(1,0)}},invoke_v:function(a){try{s.dynCall_v(a)}catch(b){\\\"number\\\"!==\\n typeof b&&\\\"longjmp\\\"!==b&&e(b),$.setThrew(1,0)}},invoke_iii:function(a,b,c){try{return s.dynCall_iii(a,b,c)}catch(d){\\\"number\\\"!==typeof d&&\\\"longjmp\\\"!==d&&e(d),$.setThrew(1,0)}},invoke_vi:function(a,b){try{s.dynCall_vi(a,b)}catch(c){\\\"number\\\"!==typeof c&&\\\"longjmp\\\"!==c&&e(c),$.setThrew(1,0)}},_llvm_lifetime_end:q(),_snprintf:nb,_abort:function(){s.abort()},_fprintf:jc,_printf:function(a,b){return jc(K[Cb>>2],a,b)},_fflush:q(),__reallyNegative:lb,_sysconf:function(a){switch(a){case 30:return 4096;case 132:case 133:case 12:case 137:case 138:case 15:case 235:case 16:case 17:case 18:case 19:case 20:case 149:case 13:case 10:case 236:case 153:case 9:case 21:case 22:case 159:case 154:case 14:case 77:case 78:case 139:case 80:case 81:case 79:case 82:case 68:case 67:case 164:case 11:case 29:case 47:case 48:case 95:case 52:case 51:case 46:return 200809;\\n case 27:case 246:case 127:case 128:case 23:case 24:case 160:case 161:case 181:case 182:case 242:case 183:case 184:case 243:case 244:case 245:case 165:case 178:case 179:case 49:case 50:case 168:case 169:case 175:case 170:case 171:case 172:case 97:case 76:case 32:case 173:case 35:return-1;case 176:case 177:case 7:case 155:case 8:case 157:case 125:case 126:case 92:case 93:case 129:case 130:case 131:case 94:case 91:return 1;case 74:case 60:case 69:case 70:case 4:return 1024;case 31:case 42:case 72:return 32;\\n case 87:case 26:case 33:return 2147483647;case 34:case 1:return 47839;case 38:case 36:return 99;case 43:case 37:return 2048;case 0:return 2097152;case 3:return 65536;case 28:return 32768;case 44:return 32767;case 75:return 16384;case 39:return 1E3;case 89:return 700;case 71:return 256;case 40:return 255;case 2:return 100;case 180:return 64;case 25:return 20;case 5:return 16;case 6:return 6;case 73:return 4;case 84:return 1}S(R.u);return-1},___setErrNo:S,_fwrite:ic,_send:function(a,b,c){return!Z.ub(a)?\\n (S(R.ba),-1):hc(a,b,c)},_write:hc,_exit:function(a){mc(a)},_sprintf:function(a,b,c){return nb(a,j,b,c)},__formatString:mb,__ZSt9terminatev:function(){mc(-1234)},_pwrite:function(a,b,c,d){a=X[a];if(!a)return S(R.ba),-1;try{return ac(a,I,b,c,d)}catch(f){return Jb(f),-1}},_sbrk:nc,___errno_location:function(){return pb},___gxx_personality_v0:q(),_llvm_lifetime_start:q(),_time:function(a){var b=Math.floor(Date.now()/1E3);a&&(K[a>>2]=b);return b},__exit:mc,STACKTOP:x,STACK_MAX:Sa,tempDoublePtr:jb,ABORT:ua,\\n NaN:NaN,Infinity:Infinity},N),kb=s._strlen=$._strlen;s._crn_get_levels=$._crn_get_levels;s._crn_get_uncompressed_size=$._crn_get_uncompressed_size;s._crn_decompress=$._crn_decompress;s._crn_get_width=$._crn_get_width;s._realloc=$._realloc;s._crn_get_bytes_per_block=$._crn_get_bytes_per_block;var kc=s._memset=$._memset,Ka=s._malloc=$._malloc,lc=s._memcpy=$._memcpy;s._free=$._free;s._crn_get_height=$._crn_get_height;s._crn_get_dxt_format=$._crn_get_dxt_format;var ib=s.runPostSets=$.runPostSets;\\n s.dynCall_ii=$.dynCall_ii;s.dynCall_v=$.dynCall_v;s.dynCall_iii=$.dynCall_iii;s.dynCall_vi=$.dynCall_vi;oa=function(a){return $.stackAlloc(a)};ha=function(){return $.stackSave()};ia=function(a){$.stackRestore(a)};function Ec(a){this.name=\\\"ExitStatus\\\";this.message=\\\"Program terminated with exit(\\\"+a+\\\")\\\";this.status=a}Ec.prototype=Error();var Fc,Gc=m,fb=function Hc(){!s.calledRun&&Ic&&Jc();s.calledRun||(fb=Hc)};\\n s.callMain=s.Nd=function(a){function b(){for(var a=0;3>a;a++)d.push(0)}A(0==Q,\\\"cannot call main when async dependencies remain! (listen on __ATMAIN__)\\\");A(0==Va.length,\\\"cannot call main when preRun functions remain to be called\\\");a=a||[];ba&&Gc!==m&&s.P(\\\"preload time: \\\"+(Date.now()-Gc)+\\\" ms\\\");Za||(Za=l,Ua(O));var c=a.length+1,d=[L(H(\\\"/bin/this.program\\\"),\\\"i8\\\",0)];b();for(var f=0;f<c-1;f+=1)d.push(L(H(a[f]),\\\"i8\\\",0)),b();d.push(0);d=L(d,\\\"i32\\\",0);Fc=x;try{var h=s._main(c,d,0);s.noExitRuntime||Kc(h)}catch(g){g instanceof\\n Ec||(\\\"SimulateInfiniteLoop\\\"==g?s.noExitRuntime=l:(g&&(\\\"object\\\"===typeof g&&g.stack)&&s.P(\\\"exception thrown: \\\"+[g,g.stack]),e(g)))}finally{}};\\n function Jc(a){function b(){Za||(Za=l,Ua(O));Ua(Wa);s.calledRun=l;s._main&&Ic&&s.callMain(a);if(s.postRun)for(\\\"function\\\"==typeof s.postRun&&(s.postRun=[s.postRun]);s.postRun.length;)ab(s.postRun.shift());Ua(Ya)}a=a||s.arguments;Gc===m&&(Gc=Date.now());if(0<Q)s.P(\\\"run() called, but dependencies remain, so not running\\\");else{if(s.preRun)for(\\\"function\\\"==typeof s.preRun&&(s.preRun=[s.preRun]);s.preRun.length;)$a(s.preRun.shift());Ua(Va);0<Q||(s.setStatus?(s.setStatus(\\\"Running...\\\"),setTimeout(function(){setTimeout(function(){s.setStatus(\\\"\\\")},\\n 1);ua||b()},1)):b())}}s.run=s.ge=Jc;function Kc(a){ua=l;x=Fc;Ua(Xa);e(new Ec(a))}s.exit=s.Rd=Kc;function E(a){a&&(s.print(a),s.P(a));ua=l;e(\\\"abort() at \\\"+Ma())}s.abort=s.abort=E;if(s.preInit)for(\\\"function\\\"==typeof s.preInit&&(s.preInit=[s.preInit]);0<s.preInit.length;)s.preInit.pop()();var Ic=l;s.noInitialRun&&(Ic=p);Jc();\\n\\n return Module;\\n}\",\n \"compileImpl(cache)\\n {\\n // small helper to format info and error messages\\n var _ = (c) => {\\n return 'id=' + (c.id || '') + '|name=' + (c.name || '');\\n };\\n\\n // the common implementation for all components\\n var impl = (comp, cache, ids, names, kind) => {\\n // at least one of ID and name mandatory\\n if ( ! comp.name && ! comp.id ) {\\n throw new Error('No ID and no name on ' + kind.kind + ' in ' + cache.href);\\n }\\n // default value for compose\\n if ( ! comp.compose ) {\\n comp.compose = 'merge';\\n }\\n // does it exist yet?\\n var derived =\\n ( comp.id && ids[comp.id] )\\n || ( comp.name && names[comp.name] );\\n // if it does, perform the \\\"compose\\\" action..\\n if ( derived ) {\\n if ( derived.compose !== comp.compose ) {\\n throw new Error('Different compose actions for ' + kind.kind + 's: derived:'\\n + _(derived) + '|compose=' + derived.compose + ' and base:'\\n + _(comp) + '|compose=' + comp.compose);\\n }\\n else if ( derived.compose === 'merge' ) {\\n this.ctxt.display.info('Merge ' + kind.kind + 's derived:' + _(derived) + ' and base:' + _(comp));\\n var overriden = Object.keys(derived);\\n for ( var p in comp ) {\\n if ( overriden.indexOf(p) === -1 ) {\\n derived[p] = comp[p];\\n if ( p === 'id' ) {\\n ids[derived.id] = derived;\\n }\\n else if ( p === 'name' ) {\\n names[derived.name] = derived;\\n }\\n }\\n else {\\n derived[p] = kind.merge(p, derived[p], comp[p]);\\n }\\n }\\n }\\n else if ( derived.compose === 'hide' ) {\\n this.ctxt.platform.info('Hide ' + kind.kind + ' base:' + _(comp) + ' by derived:' + _(derived));\\n }\\n else {\\n throw new Error('Unknown compose on ' + kind.kind + ': ' + _(derived) + '|compose=' + derived.compose);\\n }\\n }\\n // ...if it does not, just add it\\n else {\\n cache.push(comp);\\n if ( comp.id ) {\\n ids[comp.id] = comp;\\n }\\n if ( comp.name ) {\\n names[comp.name] = comp;\\n }\\n }\\n };\\n\\n // compile hosts\\n if ( this.json.hosts ) {\\n this.json.hosts.forEach(host => {\\n impl(host, cache.hosts, null, cache.hostNames, cmp.Host);\\n });\\n }\\n // compile databases\\n if ( this.json.databases ) {\\n this.json.databases.forEach(db => {\\n impl(db, cache.dbs, cache.dbIds, cache.dbNames, cmp.Database);\\n });\\n }\\n // compile servers\\n if ( this.json.servers ) {\\n this.json.servers.forEach(srv => {\\n impl(srv, cache.srvs, cache.srvIds, cache.srvNames, cmp.Server);\\n });\\n }\\n // compile sources\\n if ( this.json.sources ) {\\n this.json.sources.forEach(src => {\\n impl(src, cache.srcs, null, cache.srcNames, cmp.SourceSet);\\n });\\n }\\n // compile mime types\\n if ( this.json['mime-types'] ) {\\n this.json['mime-types'].forEach(mime => {\\n impl(mime, cache.mimes, null, cache.mimeNames, cmp.MimeType);\\n });\\n }\\n // compile privileges\\n if ( this.json.privileges ) {\\n const each = (privs, cache, names) => {\\n if ( privs ) {\\n privs.forEach(priv => {\\n impl(priv, cache, null, names, cmp.Privilege);\\n });\\n }\\n };\\n each(this.json.privileges.execute, cache.execPrivs, cache.execPrivNames);\\n each(this.json.privileges.uri, cache.uriPrivs, cache.uriPrivNames);\\n }\\n // compile roles\\n if ( this.json.roles ) {\\n this.json.roles.forEach(role => {\\n impl(role, cache.roles, null, cache.roleNames, cmp.Role);\\n });\\n }\\n // compile users\\n if ( this.json.users ) {\\n this.json.users.forEach(user => {\\n impl(user, cache.users, null, cache.userNames, cmp.User);\\n });\\n }\\n // recurse on imports\\n this.imports.forEach(i => {\\n cache.href = i.path;\\n i.compileImpl(cache);\\n });\\n }\",\n \"function compileFaust(name, sourcecode, x, y, callback){\\n\\n// Temporarily Saving parameters of compilation\\n\\twindow.name = name;\\n\\twindow.source = sourcecode;\\n\\twindow.x = x;\\n\\twindow.y = y;\\n\\n\\tvar currentScene = \\twindow.scenes[window.currentScene];\\n\\n// To Avoid click during compilation\\n\\tif(currentScene)\\n\\t\\tcurrentScene.muteScene();\\n\\n\\tvar args = [\\\"-I\\\", \\\"http://faust.grame.fr/faustcode/\\\"];\\t\\t \\n\\tvar factory = faust.createDSPFactory(sourcecode, args);\\n callback(factory);\\n\\n\\tif(currentScene)\\n\\t\\tcurrentScene.unmuteScene();\\n\\n}\",\n \"_resolveCrossEnvironment(_resource) {\\n // does nothing\\n }\",\n \"makeCommand()\\n\\t{\\n\\t\\tlet command = configs.javaBin + ' -jar -Xss2048k';\\n\\t\\t//Ajouter le binaire\\n\\t\\tcommand += ' ' + __dirname + '/bin/yuicompressor-2.4.8.jar';\\n\\t\\t//Fichier de sortie\\n\\t\\tcommand += ' --type js -o ' + this.rootDir + this.configs.outputDir + this.targetDirPath + configs.outputFilename.replace('$1', this.savedFileName);\\n\\t\\t//Fichier d'entree\\n\\t\\tcommand += ' ' + this.savedFilePath;\\n\\t\\t\\n//\\t\\tconsole.log(command);\\n\\t\\t//Retourner la commande complete\\n\\t\\treturn command;\\n\\t}\",\n \"function gen_op_rscl_T0_T1_cc()\\n{\\n gen_opc_ptr.push({func:op_rscl_T0_T1_cc});\\n}\",\n \"function initCompSyntaxTools()\\n{\\n quadruples = [];\\n quadruples[0] = [Operation.GOTO, null, null, null]; //first quadruple should be goint to main\\n dirProcs = {};\\n constMem = 45000;\\n constants = {};\\n}\",\n \"startCompiling() {\\n return new Promise(resolve => {\\n let compiledFiles = {};\\n\\n let lastFile = null;\\n\\n for (let [key] of this.collectedComponents) {\\n compiledFiles[key] = false;\\n lastFile = key;\\n }\\n\\n for (let [key, componentInfo] of this.collectedComponents) {\\n if (componentInfo.htmlFile) {\\n componentInfo.htmlFile = normalizePath(componentInfo.htmlFile);\\n }\\n\\n\\n let { selector, component, htmlFile, isUnique, isChild } = componentInfo;\\n\\n // it means the component is acting as a tag\\n if (!htmlFile || isChild) {\\n compiledFiles[key] = true;\\n\\n if (key == lastFile) {\\n resolve();\\n }\\n continue;\\n }\\n\\n if (!this.htmlFilesList[htmlFile]) {\\n this.htmlFilesList[htmlFile] = componentInfo;\\n }\\n\\n if (htmlFile) {\\n echo.sameLine(cli.yellow('Compiling ' + cli.green(htmlFile.replace(ROOT + '/', ''))));\\n }\\n\\n this.compileView(htmlFile, selector, component, isUnique, false).then(parsedFilePath => {\\n compiledFiles[key] = true;\\n // add to smart-views files list \\n resources.smartViews.push(parsedFilePath.ltrim(ROOT).replace(/\\\\\\\\/g, '/').ltrim('/'));\\n if (key == lastFile) {\\n resolve();\\n }\\n });\\n }\\n });\\n }\",\n \"function logVBCS(){\\r\\n console.log(\\\" ------> RUNNING FROM EXTERNAL LIB <------\\\");\\r\\n}\",\n \"function compoxUtil() {\\n\\t// setAdjustMetaFunc\\n\\tApp.prototype.setAdjustMetaFunc = setAdjustMetaFunc;\\n\\t// dataTable\\n\\tApp.prototype.addDataTable = addDataTable;\\n\\tApp.prototype.getDataTable = getDataTable;\\n\\tApp.prototype.getDataTables = getDataTables;\\n\\t// comp\\n\\tApp.prototype.createComp = createComp;\\n\\tApp.prototype.getComp = getComp;\\n\\tApp.prototype.getCompsByDataTable = getCompsByDataTable;\\n\\tApp.prototype.getCompsByType = getCompsByType;\\n\\tApp.prototype.getComps = getComps;\\n\\tApp.prototype.getCompsByElement = getCompsByElement;\\n\\tApp.prototype.showComp = showComp;\\n\\t// validate\\n\\tApp.prototype.compsValidate = compsValidate;\\n\\tApp.prototype.compsValidateMultiParam = compsValidateMultiParam;\\n\\t// cache\\n\\tApp.prototype.setUserCache = setUserCache;\\n\\tApp.prototype.getUserCache = getUserCache;\\n\\tApp.prototype.removeUserCache = removeUserCache;\\n\\tApp.prototype.setCache = setCache;\\n\\tApp.prototype.getCache = getCache;\\n\\tApp.prototype.removeCache = removeCache;\\n\\tApp.prototype.setSessionCache = setSessionCache;\\n\\tApp.prototype.getSessionCache = getSessionCache;\\n\\tApp.prototype.removeSessionCache = removeSessionCache;\\n\\t// iwebCode\\n\\tApp.prototype.getEnvironment = getEnvironment;\\n\\tApp.prototype.setClientAttribute = setClientAttribute;\\n\\tApp.prototype.getClientAttribute = getClientAttribute;\\n\\t// ajax\\n\\tApp.prototype.ajax = ajax;\\n\\t// serverEvent\\n\\tApp.prototype.serverEvent = serverEvent;\\n\\t// util\\n\\tApp.prototype.setEnable = setEnable;\\n}\",\n \"function gen_op_shrl_T1_0_cc()\\n{\\n gen_opc_ptr.push({func:op_shrl_T1_0_cc});\\n}\",\n \"exitComp_if(ctx) {\\n\\t}\",\n \"function gen_op_rrxl_T1_cc()\\n{\\n gen_opc_ptr.push({func:op_rrxl_T1_cc});\\n}\",\n \"compile (fileName) {\\n return this.compileTabLogic.compileFile(fileName)\\n }\",\n \"function gen_op_rsbl_T0_T1_cc()\\n{\\n gen_opc_ptr.push({func:op_rsbl_T0_T1_cc});\\n}\",\n \"static $clinit() {\\n CharSequences.$clinit = function() {};\\n CharSequence = goog.module.get('java.lang.CharSequence$impl');\\n String = goog.module.get('java.lang.String$impl');\\n }\",\n \"function componentStillLoadingError(compType){var error$$1=Error(\\\"Can't compile synchronously as \\\"+stringify(compType)+\\\" is still being loaded!\\\");error$$1[ERROR_COMPONENT_TYPE]=compType;return error$$1;}\",\n \"function closureCompile(src, advanced, cb) {\\r\\n\\tfunction onError(e, e2, e3) {\\r\\n\\t\\tif(window.console)console.log('error', e, e2, e3);\\r\\n\\t\\tcb&&cb(null);\\r\\n\\t}\\r\\n\\tvar URL = 'http://closure-compiler.appspot.com/compile';\\r\\n\\t$.request('post', URL, \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tjs_code: src,\\r\\n\\t\\t\\t\\toutput_format: 'json',\\r\\n\\t\\t\\t\\toutput_info: ['compiled_code', 'statistics'],\\r\\n\\t\\t\\t\\toutput_file_name: 'minified-custom.js',\\r\\n\\t\\t\\t\\tcompilation_level: advanced ? 'ADVANCED_OPTIMIZATIONS' : 'SIMPLE_OPTIMIZATIONS'\\r\\n\\t\\t\\t}).then(function(txt) {\\r\\n\\t\\t\\t\\tcb&&cb($.parseJSON(txt));\\r\\n\\t\\t\\t}, onError)\\r\\n\\t\\t\\t.error(function(txt) {\\r\\n\\t\\t\\t\\twindow.console && console.log(txt, txt.stack || '');\\r\\n\\t\\t\\t});\\r\\n}\",\n \"function compileData () {\\n console.log('compileData');\\n\\n /* compile data and bss segments. generate an assembly\\n language include of all the labels */\\n\\n execSync(\\n 'cl65 ' +\\n '-Ln build/data.lbl ' +\\n '-C ' + (passPostfix === '' ? '' : 'build/') + 'data' + passPostfix + '.cfg ' +\\n 'build/data.s -vm'\\n );\\n\\n execSync(\\n '(' +\\n 'echo -n \\\"ibase=16;scale=16;\\\" && ' +\\n '((grep __RAM2_LAST__ build/data.lbl|' +\\n \\\"sed -n \\\\\\\"s/al \\\\\\\\([^ ]*\\\\\\\\).*/\\\\\\\\1/p\\\\\\\")|tr -d '\\\\n')\\\" +\\n ' && echo -n \\\"-\\\" && ' +\\n 'grep __RAM2_START__ build/data.lbl|' +\\n 'sed -n \\\"s/al \\\\\\\\([^ ]*\\\\\\\\).*/\\\\\\\\1/p\\\"' +\\n ')|bc|' +\\n 'xargs -I {} dd if=/dev/zero bs=1 count={} of=build/data.bin'\\n );\\n\\n /* TODO: confirm this: Create a combined binary of the ram segments\\n so that they can be copied as one blob? */\\n execSync('dd if=build/data2.bin of=build/data.bin conv=notrunc;rm build/data2.bin');\\n\\n const lineReader2 = readline.createInterface({\\n input: fs.createReadStream('build/data.lbl')\\n });\\n\\n const labels = fs.createWriteStream('build/labels.s');\\n\\n /* read the resultant memory locations and make an assembly include\\n containing just their addresses */\\n lineReader2.on('line', line => {\\n const name = line.replace(/^al\\\\s+[0-9A-F]+ \\\\./, '');\\n\\n if (name.match(/l[0-9a-f]{4}/)) {\\n const address = parseInt(line.match(/[0-9A-F]+/), 16);\\n\\n labels.write(\\n name + ' = $' +\\n ('0000' + address.toString(16).toUpperCase()).substr(-4) +\\n '\\\\n'\\n );\\n } else if (name.match(/\\\\b_[0-9a-zA-Z]/) || name === 'jmpvec') { // && name !== '_main') {\\n // starts with an underscore (name defined by the c source code)\\n const address = parseInt(line.match(/[0-9A-F]+/), 16);\\n\\n labels.write('.export ' + name + '\\\\n');\\n\\n labels.write(\\n name + ' = $' +\\n ('0000' + address.toString(16).toUpperCase()).substr(-4) +\\n '\\\\n'\\n );\\n }\\n });\\n\\n lineReader2.on('close', () => {\\n labels.end(compileHash2);\\n });\\n}\",\n \"function Comp() {\\n return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createElement(\\\"div\\\", null, /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_0__.createElement(_src__WEBPACK_IMPORTED_MODULE_4__.default, {\\n lilProject: _sampleReactProject__WEBPACK_IMPORTED_MODULE_5__.default\\n }));\\n}\",\n \"function Bundler () {\\n}\",\n \"function mirrorbrain_getTagOS( file ) {\\n\\tvar retVal;\\n if ( file != null && (\\n\\t\\tfile.indexOf( \\\"_install-\\\" ) > -1 || (\\n\\t\\t\\tfile.indexOf( \\\"_install_\\\" ) > -1 && (\\n\\t\\t\\t\\tfile.indexOf( \\\"_Linux_\\\" ) > -1 || file.indexOf( \\\"_MacOS_\\\" ) > -1 || file.indexOf( \\\"_Win_\\\" ) > -1 || file.indexOf( \\\"_Solaris_\\\" ) > -1\\n\\t\\t\\t)\\n ) ) ) {\\n\\n\\t\\tvar s = file.split( \\\"_install\\\" );\\n\\t\\ts = s[0].split( \\\"_\\\" );\\n\\t\\tretVal = s[ s.length -2 ] + s[ s.length -1 ];\\n\\t\\tretVal = retVal.toLowerCase();\\n\\t\\tif ( retVal.indexOf( \\\"winx86\\\" ) > -1 ) {\\n\\t\\t\\tretVal = \\\"win\\\";\\n\\t\\t} else if ( retVal == \\\"linuxx86\\\" ) {\\n\\t\\t\\tretVal = \\\"linuxintel\\\";\\n\\t\\t} else if ( retVal == \\\"macosx86\\\" ) {\\n\\t\\t\\tretVal = \\\"macosxintel\\\";\\n\\t\\t} else if ( retVal == \\\"macosppc\\\" ) {\\n\\t\\t\\tretVal = \\\"macosxppc\\\";\\n\\t\\t}\\n\\t\\tif ( file.toLowerCase().indexOf( \\\"wjre\\\" ) > -1 ) {\\n\\t\\t\\tretVal = retVal + \\\"wjre\\\";\\n\\t\\t} else if ( file.indexOf( \\\"install-deb\\\" ) > -1 ) {\\n\\t\\t\\tretVal = retVal + \\\"deb\\\";\\n\\t\\t}\\n\\t} else if ( file != null && file.indexOf( \\\"_install_\\\" ) > -1 ) {\\n\\t\\tvar s = file.split( \\\"_install_\\\" );\\n\\t\\ts = s[0].split( \\\"_\\\" );\\n\\t\\tretVal = s[ s.length -1 ];\\n\\t\\tretVal = retVal.toLowerCase();\\n\\t\\tif ( retVal.indexOf( \\\"win32intel\\\" ) > -1 ) {\\n\\t\\t\\tretVal = \\\"win\\\";\\n\\t\\t}\\n\\t\\tif ( file.toLowerCase().indexOf( \\\"wjre\\\" ) > -1 ) {\\n\\t\\t\\tretVal = retVal + \\\"wjre\\\";\\n\\t\\t} else if ( file.indexOf( \\\"_deb\\\" ) > -1 ) {\\n\\t\\t\\tretVal = retVal + \\\"deb\\\";\\n\\t\\t} else if ( file.indexOf( \\\"install-deb\\\" ) > -1 ) {\\n\\t\\t\\tretVal = retVal + \\\"deb\\\";\\n\\t\\t}\\n\\t}\\n\\treturn retVal;\\n}\",\n \"function compras() {\\n\\n\\tvar arroz = 1;\\n\\n\\tthis.qualQtdArroz = function() {\\n\\t\\treturn 'Comprar ' + arroz + ' arroz!';\\n\\t}\\n\\n\\n}\",\n \"function _tool() {\\n return java(NAME);\\n }\",\n \"compilable(_locator) {\\n throw new Error('Method not implemented.');\\n }\",\n \"compilable(_locator) {\\n throw new Error('Method not implemented.');\\n }\",\n \"compilable(_locator) {\\n throw new Error('Method not implemented.');\\n }\",\n \"linkBytecode (bytecode, libs) {\\n const links = Object.assign({}, libs)\\n const keys = Object.keys(links)\\n for (let i = 0; i < keys.length; i++) {\\n let name = keys[i]\\n let addr = links[name]\\n\\n // Truncate to 37 characters\\n name = name.slice(0, 36)\\n\\n // Prefix and suffix with __\\n let label = '__' + name + Array(37 - name.length).join('_') + '__'\\n\\n if (addr.slice(0, 2) !== '0x' || addr.length > 42) {\\n throw new Error('Invalid address specified for ' + name)\\n }\\n\\n // Remove 0x prefix\\n addr = addr.slice(2)\\n addr = Array(40 - addr.length + 1).join('0') + addr\\n\\n while (bytecode.indexOf(label) >= 0) {\\n bytecode = bytecode.replace(label, addr)\\n }\\n const regex = new RegExp('__' + name + '_+', 'g')\\n\\n bytecode = bytecode.replace(regex, addr.replace('0x', ''))\\n }\\n\\n return bytecode\\n }\",\n \"function BO(t,e,n,i,r,o,a,s){var u=(\\\"function\\\"===typeof n?n.options:n)||{};return u.__file=\\\"source.vue\\\",u.render||(u.render=t.render,u.staticRenderFns=t.staticRenderFns,u._compiled=!0,r&&(u.functional=!0)),u._scopeId=i,u}\",\n \"async executeCompiled() {\\n if (!this.compiled) return\\n\\n // reset runtime environment\\n spellCore.resetRuntime()\\n delete this.exports\\n delete this.executionError\\n\\n // METHOD 2 (working except we can't get line number of failure)\\n // Run by importing our `outputFile` as a module.\\n // This lets us catch errors and get access to module `exports`.\\n // Unfortunately, we don't get the line number of the error\\n // (although Chrome does get the line number if we re-throw the error.)\\n try {\\n // Use `?<timestamp>` to create a unique URL each time\\n this.exports = await import(this.outputFile.url + `?${Date.now()}`)\\n return this.exports\\n } catch (e) {\\n if (Error.captureStackTrace) Error.captureStackTrace(e, this.executeCompiled)\\n this.executionError = e\\n return e\\n }\\n\\n // METHOD 1\\n // Alternate method of running: create a <script> tag\\n // Problem with this is that we don't get access to errors\\n // or `exports` in the compiled code.\\n //\\n // const scriptEl = document.createElement(\\\"script\\\")\\n // scriptEl.setAttribute(\\\"id\\\", \\\"compileOutput\\\")\\n // scriptEl.setAttribute(\\\"type\\\", \\\"module\\\")\\n // scriptEl.innerHTML = this.compiled\\n // const existingEl = document.getElementById(\\\"compileOutput\\\")\\n // if (existingEl) {\\n // existingEl.replaceWith(scriptEl)\\n // } else {\\n // document.body.append(scriptEl)\\n // }\\n }\",\n \"private public function m246() {}\",\n \"function mainNgcc(_a) {\\n var basePath = _a.basePath, targetEntryPointPath = _a.targetEntryPointPath, _b = _a.propertiesToConsider, propertiesToConsider = _b === void 0 ? entry_point_1.SUPPORTED_FORMAT_PROPERTIES : _b, _c = _a.compileAllFormats, compileAllFormats = _c === void 0 ? true : _c, _d = _a.createNewEntryPointFormats, createNewEntryPointFormats = _d === void 0 ? false : _d, _e = _a.logger, logger = _e === void 0 ? new console_logger_1.ConsoleLogger(console_logger_1.LogLevel.info) : _e;\\n var transformer = new transformer_1.Transformer(logger, basePath);\\n var host = new dependency_host_1.DependencyHost();\\n var resolver = new dependency_resolver_1.DependencyResolver(logger, host);\\n var finder = new entry_point_finder_1.EntryPointFinder(logger, resolver);\\n var fileWriter = getFileWriter(createNewEntryPointFormats);\\n var absoluteTargetEntryPointPath = targetEntryPointPath ?\\n path_1.AbsoluteFsPath.from(canonical_path_1.resolve(basePath, targetEntryPointPath)) :\\n undefined;\\n if (absoluteTargetEntryPointPath &&\\n hasProcessedTargetEntryPoint(absoluteTargetEntryPointPath, propertiesToConsider, compileAllFormats)) {\\n logger.debug('The target entry-point has already been processed');\\n return;\\n }\\n var entryPoints = finder.findEntryPoints(path_1.AbsoluteFsPath.from(basePath), absoluteTargetEntryPointPath).entryPoints;\\n if (absoluteTargetEntryPointPath && entryPoints.every(function (entryPoint) {\\n return entryPoint.path !== absoluteTargetEntryPointPath;\\n })) {\\n // If we get here, then the requested entry-point did not contain anything compiled by\\n // the old Angular compiler. Therefore there is nothing for ngcc to do.\\n // So mark all formats in this entry-point as processed so that clients of ngcc can avoid\\n // triggering ngcc for this entry-point in the future.\\n var packageJsonPath_1 = path_1.AbsoluteFsPath.from(canonical_path_1.resolve(absoluteTargetEntryPointPath, 'package.json'));\\n var packageJson_1 = JSON.parse(fs_1.readFileSync(packageJsonPath_1, 'utf8'));\\n propertiesToConsider.forEach(function (formatProperty) {\\n if (packageJson_1[formatProperty])\\n build_marker_1.markAsProcessed(packageJson_1, packageJsonPath_1, formatProperty);\\n });\\n return;\\n }\\n entryPoints.forEach(function (entryPoint) {\\n // Are we compiling the Angular core?\\n var isCore = entryPoint.name === '@angular/core';\\n var compiledFormats = new Set();\\n var entryPointPackageJson = entryPoint.packageJson;\\n var entryPointPackageJsonPath = path_1.AbsoluteFsPath.from(canonical_path_1.resolve(entryPoint.path, 'package.json'));\\n var hasProcessedDts = build_marker_1.hasBeenProcessed(entryPointPackageJson, 'typings');\\n for (var i = 0; i < propertiesToConsider.length; i++) {\\n var property = propertiesToConsider[i];\\n var formatPath = entryPointPackageJson[property];\\n var format = entry_point_1.getEntryPointFormat(property);\\n // No format then this property is not supposed to be compiled.\\n if (!formatPath || !format || SUPPORTED_FORMATS.indexOf(format) === -1)\\n continue;\\n if (build_marker_1.hasBeenProcessed(entryPointPackageJson, property)) {\\n compiledFormats.add(formatPath);\\n logger.debug(\\\"Skipping \\\" + entryPoint.name + \\\" : \\\" + property + \\\" (already compiled).\\\");\\n continue;\\n }\\n var isFirstFormat = compiledFormats.size === 0;\\n var processDts = !hasProcessedDts && isFirstFormat;\\n // We don't break if this if statement fails because we still want to mark\\n // the property as processed even if its underlying format has been built already.\\n if (!compiledFormats.has(formatPath) && (compileAllFormats || isFirstFormat)) {\\n var bundle = entry_point_bundle_1.makeEntryPointBundle(entryPoint.path, formatPath, entryPoint.typings, isCore, property, format, processDts);\\n if (bundle) {\\n logger.info(\\\"Compiling \\\" + entryPoint.name + \\\" : \\\" + property + \\\" as \\\" + format);\\n var transformedFiles = transformer.transform(bundle);\\n fileWriter.writeBundle(entryPoint, bundle, transformedFiles);\\n compiledFormats.add(formatPath);\\n }\\n else {\\n logger.warn(\\\"Skipping \\\" + entryPoint.name + \\\" : \\\" + format + \\\" (no valid entry point file for this format).\\\");\\n }\\n }\\n else if (!compileAllFormats) {\\n logger.debug(\\\"Skipping \\\" + entryPoint.name + \\\" : \\\" + property + \\\" (already compiled).\\\");\\n }\\n // Either this format was just compiled or its underlying format was compiled because of a\\n // previous property.\\n if (compiledFormats.has(formatPath)) {\\n build_marker_1.markAsProcessed(entryPointPackageJson, entryPointPackageJsonPath, property);\\n if (processDts) {\\n build_marker_1.markAsProcessed(entryPointPackageJson, entryPointPackageJsonPath, 'typings');\\n }\\n }\\n }\\n if (compiledFormats.size === 0) {\\n throw new Error(\\\"Failed to compile any formats for entry-point at (\\\" + entryPoint.path + \\\"). Tried \\\" + propertiesToConsider + \\\".\\\");\\n }\\n });\\n }\",\n \"function Jb(t,e,n,r,i,o,a,s){var l=(\\\"function\\\"===typeof n?n.options:n)||{};return l.__file=\\\"style.vue\\\",l.render||(l.render=t.render,l.staticRenderFns=t.staticRenderFns,l._compiled=!0,i&&(l.functional=!0)),l._scopeId=r,l}\",\n \"async compile(entryPoint) {\\n\\t\\tlet options = this.config.reify(entryPoint, this._cache);\\n\\t\\tlet bundle = await rollup(options.input);\\n\\t\\tlet { output } = await bundle.generate(options.output);\\n\\t\\tif(output.length !== 1) {\\n\\t\\t\\tthrow new Error(\\\"unexpected chunking\\\"); // TODO: support for code splitting\\n\\t\\t}\\n\\t\\tlet { code, modules } = output[0];\\n\\n\\t\\tthis._cache = bundle.cache;\\n\\t\\tthis._modules = modules;\\n\\t\\treturn code;\\n\\t}\",\n \"function Copcar(){}\",\n \"transient protected internal function m189() {}\",\n \"function compileModule(filename, sourceLines, options){\\n//Compile a module from source in memory\\n//input:\\n//* filename (for error reporting),\\n//* sourceLines: LiteScript code: string array | large string | Buffer\\n//* options: GeneralOptions\\n\\n//output:\\n//* moduleNode: Grammar.Module: module's code AST root node\\n\\n //default filename = 'unnamed'\\n if(filename===undefined) filename='unnamed';\\n //options.mainModuleName = filename\\n options.mainModuleName = filename;\\n\\n //#since \\\"options\\\" come from a external source, it can be anything\\n //options = prepareOptions(options)\\n options = prepareOptions(options);\\n\\n //var project = new Project(options)\\n var project = new Project(options);\\n\\n //var fileInfo = new Environment.FileInfo(filename)\\n var fileInfo = new Environment.FileInfo(filename);\\n\\n //var moduleNode = project.createNewModule(fileInfo)\\n var moduleNode = project.createNewModule(fileInfo);\\n\\n//add to module list, so WalkAllNodes includes it\\n\\n //project.moduleCache.set fileInfo.filename, moduleNode\\n project.moduleCache.set(fileInfo.filename, moduleNode);\\n\\n//store result in memory\\n\\n //moduleNode.lexer.outCode.fileMode=false\\n moduleNode.lexer.outCode.fileMode = false;\\n\\n//parse source lines\\n\\n //project.parseOnModule moduleNode, filename, sourceLines\\n project.parseOnModule(moduleNode, filename, sourceLines);\\n\\n //if no project.options.single\\n if (!project.options.single) {\\n \\n //project.importDependencies moduleNode\\n project.importDependencies(moduleNode);\\n };\\n\\n//validate var & property names\\n\\n //if no project.options.skip\\n if (!project.options.skip) {\\n \\n\\n //Validate.execute\\n Validate.execute();\\n //if logger.errorCount is 0, logger.info \\\"Validation OK\\\"\\n if (logger.errorCount === 0) {logger.info(\\\"Validation OK\\\")};\\n };\\n\\n//initialize out buffer & produce target code\\n\\n //logger.msg \\\"Generating #{project.options.target}\\\"\\n logger.msg(\\\"Generating \\\" + project.options.target);\\n\\n //project.produceModule moduleNode\\n project.produceModule(moduleNode);\\n //# the produced code will be at: moduleNode.lexer.out.getResult() :string array\\n\\n //if logger.errorCount isnt 0, logger.throwControlled \\\"#{logger.errorCount} errors during compilation\\\"\\n if (logger.errorCount !== 0) {logger.throwControlled('' + logger.errorCount + \\\" errors during compilation\\\")};\\n\\n//text compiled result can be obtained with: moduleNode.lexer.out.getResult() :string array\\n\\n //return moduleNode\\n return moduleNode;\\n }\",\n \"function compileECMA() {\\n\\n console.info('\\\\x1b[36m','😻 transforming ECMA script...');\\n\\n const browserify = require(\\\"browserify\\\");\\n const babelify = require(\\\"babelify\\\");\\n const envify = require('envify/custom');\\n\\n let b = browserify({ debug: false });\\n\\n // Browserify entrypoint and options.\\n b.require(\\\"./src/js/index.js\\\", { entry: true });\\n\\n // Babelify config and options.\\n // If NODE_ENV is set prodution minified = true otherwise sets to false.\\n b.transform(babelify, {\\n presets: [\\\"@babel/preset-env\\\"],\\n comments: false,\\n minified: envType !== 'production' ? false : true\\n });\\n\\n // Envify transform and options.\\n // If NODE_ENV is set prodution NODE_ENV = production otherwise sets to development.\\n b.transform(envify({\\n NODE_ENV: envType !== 'production' ? 'development' : 'production'\\n }));\\n\\n // Uglifyify transform and options.\\n // If NODE_ENV is set to prodution uglifyify transform is invoked otherwise it's skipped.\\n envType == 'production' ? b.transform('uglifyify', { global: true }) : null;\\n\\n // If no error(s) occur bundle is piped and written to ./dist/js/bundle.js.\\n b.bundle().on(\\\"error\\\", function (err) {\\n\\n console.log(\\\"Error: \\\" + err.message);\\n\\n }).pipe(fs.createWriteStream(\\\"./dist/js/bundle.js\\\").on('finish', () => {\\n\\n console.log('\\\\x1b[32m','🍕 Transform complete!');\\n\\n }));\\n\\n }\",\n \"enterComp_op(ctx) {\\n\\t}\",\n \"function Cn(t,e){\\\"undefined\\\"!=typeof console&&(console.warn(\\\"[vue-i18n] \\\"+t),e&&console.warn(e.stack))}\",\n \"SaveCompiledState() {\\n\\n }\",\n \"function _____SHARED_functions_____(){}\",\n \"function r(){throw new Error(\\\"Dynamic requires are not currently supported by rollup-plugin-commonjs\\\")}\",\n \"static final protected internal function m110() {}\",\n \"function getPlugoutComp() { return plugoutComp; }\",\n \"compileOneFile(inputFile) {\\n\\t\\tvar pathInPackage = inputFile.getPathInPackage();\\n\\t\\tvar packageName = inputFile.getPackageName();\\n\\t\\tif (packageName) {\\n\\t\\t\\tpackageName = packageName.replace('local-test:', '');\\n\\t\\t}\\n\\t\\tvar fullPath = pathInPackage;\\n\\t\\tif (packageName) {\\n\\t\\t\\tfullPath = path.join(packagesPath, packageName, fullPath);\\n\\t\\t}\\n\\n\\t\\t// console.log('Compiling...', (packageName || 'app') + '/' + pathInPackage);\\n\\n\\t\\tif (pathInPackage.indexOf('node_modules/') !== -1) {\\n\\t\\t\\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its in node_modules');\\n\\t\\t\\treturn {};\\n\\t\\t}\\n\\n\\t\\tif (pathInPackage.indexOf('typings/') !== -1) {\\n\\t\\t\\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its in typings');\\n\\t\\t\\treturn {};\\n\\t\\t}\\n\\n\\t\\tif (pathInPackage.substr(-5) === '.d.ts') {\\n\\t\\t\\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its a definition');\\n\\t\\t\\treturn {};\\n\\t\\t}\\n\\n\\t\\t// generatePackageRefs();\\n\\t\\tif (\\n\\t\\t\\tpackageName &&\\n\\t\\t\\ttypescriptPackages[packageName].client.files.indexOf(pathInPackage) === -1 &&\\n\\t\\t\\ttypescriptPackages[packageName].server.files.indexOf(pathInPackage) === -1\\n\\t\\t) {\\n\\t\\t\\tconsole.log('Ignoring', (packageName || 'app') + '/' + pathInPackage, 'becouse its not added to package.js');\\n\\t\\t\\treturn {};\\n\\t\\t}\\n\\n\\t\\t// cache check\\n\\t\\tvar cachePath = path.join(cacheDir, isApp && !disableInApp ? path.relative('../', fullPath) : path.relative(meteorPath, fullPath));\\n\\t\\tvar baseName = path.basename(fullPath, '.ts');\\n\\t\\tvar changeTime = fs.statSync(fullPath).mtime;\\n\\t\\tvar jsPath = path.join(path.dirname(cachePath), baseName + '.js');\\n\\t\\tvar error;\\n\\n\\t\\t// references\\n\\t\\tvar dir = path.dirname(path.relative('./', fullPath));\\n\\t\\tif (!packageName) {\\n\\t\\t\\tif (appDirs.indexOf(dir) == -1) {\\n\\t\\t\\t\\tappDirs.push(dir);\\n\\t\\t\\t}\\n\\t\\t\\tif (appRefs.indexOf(pathInPackage) == -1) {\\n\\t\\t\\t\\tappRefs.push(pathInPackage);\\n\\t\\t\\t\\tappDirs.forEach(function (dir) {\\n\\t\\t\\t\\t\\tfs.writeFileSync(path.join(dir, '.#ts', \\\"server.d.ts\\\"), '///<reference path=\\\"' + path.relative(dir, path.join('.meteor', '.#ts', 'app-server.d.ts')) + '\\\" />\\\\n');\\n\\t\\t\\t\\t\\tfs.writeFileSync(path.join(dir, '.#ts', \\\"client.d.ts\\\"), '///<reference path=\\\"' + path.relative(dir, path.join('.meteor', '.#ts', 'app-client.d.ts')) + '\\\" />\\\\n');\\n\\t\\t\\t\\t});\\n\\t\\t\\t\\tfs.writeFileSync(path.join('.meteor', '.#ts', 'app-server.d.ts'), getAppRefs('server'));\\n\\t\\t\\t\\tfs.writeFileSync(path.join('.meteor', '.#ts', 'app-client.d.ts'), getAppRefs('client'));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvar doesntExists = !fs.existsSync(jsPath);\\n\\t\\tvar existingTime = !doesntExists && fs.statSync(jsPath).mtime;\\n\\t\\tvar isTooOld = existingTime && changeTime.getTime() > existingTime.getTime();\\n\\t\\tif (doesntExists || isTooOld) {\\n\\n\\t\\t\\tif (doesntExists) {\\n\\t\\t\\t\\tconsole.log('Compiling because doesnt exist:', fullPath);\\n\\t\\t\\t\\t// console.log(\\n\\t\\t\\t\\t// \\ttypescriptPackages[packageName].client.files,\\n\\t\\t\\t\\t// \\ttypescriptPackages[packageName].server.files\\n\\t\\t\\t\\t// );\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tconsole.log('Compiling because too old:', fullPath);\\n\\t\\t\\t}\\n\\n\\t\\t\\tvar exec = Npm.require('child_process').exec;\\n\\t\\t\\tvar Future = Npm.require('fibers/future');\\n\\n\\t\\t\\tfunction execSync(command) {\\n\\t\\t\\t\\tvar fut = new Future();\\n\\t\\t\\t\\texec(command, function (error, stdout, stderr) {\\n\\t\\t\\t\\t\\tfut.return({\\n\\t\\t\\t\\t\\t\\tstdout: stdout,\\n\\t\\t\\t\\t\\t\\tstderr: stderr || error\\n\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t});\\n\\t\\t\\t\\treturn fut.wait();\\n\\t\\t\\t}\\n\\n\\t\\t\\tvar compileCommand = 'node ' + compilerPath + ' ' +\\n\\t\\t\\t\\t'--target ES5 ' +\\n\\t\\t\\t\\t'--sourcemap ' +\\n\\t\\t\\t\\t'--module amd ' +\\n\\t\\t\\t\\t'--experimentalDecorators ' +\\n\\t\\t\\t\\t'--emitDecoratorMetadata ' +\\n\\t\\t\\t\\t//'--pretty ' +\\n\\t\\t\\t\\t'--emitVerboseMetadata ' +\\n\\t\\t\\t\\t'--skipEmitVarForModule ' +\\n\\t\\t\\t\\t'--outDir ' + cacheDir + ' ' + (disableInApp ? meteorAllPath : allPath);\\n\\n\\t\\t\\t// console.log(compileCommand);\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tvar result = execSync(compileCommand);\\n\\t\\t\\t}\\n\\t\\t\\tcatch (e) {\\n\\t\\t\\t\\tconsole.log(e);\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (result.stderr) {\\n\\t\\t\\t\\tvar lines = (typeof result.stderr === 'string' ? result.stderr : result.stdout).split('\\\\n');\\n\\t\\t\\t\\tvar errors = [];\\n\\t\\t\\t\\tfor (var i = 0; i < lines.length; i++) {\\n\\t\\t\\t\\t\\tif (!lines[i]) {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\terrors.push(lines[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (errors.length > 0) {\\n\\t\\t\\t\\t\\terror = errors.join('\\\\n');\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!error && !fs.existsSync(jsPath)) {\\n\\t\\t\\t\\terror = 'File was not created: ' + jsPath;\\n\\t\\t\\t}\\n\\t\\t\\tif (error) {\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tfs.unlinkSync(jsPath);\\n\\t\\t\\t\\t\\tfs.unlinkSync(cachePath + '.map');\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcatch (e) {\\n\\t\\t\\t\\t\\t// ignore\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// ../meteor/packages/marketing/TransactionServer.ts(1078,10)\\n\\t\\t\\t\\terror = error\\n\\t\\t\\t\\t\\t.replace(/(\\\\x1b\\\\[30m)/g, '\\\\n$1')\\n\\t\\t\\t\\t\\t// .replace(/([a-zA-Z0-9\\\\.\\\\/_-]+)\\\\(([0-9]+),([0-9]+)\\\\)/g, '\\\\n\\\\x1b[42;1m' + process.cwd().replace(new RegExp('^/Users/' + process.env.USER, 'g'), '~') + '/$1:$2 $3\\\\x1b[0m');\\n\\t\\t\\t\\tinputFile.error({\\n\\t\\t\\t\\t\\tmessage: error\\n\\t\\t\\t\\t});\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvar data = fs.readFileSync(jsPath).toString();\\n\\n\\t\\t//console.log('adding: ' + jsPath)\\n\\t\\t// couple of hacks for meteor namespacing\\n\\t\\tvar prep = '';\\n\\t\\tdata = data\\n\\t\\t//.replace(/(new __\\\\(\\\\);\\\\n\\\\};\\\\n)var ([a-zA-Z0-9_]+);/, '$1' + prep)\\n\\t\\t\\t.replace(/(<reference path=\\\"[a-zA-Z0-9_\\\\.\\\\/-]+\\\"[ ]*\\\\/>\\\\n(\\\\/\\\\*(.|\\\\n)+\\\\*\\\\/\\\\n)?)var ([a-zA-Z0-9_]+);\\\\n/, '$1' + prep)\\n\\t\\t\\t//.replace(/(var __decorate[\\\\w\\\\s!=\\\"\\\\(\\\\)&|,.;:}{]*};\\\\n)var ([a-zA-Z0-9_]+);\\\\n/, '$1' + prep)\\n\\t\\t\\t.replace(/^\\\\s*var ([a-zA-Z0-9_]+);/, prep)\\n\\t\\t\\t.replace(/\\\\/\\\\/# sourceMappingURL=.+/, '');\\n\\t\\t//\\t\\t.replace(/\\\\}\\\\)\\\\(([a-zA-Z0-9_]+) \\\\|\\\\| \\\\(([a-zA-Z0-9_]+) = \\\\{\\\\}\\\\)\\\\);(\\\\n\\\\/\\\\/# sourceMappingURL)/, '})($1);$3');\\n\\t\\t//\\tdata = data\\n\\t\\t//\\t\\t.replace(/(new __\\\\(\\\\);\\\\n\\\\};\\\\n)var ([a-zA-Z0-9_]+);/, '$1this.$2 = this.$2 || {};\\\\nvar $2 = this.$2;')\\n\\t\\t//\\t\\t.replace(/(<reference path=\\\"[a-zA-Z0-9_\\\\.\\\\/-]+\\\"[ ]*\\\\/>\\\\n)var ([a-zA-Z0-9_]+);/, '$1this.$2 = this.$2 || {};\\\\nvar $2 = this.$2;')\\n\\t\\t//\\t\\t.replace(/^\\\\s*var ([a-zA-Z0-9_]+);/, 'this.$1 = this.$1 || {};\\\\nvar $1 = this.$1;');\\n\\n\\t\\tvar map = fs.readFileSync(jsPath + '.map')\\n\\t\\t\\t.toString()\\n\\t\\t\\t.replace(/\\\"sources\\\":\\\\[\\\"[0-9a-zA-Z-\\\\/\\\\.-]+\\\"]/, '\\\"sources\\\":[\\\"' + inputFile.getDisplayPath() + '\\\"]');\\n\\t\\tmap = map.substr(0, map.length - 1) + ',\\\"sourcesContent\\\":[\\\"' + fs.readFileSync(fullPath)\\n\\t\\t\\t\\t.toString()\\n\\t\\t\\t\\t.replace(/[\\\\\\\\]/g, '\\\\\\\\\\\\\\\\')\\n\\t\\t\\t\\t.replace(/[\\\"]/g, '\\\\\\\\\\\"')\\n\\t\\t\\t\\t.replace(/[\\\\b]/g, '\\\\\\\\b')\\n\\t\\t\\t\\t.replace(/[\\\\f]/g, '\\\\\\\\f')\\n\\t\\t\\t\\t.replace(/[\\\\n]/g, '\\\\\\\\n')\\n\\t\\t\\t\\t.replace(/[\\\\r]/g, '\\\\\\\\r')\\n\\t\\t\\t\\t.replace(/[\\\\t]/g, '\\\\\\\\t') + '\\\"]}';\\n\\t\\treturn {\\n\\t\\t\\tpath: pathInPackage + \\\".js\\\",\\n\\t\\t\\tdata: data,\\n\\t\\t\\tsourceMap: map\\n\\t\\t};\\n\\t}\",\n \"function Yj(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};Yj.installed||(Yj.installed=!0,t.use(i,e),t.use(o,e),t.use(a,e),t.use(s,e),t.use(l,e),t.use(u,e),t.use(c,e),t.use(d,e),t.use(h,e),t.use(f,e),t.use(p,e),t.use(A,e),t.use(m,e),t.use(g,e),t.use(v,e),t.use(y,e),t.use(b,e),t.use(_,e),t.use(w,e),t.use(x,e),t.use(C,e),t.use(S,e),t.use(M,e),t.use(T,e),t.use(E,e),t.use(L,e),t.use(B,e),t.use(O,e),t.use(k,e),t.use(D,e),t.use(F,e),t.use(P,e),t.use(I,e),t.use(N,e),t.use(j,e),t.use(R,e),t.use(H,e),t.use(U,e),t.use(Y,e),t.use(z,e),t.use(Q,e),t.use($,e),t.use(V,e),t.use(G,e))}\",\n \"function compileCode() {\\n // Disables the compile button\\n disableCompileButton();\\n\\n // Get the classes from the editor\\n let classes = [];\\n editor.getClasses().forEach(element => {\\n classes.push({ name: element.name, code: element.doc.getValue() });\\n });\\n\\n resultsComponent.componentWillReceiveProps({\\n display: true,\\n resultState: { compiling: true, error: false }\\n });\\n axios\\n .post(\\\"/compile\\\", {\\n challenge: editor.getChallengePath(),\\n classes\\n })\\n .then(function(res) {\\n if (res.data.error) {\\n resultsComponent.componentWillReceiveProps({\\n display: true,\\n resultState: { error: res.data.error }\\n });\\n } else {\\n resultsComponent.componentWillReceiveProps({\\n display: true,\\n resultState: {\\n compiling: false,\\n error: false,\\n data: res.data\\n }\\n });\\n }\\n enableCompileButton();\\n })\\n .catch(function(err) {\\n enableCompileButton();\\n resultsComponent.componentWillReceiveProps({\\n display: true,\\n resultState: {\\n compiling: false,\\n error: \\\"The request failed. Try again later.\\\"\\n }\\n });\\n });\\n}\",\n \"constructor() {\\n this.startTime = Date.now();\\n this.attributes = {\\n \\\"version\\\": 0.5, \\n \\\"lang\\\": \\\"node.js\\\",\\n \\\"startTime\\\": this.startTime\\n };\\n\\n this.inspectedCPU = false;\\n this.inspectedMemory = false;\\n this.inspectedContainer = false;\\n this.inspectedPlatform = false;\\n this.inspectedLinux = false;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6403422","0.63883287","0.57854426","0.5650239","0.56429785","0.5586955","0.5580404","0.556086","0.54912066","0.5480425","0.5451898","0.54312015","0.53887993","0.53754646","0.53143036","0.5301165","0.5294658","0.5280735","0.5278442","0.5240244","0.5239899","0.5230232","0.5213518","0.52075046","0.52075046","0.5183387","0.5165836","0.516115","0.51376456","0.5129679","0.5108174","0.50984156","0.5084778","0.50831676","0.5069086","0.50637084","0.50555956","0.5053338","0.5051102","0.50490594","0.5047956","0.5044336","0.5038126","0.5032035","0.5030088","0.50112414","0.4983174","0.49830648","0.49720308","0.49711573","0.49711522","0.49660537","0.49630997","0.49620187","0.49563414","0.4954347","0.49516672","0.49473858","0.49442193","0.4940017","0.493291","0.49213514","0.49200565","0.49132785","0.49126375","0.49022296","0.4890211","0.48815486","0.48717904","0.48675922","0.4865742","0.48629183","0.48581195","0.48578772","0.48510066","0.48456484","0.48373416","0.48373416","0.48373416","0.4832739","0.48315102","0.48315012","0.4827201","0.48255685","0.48254195","0.48251018","0.48145053","0.48082152","0.48073664","0.48067936","0.4804313","0.47943884","0.47943163","0.4783561","0.47784102","0.47783917","0.47738135","0.47699732","0.47622597","0.47579032","0.47445166"],"string":"[\n \"0.6403422\",\n \"0.63883287\",\n \"0.57854426\",\n \"0.5650239\",\n \"0.56429785\",\n \"0.5586955\",\n \"0.5580404\",\n \"0.556086\",\n \"0.54912066\",\n \"0.5480425\",\n \"0.5451898\",\n \"0.54312015\",\n \"0.53887993\",\n \"0.53754646\",\n \"0.53143036\",\n \"0.5301165\",\n \"0.5294658\",\n \"0.5280735\",\n \"0.5278442\",\n \"0.5240244\",\n \"0.5239899\",\n \"0.5230232\",\n \"0.5213518\",\n \"0.52075046\",\n \"0.52075046\",\n \"0.5183387\",\n \"0.5165836\",\n \"0.516115\",\n \"0.51376456\",\n \"0.5129679\",\n \"0.5108174\",\n \"0.50984156\",\n \"0.5084778\",\n \"0.50831676\",\n \"0.5069086\",\n \"0.50637084\",\n \"0.50555956\",\n \"0.5053338\",\n \"0.5051102\",\n \"0.50490594\",\n \"0.5047956\",\n \"0.5044336\",\n \"0.5038126\",\n \"0.5032035\",\n \"0.5030088\",\n \"0.50112414\",\n \"0.4983174\",\n \"0.49830648\",\n \"0.49720308\",\n \"0.49711573\",\n \"0.49711522\",\n \"0.49660537\",\n \"0.49630997\",\n \"0.49620187\",\n \"0.49563414\",\n \"0.4954347\",\n \"0.49516672\",\n \"0.49473858\",\n \"0.49442193\",\n \"0.4940017\",\n \"0.493291\",\n \"0.49213514\",\n \"0.49200565\",\n \"0.49132785\",\n \"0.49126375\",\n \"0.49022296\",\n \"0.4890211\",\n \"0.48815486\",\n \"0.48717904\",\n \"0.48675922\",\n \"0.4865742\",\n \"0.48629183\",\n \"0.48581195\",\n \"0.48578772\",\n \"0.48510066\",\n \"0.48456484\",\n \"0.48373416\",\n \"0.48373416\",\n \"0.48373416\",\n \"0.4832739\",\n \"0.48315102\",\n \"0.48315012\",\n \"0.4827201\",\n \"0.48255685\",\n \"0.48254195\",\n \"0.48251018\",\n \"0.48145053\",\n \"0.48082152\",\n \"0.48073664\",\n \"0.48067936\",\n \"0.4804313\",\n \"0.47943884\",\n \"0.47943163\",\n \"0.4783561\",\n \"0.47784102\",\n \"0.47783917\",\n \"0.47738135\",\n \"0.47699732\",\n \"0.47622597\",\n \"0.47579032\",\n \"0.47445166\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4686,"cells":{"query":{"kind":"string","value":"return new, unset BigInteger"},"document":{"kind":"string","value":"function nbi() { return new BigInteger(null); }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function BigInteger(a, b) {\n if (a != null) this.fromString(a, b);\n} // return new, unset BigInteger","clone() {\n return new BigInteger(this.digits.slice());\n }","clone() {\n return new BigInteger(this.digits.slice());\n }","function nbi()\n{\n return new BigInteger(null);\n}","function nbi() {return new BigInteger(null);}","function nbi() {return new BigInteger(null);}","function nbi() {\n return new BigInteger(null);\n}","function nbi() {\n return new BigInteger(null);\n}","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\n return new BigInteger(null);\n }","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function bnClone() {\n var r = nbi();\n this.copyTo(r);\n return r;\n } // (public) return value as integer","function nbi() { return new BigInteger$4(null); }","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\r\n\t return new BigInteger(null);\r\n\t}","function nbi() {\n return new BigInteger(null);\n }","function parseBigInt(b,a){return new BigInteger$5(b,a)}","function BigInteger(n, token) {\n\tif (token !== CONSTRUCT) {\n\t\tif (n instanceof BigInteger) {\n\t\t\treturn n;\n\t\t}\n\t\telse if (typeof n === \"undefined\") {\n\t\t\treturn ZERO;\n\t\t}\n\t\treturn BigInteger.parse(n);\n\t}\n\n\tthis.value = BigInt(n);\n}","function nbi() {\r\n\t return new BigInteger$4(null);\r\n\t}"],"string":"[\n \"function BigInteger(a, b) {\\n if (a != null) this.fromString(a, b);\\n} // return new, unset BigInteger\",\n \"clone() {\\n return new BigInteger(this.digits.slice());\\n }\",\n \"clone() {\\n return new BigInteger(this.digits.slice());\\n }\",\n \"function nbi()\\n{\\n return new BigInteger(null);\\n}\",\n \"function nbi() {return new BigInteger(null);}\",\n \"function nbi() {return new BigInteger(null);}\",\n \"function nbi() {\\n return new BigInteger(null);\\n}\",\n \"function nbi() {\\n return new BigInteger(null);\\n}\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function bnClone() {\\n var r = nbi();\\n this.copyTo(r);\\n return r;\\n } // (public) return value as integer\",\n \"function nbi() { return new BigInteger$4(null); }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\r\\n\\t return new BigInteger(null);\\r\\n\\t}\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function parseBigInt(b,a){return new BigInteger$5(b,a)}\",\n \"function BigInteger(n, token) {\\n\\tif (token !== CONSTRUCT) {\\n\\t\\tif (n instanceof BigInteger) {\\n\\t\\t\\treturn n;\\n\\t\\t}\\n\\t\\telse if (typeof n === \\\"undefined\\\") {\\n\\t\\t\\treturn ZERO;\\n\\t\\t}\\n\\t\\treturn BigInteger.parse(n);\\n\\t}\\n\\n\\tthis.value = BigInt(n);\\n}\",\n \"function nbi() {\\r\\n\\t return new BigInteger$4(null);\\r\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7428058","0.69610363","0.69610363","0.64015156","0.6362602","0.6362602","0.623988","0.623988","0.6111579","0.6111579","0.6111579","0.60725933","0.60725933","0.60725933","0.60725933","0.60725933","0.6041273","0.60077846","0.5987963","0.5987963","0.59745467","0.59428054","0.5888251","0.5725823","0.56917703"],"string":"[\n \"0.7428058\",\n \"0.69610363\",\n \"0.69610363\",\n \"0.64015156\",\n \"0.6362602\",\n \"0.6362602\",\n \"0.623988\",\n \"0.623988\",\n \"0.6111579\",\n \"0.6111579\",\n \"0.6111579\",\n \"0.60725933\",\n \"0.60725933\",\n \"0.60725933\",\n \"0.60725933\",\n \"0.60725933\",\n \"0.6041273\",\n \"0.60077846\",\n \"0.5987963\",\n \"0.5987963\",\n \"0.59745467\",\n \"0.59428054\",\n \"0.5888251\",\n \"0.5725823\",\n \"0.56917703\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6249981"},"document_rank":{"kind":"string","value":"74"}}},{"rowIdx":4687,"cells":{"query":{"kind":"string","value":"am: Compute w_j += (xthis_i), propagate carries, c is initial carry, returns final carry. c < 3dvalue, x < 2dvalue, this_i < dvalue We need to select the fastest one that works in this environment. am1: use a single mult and divide to get the high bits, max digit bits should be 26 because max internal value = 2dvalue^22dvalue (< 2^53)"},"document":{"kind":"string","value":"function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\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 am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n\n return c;\n} // am2 avoids a big mult-and-extract completely.","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n\n return c;\n } // am2 avoids a big mult-and-extract completely.","function am1(i, x, w, j, c, n)\n{\n while (--n >= 0)\n {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c\n c = Math.floor(v / 0x4000000)\n w[j++] = v & 0x3ffffff\n }\n return c\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c\n c = Math.floor(v / 0x4000000)\n w[j++] = v & 0x3ffffff\n }\n return c\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c\n c = Math.floor(v / 0x4000000)\n w[j++] = v & 0x3ffffff\n }\n return c\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c\n c = Math.floor(v / 0x4000000)\n w[j++] = v & 0x3ffffff\n }\n return c\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c\n c = Math.floor(v / 0x4000000)\n w[j++] = v & 0x3ffffff\n }\n return c\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c\n c = Math.floor(v / 0x4000000)\n w[j++] = v & 0x3ffffff\n }\n return c\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c\n c = Math.floor(v / 0x4000000)\n w[j++] = v & 0x3ffffff\n }\n return c\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n){while(--n>=0){var v=x*this[i++]+w[j]+c;c=Math.floor(v/0x4000000);w[j++]=v&0x3ffffff;}return c;}// am2 avoids a big mult-and-extract completely.","function carry_(x) {\n var i,k,c,b;\n k=x.length;\n c=0;\n for (i=0;i<k;i++) {\n c+=x[i];\n b=0;\n if (c<0) {\n b = c & mask;\n b = -((c - b) / radix);\n c+=b*radix;\n }\n x[i]=c & mask;\n c = ((c - x[i]) / radix) - b;\n }\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 67108864);\n w[j++] = v & 67108863;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this.data[i++]+w.data[j]+c;\n c = Math.floor(v/0x4000000);\n w.data[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\r\n\t while (--n >= 0) {\r\n\t var v = x * this[i++] + w[j] + c;\r\n\t c = Math.floor(v / 0x4000000);\r\n\t w[j++] = v & 0x3ffffff;\r\n\t }\r\n\t return c;\r\n\t}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n}","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i,x,w,j,c,n) {\n while(--n >= 0) {\n var v = x*this[i++]+w[j]+c;\n c = Math.floor(v/0x4000000);\n w[j++] = v&0x3ffffff;\n }\n return c;\n }","function am1(i, x, w, j, c, n) {\n\t while (--n >= 0) {\n\t var v = x * this[i++] + w[j] + c\n\t c = Math.floor(v / 0x4000000)\n\t w[j++] = v & 0x3ffffff\n\t }\n\t return c\n\t}","function am1(i, x, w, j, c, n) {\n\t while (--n >= 0) {\n\t var v = x * this[i++] + w[j] + c\n\t c = Math.floor(v / 0x4000000)\n\t w[j++] = v & 0x3ffffff\n\t }\n\t return c\n\t}","function am1(i, x, w, j, c, n) {\n\t\twhile (--n >= 0) {\n\t\t\tvar v = x * this[i++] + w[j] + c;\n\t\t\tc = Math.floor(v / 0x4000000);\n\t\t\tw[j++] = v & 0x3ffffff;\n\t\t}\n\t\treturn c;\n\t}","function am1(i,x,w,j,c,n) {\n\t while(--n >= 0) {\n\t var v = x*this[i++]+w[j]+c;\n\t c = Math.floor(v/0x4000000);\n\t w[j++] = v&0x3ffffff;\n\t }\n\t return c;\n\t }","function am1(i,x,w,j,c,n) {\n\t while(--n >= 0) {\n\t var v = x*this[i++]+w[j]+c;\n\t c = Math.floor(v/0x4000000);\n\t w[j++] = v&0x3ffffff;\n\t }\n\t return c;\n\t }","function am1(i,x,w,j,c,n) {\n\twhile(--n >= 0) {\n\t var v = x*this[i++]+w[j]+c;\n\t c = Math.floor(v/0x4000000);\n\t w[j++] = v&0x3ffffff;\n\t}\n\treturn c;\n }","function carry_(x) {\n var i, k, c, b;\n k = x.length;\n c = 0;\n for (i = 0; i < k; i++) {\n c += x[i];\n b = 0;\n if (c < 0) {\n b = -(c >> bpe);\n c += b * radix;\n }\n x[i] = c & mask;\n c = (c >> bpe) - b;\n }\n }","function am1(i,x,w,j,c,n) {\n\t while(--n >= 0) {\n\t var v = x*this.data[i++]+w.data[j]+c;\n\t c = Math.floor(v/0x4000000);\n\t w.data[j++] = v&0x3ffffff;\n\t }\n\t return c;\n\t}"],"string":"[\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n\\n return c;\\n} // am2 avoids a big mult-and-extract completely.\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n\\n return c;\\n } // am2 avoids a big mult-and-extract completely.\",\n \"function am1(i, x, w, j, c, n)\\n{\\n while (--n >= 0)\\n {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c\\n c = Math.floor(v / 0x4000000)\\n w[j++] = v & 0x3ffffff\\n }\\n return c\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c\\n c = Math.floor(v / 0x4000000)\\n w[j++] = v & 0x3ffffff\\n }\\n return c\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c\\n c = Math.floor(v / 0x4000000)\\n w[j++] = v & 0x3ffffff\\n }\\n return c\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c\\n c = Math.floor(v / 0x4000000)\\n w[j++] = v & 0x3ffffff\\n }\\n return c\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c\\n c = Math.floor(v / 0x4000000)\\n w[j++] = v & 0x3ffffff\\n }\\n return c\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c\\n c = Math.floor(v / 0x4000000)\\n w[j++] = v & 0x3ffffff\\n }\\n return c\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c\\n c = Math.floor(v / 0x4000000)\\n w[j++] = v & 0x3ffffff\\n }\\n return c\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n){while(--n>=0){var v=x*this[i++]+w[j]+c;c=Math.floor(v/0x4000000);w[j++]=v&0x3ffffff;}return c;}// am2 avoids a big mult-and-extract completely.\",\n \"function carry_(x) {\\n var i,k,c,b;\\n k=x.length;\\n c=0;\\n for (i=0;i<k;i++) {\\n c+=x[i];\\n b=0;\\n if (c<0) {\\n b = c & mask;\\n b = -((c - b) / radix);\\n c+=b*radix;\\n }\\n x[i]=c & mask;\\n c = ((c - x[i]) / radix) - b;\\n }\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 67108864);\\n w[j++] = v & 67108863;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this.data[i++]+w.data[j]+c;\\n c = Math.floor(v/0x4000000);\\n w.data[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i, x, w, j, c, n) {\\n while (--n >= 0) {\\n var v = x * this[i++] + w[j] + c;\\n c = Math.floor(v / 0x4000000);\\n w[j++] = v & 0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\r\\n\\t while (--n >= 0) {\\r\\n\\t var v = x * this[i++] + w[j] + c;\\r\\n\\t c = Math.floor(v / 0x4000000);\\r\\n\\t w[j++] = v & 0x3ffffff;\\r\\n\\t }\\r\\n\\t return c;\\r\\n\\t}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n}\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n while(--n >= 0) {\\n var v = x*this[i++]+w[j]+c;\\n c = Math.floor(v/0x4000000);\\n w[j++] = v&0x3ffffff;\\n }\\n return c;\\n }\",\n \"function am1(i, x, w, j, c, n) {\\n\\t while (--n >= 0) {\\n\\t var v = x * this[i++] + w[j] + c\\n\\t c = Math.floor(v / 0x4000000)\\n\\t w[j++] = v & 0x3ffffff\\n\\t }\\n\\t return c\\n\\t}\",\n \"function am1(i, x, w, j, c, n) {\\n\\t while (--n >= 0) {\\n\\t var v = x * this[i++] + w[j] + c\\n\\t c = Math.floor(v / 0x4000000)\\n\\t w[j++] = v & 0x3ffffff\\n\\t }\\n\\t return c\\n\\t}\",\n \"function am1(i, x, w, j, c, n) {\\n\\t\\twhile (--n >= 0) {\\n\\t\\t\\tvar v = x * this[i++] + w[j] + c;\\n\\t\\t\\tc = Math.floor(v / 0x4000000);\\n\\t\\t\\tw[j++] = v & 0x3ffffff;\\n\\t\\t}\\n\\t\\treturn c;\\n\\t}\",\n \"function am1(i,x,w,j,c,n) {\\n\\t while(--n >= 0) {\\n\\t var v = x*this[i++]+w[j]+c;\\n\\t c = Math.floor(v/0x4000000);\\n\\t w[j++] = v&0x3ffffff;\\n\\t }\\n\\t return c;\\n\\t }\",\n \"function am1(i,x,w,j,c,n) {\\n\\t while(--n >= 0) {\\n\\t var v = x*this[i++]+w[j]+c;\\n\\t c = Math.floor(v/0x4000000);\\n\\t w[j++] = v&0x3ffffff;\\n\\t }\\n\\t return c;\\n\\t }\",\n \"function am1(i,x,w,j,c,n) {\\n\\twhile(--n >= 0) {\\n\\t var v = x*this[i++]+w[j]+c;\\n\\t c = Math.floor(v/0x4000000);\\n\\t w[j++] = v&0x3ffffff;\\n\\t}\\n\\treturn c;\\n }\",\n \"function carry_(x) {\\n var i, k, c, b;\\n k = x.length;\\n c = 0;\\n for (i = 0; i < k; i++) {\\n c += x[i];\\n b = 0;\\n if (c < 0) {\\n b = -(c >> bpe);\\n c += b * radix;\\n }\\n x[i] = c & mask;\\n c = (c >> bpe) - b;\\n }\\n }\",\n \"function am1(i,x,w,j,c,n) {\\n\\t while(--n >= 0) {\\n\\t var v = x*this.data[i++]+w.data[j]+c;\\n\\t c = Math.floor(v/0x4000000);\\n\\t w.data[j++] = v&0x3ffffff;\\n\\t }\\n\\t return c;\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.72942585","0.7269491","0.72358465","0.7231032","0.7231032","0.7231032","0.7231032","0.7231032","0.7231032","0.7231032","0.7170475","0.7158511","0.7143046","0.71355367","0.7131832","0.7131832","0.7131832","0.7131832","0.7131832","0.7124021","0.7124021","0.7124021","0.71101344","0.7106192","0.7106192","0.7106192","0.7106192","0.7106192","0.7106192","0.7106192","0.7106192","0.7106192","0.7086735","0.7060987","0.7042843","0.7042843","0.7042843","0.7042843","0.7042843","0.7042843","0.7042843","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70332944","0.70303684","0.70303684","0.6987878","0.69594735","0.69594735","0.69547474","0.69399786","0.69156915"],"string":"[\n \"0.72942585\",\n \"0.7269491\",\n \"0.72358465\",\n \"0.7231032\",\n \"0.7231032\",\n \"0.7231032\",\n \"0.7231032\",\n \"0.7231032\",\n \"0.7231032\",\n \"0.7231032\",\n \"0.7170475\",\n \"0.7158511\",\n \"0.7143046\",\n \"0.71355367\",\n \"0.7131832\",\n \"0.7131832\",\n \"0.7131832\",\n \"0.7131832\",\n \"0.7131832\",\n \"0.7124021\",\n \"0.7124021\",\n \"0.7124021\",\n \"0.71101344\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7106192\",\n \"0.7086735\",\n \"0.7060987\",\n \"0.7042843\",\n \"0.7042843\",\n \"0.7042843\",\n \"0.7042843\",\n \"0.7042843\",\n \"0.7042843\",\n \"0.7042843\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70332944\",\n \"0.70303684\",\n \"0.70303684\",\n \"0.6987878\",\n \"0.69594735\",\n \"0.69594735\",\n \"0.69547474\",\n \"0.69399786\",\n \"0.69156915\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7009762"},"document_rank":{"kind":"string","value":"86"}}},{"rowIdx":4688,"cells":{"query":{"kind":"string","value":"am2 avoids a big multandextract completely. Max digit bits should be <= 30 because we do bitwise ops on values up to 2hdvalue^2hdvalue1 (< 2^31)"},"document":{"kind":"string","value":"function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\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 am2(i,x,w,j,c,n){var xl=x&0x7fff,xh=x>>15;while(--n>=0){var l=this[i]&0x7fff;var h=this[i++]>>15;var m=xh*l+h*xl;l=xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);c=(l>>>30)+(m>>>15)+xh*h+(c>>>30);w[j++]=l&0x3fffffff;}return c;}// Alternately, set max digit bits to 28 since some","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n\n return c;\n } // Alternately, set max digit bits to 28 since some","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n\n return c;\n} // Alternately, set max digit bits to 28 since some","function am1(i,x,w,j,c,n){while(--n>=0){var v=x*this[i++]+w[j]+c;c=Math.floor(v/0x4000000);w[j++]=v&0x3ffffff;}return c;}// am2 avoids a big mult-and-extract completely.","function am2(i,x,w,j,c,n) {\n\t var xl = x&0x7fff, xh = x>>15;\n\t while(--n >= 0) {\n\t var l = this[i]&0x7fff;\n\t var h = this[i++]>>15;\n\t var m = xh*l+h*xl;\n\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n\t w[j++] = l&0x3fffffff;\n\t }\n\t return c;\n\t }","function am2(i,x,w,j,c,n) {\n\t var xl = x&0x7fff, xh = x>>15;\n\t while(--n >= 0) {\n\t var l = this[i]&0x7fff;\n\t var h = this[i++]>>15;\n\t var m = xh*l+h*xl;\n\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n\t w[j++] = l&0x3fffffff;\n\t }\n\t return c;\n\t }","function am2(i, x, w, j, c, n) {\n var xl = x & 32767,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 32767;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 32767) << 15) + w[j] + (c & 1073741823);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 1073741823;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n\tvar xl = x&0x7fff, xh = x>>15;\n\twhile(--n >= 0) {\n\t var l = this[i]&0x7fff;\n\t var h = this[i++]>>15;\n\t var m = xh*l+h*xl;\n\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n\t w[j++] = l&0x3fffffff;\n\t}\n\treturn c;\n }","function am2(i,x,w,j,c,n) {\n\t var xl = x&0x7fff, xh = x>>15;\n\t while(--n >= 0) {\n\t\tvar l = this[i]&0x7fff;\n\t\tvar h = this[i++]>>15;\n\t\tvar m = xh*l+h*xl;\n\t\tl = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n\t\tc = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n\t\tw[j++] = l&0x3fffffff;\n\t }\n\t return c;\n\t}","function convertBits2(a, b) { \n return ((a ^ b).toString(2).match(/1/g) || []).length\n}","decodeMagnitudeAndBits(magnitude, bits) {\n const power = 1 << (magnitude - 1);\n if (bits >= power) {\n return bits;\n } else {\n return bits - (power * 2) + 1;\n }\n }","function am2(i, x, w, j, c, n) {\n\t var xl = x & 0x7fff,\n\t xh = x >> 15\n\t while (--n >= 0) {\n\t var l = this[i] & 0x7fff\n\t var h = this[i++] >> 15\n\t var m = xh * l + h * xl\n\t l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff)\n\t c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30)\n\t w[j++] = l & 0x3fffffff\n\t }\n\t return c\n\t}","function am2(i, x, w, j, c, n) {\n\t var xl = x & 0x7fff,\n\t xh = x >> 15\n\t while (--n >= 0) {\n\t var l = this[i] & 0x7fff\n\t var h = this[i++] >> 15\n\t var m = xh * l + h * xl\n\t l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff)\n\t c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30)\n\t w[j++] = l & 0x3fffffff\n\t }\n\t return c\n\t}","function am2(i,x,w,j,c,n) {\n\t var xl = x&0x7fff, xh = x>>15;\n\t while(--n >= 0) {\n\t var l = this[i]&0x7fff;\n\t var h = this[i++]>>15;\n\t var m = xh*l+h*xl;\n\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n\t w[j++] = l&0x3fffffff;\n\t }\n\t return c;\n\t}","function fnv_1a_b(a) {\n a += (a << 1) + (a << 4) + (a << 7) + (a << 8) + (a << 24);\n a += a << 13;\n a ^= a >> 7;\n a += a << 3;\n a ^= a >> 17;\n a += a << 5;\n return a & 0xffffffff;\n}","function am2(i, x, w, j, c, n) {\n\t\tvar xl = x & 0x7fff, xh = x >> 15;\n\t\twhile (--n >= 0) {\n\t\t\tvar l = this[i] & 0x7fff;\n\t\t\tvar h = this[i++] >> 15;\n\t\t\tvar m = xh * l + h * xl;\n\t\t\tl = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n\t\t\tc = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n\t\t\tw[j++] = l & 0x3fffffff;\n\t\t}\n\t\treturn c;\n\t}","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff;\n var xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff;\n var xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this[i]&0x7fff;\n var h = this[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function intakeBits(amt){\r\n\r\n}","function am2(i,x,w,j,c,n) {\n\t var xl = x&0x7fff, xh = x>>15;\n\t while(--n >= 0) {\n\t var l = this[i]&0x7fff;\n\t var h = this[i++]>>15;\n\t var m = xh*l+h*xl;\n\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n\t w[j++] = l&0x3fffffff;\n\t }\n\t return c;\n\t }","function am2(i, x, w, j, c, n) {\r\n\t var xl = x & 0x7fff, xh = x >> 15;\r\n\t while (--n >= 0) {\r\n\t var l = this[i] & 0x7fff;\r\n\t var h = this[i++] >> 15;\r\n\t var m = xh * l + h * xl;\r\n\t l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\r\n\t c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\r\n\t w[j++] = l & 0x3fffffff;\r\n\t }\r\n\t return c;\r\n\t}","_sha1FT(_t, _b, _c, _d) {\n if (_t < 20) {\n return (_b & _c) | ((~_b) & _d);\n }\n if (_t < 40) {\n return _b ^ _c ^ _d;\n }\n if (_t < 60) {\n return (_b & _c) | (_b & _d) | (_c & _d);\n }\n return _b ^ _c ^ _d;\n }","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function am2(i,x,w,j,c,n) {\n\t var xl = x&0x7fff, xh = x>>15;\n\t while(--n >= 0) {\n\t var l = this.data[i]&0x7fff;\n\t var h = this.data[i++]>>15;\n\t var m = xh*l+h*xl;\n\t l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n\t w.data[j++] = l&0x3fffffff;\n\t }\n\t return c;\n\t}","function msfix1(gfc) {\n for (var sb = 0; sb < Encoder.SBMAX_l; sb++) {\n /* use this fix if L & R masking differs by 2db or less */\n /* if db = 10*log10(x2/x1) < 2 */\n /* if (x2 < 1.58*x1) { */\n if (gfc.thm[0].l[sb] > 1.58 * gfc.thm[1].l[sb]\n || gfc.thm[1].l[sb] > 1.58 * gfc.thm[0].l[sb])\n continue;\n var mld = gfc.mld_l[sb] * gfc.en[3].l[sb];\n var rmid = Math.max(gfc.thm[2].l[sb],\n Math.min(gfc.thm[3].l[sb], mld));\n\n mld = gfc.mld_l[sb] * gfc.en[2].l[sb];\n var rside = Math.max(gfc.thm[3].l[sb],\n Math.min(gfc.thm[2].l[sb], mld));\n gfc.thm[2].l[sb] = rmid;\n gfc.thm[3].l[sb] = rside;\n }\n\n for (var sb = 0; sb < Encoder.SBMAX_s; sb++) {\n for (var sblock = 0; sblock < 3; sblock++) {\n if (gfc.thm[0].s[sb][sblock] > 1.58 * gfc.thm[1].s[sb][sblock]\n || gfc.thm[1].s[sb][sblock] > 1.58 * gfc.thm[0].s[sb][sblock])\n continue;\n var mld = gfc.mld_s[sb] * gfc.en[3].s[sb][sblock];\n var rmid = Math.max(gfc.thm[2].s[sb][sblock],\n Math.min(gfc.thm[3].s[sb][sblock], mld));\n\n mld = gfc.mld_s[sb] * gfc.en[2].s[sb][sblock];\n var rside = Math.max(gfc.thm[3].s[sb][sblock],\n Math.min(gfc.thm[2].s[sb][sblock], mld));\n\n gfc.thm[2].s[sb][sblock] = rmid;\n gfc.thm[3].s[sb][sblock] = rside;\n }\n }\n }","function msfix1(gfc) {\n for (var sb = 0; sb < Encoder.SBMAX_l; sb++) {\n /* use this fix if L & R masking differs by 2db or less */\n /* if db = 10*log10(x2/x1) < 2 */\n /* if (x2 < 1.58*x1) { */\n if (gfc.thm[0].l[sb] > 1.58 * gfc.thm[1].l[sb]\n || gfc.thm[1].l[sb] > 1.58 * gfc.thm[0].l[sb])\n continue;\n var mld = gfc.mld_l[sb] * gfc.en[3].l[sb];\n var rmid = Math.max(gfc.thm[2].l[sb],\n Math.min(gfc.thm[3].l[sb], mld));\n\n mld = gfc.mld_l[sb] * gfc.en[2].l[sb];\n var rside = Math.max(gfc.thm[3].l[sb],\n Math.min(gfc.thm[2].l[sb], mld));\n gfc.thm[2].l[sb] = rmid;\n gfc.thm[3].l[sb] = rside;\n }\n\n for (var sb = 0; sb < Encoder.SBMAX_s; sb++) {\n for (var sblock = 0; sblock < 3; sblock++) {\n if (gfc.thm[0].s[sb][sblock] > 1.58 * gfc.thm[1].s[sb][sblock]\n || gfc.thm[1].s[sb][sblock] > 1.58 * gfc.thm[0].s[sb][sblock])\n continue;\n var mld = gfc.mld_s[sb] * gfc.en[3].s[sb][sblock];\n var rmid = Math.max(gfc.thm[2].s[sb][sblock],\n Math.min(gfc.thm[3].s[sb][sblock], mld));\n\n mld = gfc.mld_s[sb] * gfc.en[2].s[sb][sblock];\n var rside = Math.max(gfc.thm[3].s[sb][sblock],\n Math.min(gfc.thm[2].s[sb][sblock], mld));\n\n gfc.thm[2].s[sb][sblock] = rmid;\n gfc.thm[3].s[sb][sblock] = rside;\n }\n }\n }","function am2(i, x, w, j, c, n)\n{\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0)\n {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n}","function am2(i, x, w, j, c, n) {\n var xl = x & 0x7fff,\n xh = x >> 15;\n while (--n >= 0) {\n var l = this[i] & 0x7fff;\n var h = this[i++] >> 15;\n var m = xh * l + h * xl;\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\n w[j++] = l & 0x3fffffff;\n }\n return c;\n }","function twoToThe(m) {\n var b = Math.floor(m / bpe) + 2\n var t = new Array(b)\n for (var i = 0; i < b; i++) t[i] = 0\n t[b - 2] = 1 << (m % bpe)\n return t\n }","function bytes2(b1, b2) {\n /* U+0080..U+07FF */\n /* 00000000 00000yyy yyxxxxxx | 110yyyyy 10xxxxxx */\n if ((b2 & 0xc0) !== 0x80) {\n return TRAILING;\n }\n const x = ((b1 & mask[5]) << 6) + (b2 & mask[6]);\n if (x < 0x80) {\n return NON_SHORTEST;\n }\n return x;\n }","function A7(){return function(n){var e=Uint8Array,t=Uint16Array,i=Uint32Array,r=new e([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0,0]),s=new e([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13,0,0]),o=new e([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),a=function(V,W){for(var F=new t(31),J=0;J<31;++J)F[J]=W+=1<<V[J-1];var K=new i(F[30]);for(J=1;J<30;++J)for(var ue=F[J];ue<F[J+1];++ue)K[ue]=ue-F[J]<<5|J;return[F,K]},l=a(r,2),c=l[0],d=l[1];c[28]=258,d[258]=28;for(var h=a(s,0)[0],p=new t(32768),m=0;m<32768;++m){var v=(43690&m)>>>1|(21845&m)<<1;v=(61680&(v=(52428&v)>>>2|(13107&v)<<2))>>>4|(3855&v)<<4,p[m]=((65280&v)>>>8|(255&v)<<8)>>>1}var y=function(V,W,F){for(var J=V.length,K=0,ue=new t(W);K<J;++K)++ue[V[K]-1];var O,U=new t(W);for(K=0;K<W;++K)U[K]=U[K-1]+ue[K-1]<<1;if(F){O=new t(1<<W);var X=15-W;for(K=0;K<J;++K)if(V[K])for(var D=K<<4|V[K],G=W-V[K],$=U[V[K]-1]++<<G,ne=$|(1<<G)-1;$<=ne;++$)O[p[$]>>>X]=D}else for(O=new t(J),K=0;K<J;++K)V[K]&&(O[K]=p[U[V[K]-1]++]>>>15-V[K]);return O},x=new e(288);for(m=0;m<144;++m)x[m]=8;for(m=144;m<256;++m)x[m]=9;for(m=256;m<280;++m)x[m]=7;for(m=280;m<288;++m)x[m]=8;var w=new e(32);for(m=0;m<32;++m)w[m]=5;var _=y(x,9,1),S=y(w,5,1),b=function(V){for(var W=V[0],F=1;F<V.length;++F)V[F]>W&&(W=V[F]);return W},T=function(V,W,F){var J=W/8|0;return(V[J]|V[J+1]<<8)>>(7&W)&F},A=function(V,W){var F=W/8|0;return(V[F]|V[F+1]<<8|V[F+2]<<16)>>(7&W)},L=[\"unexpected EOF\",\"invalid block type\",\"invalid length/literal\",\"invalid distance\",\"stream finished\",\"no stream handler\",,\"no callback\",\"invalid UTF-8 data\",\"extra field too long\",\"date not in range 1980-2099\",\"filename too long\",\"stream finishing\",\"invalid zip data\"],C=function(V,W,F){var J=new Error(W||L[V]);if(J.code=V,Error.captureStackTrace&&Error.captureStackTrace(J,C),!F)throw J;return J},R=function(V,W,F){var J=V.length;if(!J||F&&!F.l&&J<5)return W||new e(0);var K=!W||F,ue=!F||F.i;F||(F={}),W||(W=new e(3*J));var O,U=function(xe){var Ge=W.length;if(xe>Ge){var Ke=new e(Math.max(2*Ge,xe));Ke.set(W),W=Ke}},X=F.f||0,D=F.p||0,G=F.b||0,$=F.l,ne=F.d,ie=F.m,q=F.n,fe=8*J;do{if(!$){F.f=X=T(V,D,1);var de=T(V,D+1,3);if(D+=3,!de){var Ae=V[(Ue=((O=D)/8|0)+(7&O&&1)+4)-4]|V[Ue-3]<<8,Me=Ue+Ae;if(Me>J){ue&&C(0);break}K&&U(G+Ae),W.set(V.subarray(Ue,Me),G),F.b=G+=Ae,F.p=D=8*Me;continue}if(de==1)$=_,ne=S,ie=9,q=5;else if(de==2){var Pe=T(V,D,31)+257,Q=T(V,D+10,15)+4,ce=Pe+T(V,D+5,31)+1;D+=14;for(var Le=new e(ce),Ie=new e(19),Ee=0;Ee<Q;++Ee)Ie[o[Ee]]=T(V,D+3*Ee,7);D+=3*Q;var je=b(Ie),we=(1<<je)-1,ze=y(Ie,je,1);for(Ee=0;Ee<ce;){var Ue,Se=ze[T(V,D,we)];if(D+=15&Se,(Ue=Se>>>4)<16)Le[Ee++]=Ue;else{var z=0,I=0;for(Ue==16?(I=3+T(V,D,3),D+=2,z=Le[Ee-1]):Ue==17?(I=3+T(V,D,7),D+=3):Ue==18&&(I=11+T(V,D,127),D+=7);I--;)Le[Ee++]=z}}var te=Le.subarray(0,Pe),pe=Le.subarray(Pe);ie=b(te),q=b(pe),$=y(te,ie,1),ne=y(pe,q,1)}else C(1);if(D>fe){ue&&C(0);break}}K&&U(G+131072);for(var De=(1<<ie)-1,Oe=(1<<q)-1,Ne=D;;Ne=D){var Fe=(z=$[A(V,D)&De])>>>4;if((D+=15&z)>fe){ue&&C(0);break}if(z||C(2),Fe<256)W[G++]=Fe;else{if(Fe==256){Ne=D,$=null;break}var ge=Fe-254;if(Fe>264){var We=r[Ee=Fe-257];ge=T(V,D,(1<<We)-1)+c[Ee],D+=We}var Y=ne[A(V,D)&Oe],le=Y>>>4;if(Y||C(3),D+=15&Y,pe=h[le],le>3&&(We=s[le],pe+=A(V,D)&(1<<We)-1,D+=We),D>fe){ue&&C(0);break}K&&U(G+131072);for(var ve=G+ge;G<ve;G+=4)W[G]=W[G-pe],W[G+1]=W[G+1-pe],W[G+2]=W[G+2-pe],W[G+3]=W[G+3-pe];G=ve}}F.l=$,F.p=Ne,F.b=G,$&&(X=1,F.m=ie,F.d=ne,F.n=q)}while(!X);return G==W.length?W:function(xe,Ge,Ke){(Ge==null||Ge<0)&&(Ge=0),(Ke==null||Ke>xe.length)&&(Ke=xe.length);var ut=new(xe instanceof t?t:xe instanceof i?i:e)(Ke-Ge);return ut.set(xe.subarray(Ge,Ke)),ut}(W,0,G)},k=new e(0),H=typeof TextDecoder<\"u\"&&new TextDecoder;try{H.decode(k,{stream:!0})}catch{}return n.convert_streams=function(V){var W=new DataView(V),F=0;function J(){var Pe=W.getUint16(F);return F+=2,Pe}function K(){var Pe=W.getUint32(F);return F+=4,Pe}function ue(Pe){Ae.setUint16(Me,Pe),Me+=2}function O(Pe){Ae.setUint32(Me,Pe),Me+=4}for(var U={signature:K(),flavor:K(),length:K(),numTables:J(),reserved:J(),totalSfntSize:K(),majorVersion:J(),minorVersion:J(),metaOffset:K(),metaLength:K(),metaOrigLength:K(),privOffset:K(),privLength:K()},X=0;Math.pow(2,X)<=U.numTables;)X++;X--;for(var D=16*Math.pow(2,X),G=16*U.numTables-D,$=12,ne=[],ie=0;ie<U.numTables;ie++)ne.push({tag:K(),offset:K(),compLength:K(),origLength:K(),origChecksum:K()}),$+=16;var q,fe=new Uint8Array(12+16*ne.length+ne.reduce(function(Pe,Q){return Pe+Q.origLength+4},0)),de=fe.buffer,Ae=new DataView(de),Me=0;return O(U.flavor),ue(U.numTables),ue(D),ue(X),ue(G),ne.forEach(function(Pe){O(Pe.tag),O(Pe.origChecksum),O($),O(Pe.origLength),Pe.outOffset=$,($+=Pe.origLength)%4!=0&&($+=4-$%4)}),ne.forEach(function(Pe){var Q,ce=V.slice(Pe.offset,Pe.offset+Pe.compLength);if(Pe.compLength!=Pe.origLength){var Le=new Uint8Array(Pe.origLength);Q=new Uint8Array(ce,2),R(Q,Le)}else Le=new Uint8Array(ce);fe.set(Le,Pe.outOffset);var Ie=0;($=Pe.outOffset+Pe.origLength)%4!=0&&(Ie=4-$%4),fe.set(new Uint8Array(Ie).buffer,Pe.outOffset+Pe.origLength),q=$+Ie}),de.slice(0,q)},Object.defineProperty(n,\"__esModule\",{value:!0}),n}({}).convert_streams}","function sha1_ft(t, b, c, d) {\n\t if (t < 20) {\n\t return (b & c) | ((~b) & d);\n\t }\n\t if (t < 40) {\n\t return b ^ c ^ d;\n\t }\n\t if (t < 60) {\n\t return (b & c) | (b & d) | (c & d);\n\t }\n\t return b ^ c ^ d;\n\t }","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this.data[i]&0x7fff;\n var h = this.data[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w.data[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this.data[i]&0x7fff;\n var h = this.data[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w.data[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this.data[i]&0x7fff;\n var h = this.data[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w.data[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this.data[i]&0x7fff;\n var h = this.data[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w.data[j++] = l&0x3fffffff;\n }\n return c;\n}","function am2(i,x,w,j,c,n) {\n var xl = x&0x7fff, xh = x>>15;\n while(--n >= 0) {\n var l = this.data[i]&0x7fff;\n var h = this.data[i++]>>15;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n w.data[j++] = l&0x3fffffff;\n }\n return c;\n}"],"string":"[\n \"function am2(i,x,w,j,c,n){var xl=x&0x7fff,xh=x>>15;while(--n>=0){var l=this[i]&0x7fff;var h=this[i++]>>15;var m=xh*l+h*xl;l=xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);c=(l>>>30)+(m>>>15)+xh*h+(c>>>30);w[j++]=l&0x3fffffff;}return c;}// Alternately, set max digit bits to 28 since some\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n\\n return c;\\n } // Alternately, set max digit bits to 28 since some\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n\\n return c;\\n} // Alternately, set max digit bits to 28 since some\",\n \"function am1(i,x,w,j,c,n){while(--n>=0){var v=x*this[i++]+w[j]+c;c=Math.floor(v/0x4000000);w[j++]=v&0x3ffffff;}return c;}// am2 avoids a big mult-and-extract completely.\",\n \"function am2(i,x,w,j,c,n) {\\n\\t var xl = x&0x7fff, xh = x>>15;\\n\\t while(--n >= 0) {\\n\\t var l = this[i]&0x7fff;\\n\\t var h = this[i++]>>15;\\n\\t var m = xh*l+h*xl;\\n\\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n\\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n\\t w[j++] = l&0x3fffffff;\\n\\t }\\n\\t return c;\\n\\t }\",\n \"function am2(i,x,w,j,c,n) {\\n\\t var xl = x&0x7fff, xh = x>>15;\\n\\t while(--n >= 0) {\\n\\t var l = this[i]&0x7fff;\\n\\t var h = this[i++]>>15;\\n\\t var m = xh*l+h*xl;\\n\\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n\\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n\\t w[j++] = l&0x3fffffff;\\n\\t }\\n\\t return c;\\n\\t }\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 32767,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 32767;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 32767) << 15) + w[j] + (c & 1073741823);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 1073741823;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n\\tvar xl = x&0x7fff, xh = x>>15;\\n\\twhile(--n >= 0) {\\n\\t var l = this[i]&0x7fff;\\n\\t var h = this[i++]>>15;\\n\\t var m = xh*l+h*xl;\\n\\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n\\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n\\t w[j++] = l&0x3fffffff;\\n\\t}\\n\\treturn c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n\\t var xl = x&0x7fff, xh = x>>15;\\n\\t while(--n >= 0) {\\n\\t\\tvar l = this[i]&0x7fff;\\n\\t\\tvar h = this[i++]>>15;\\n\\t\\tvar m = xh*l+h*xl;\\n\\t\\tl = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n\\t\\tc = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n\\t\\tw[j++] = l&0x3fffffff;\\n\\t }\\n\\t return c;\\n\\t}\",\n \"function convertBits2(a, b) { \\n return ((a ^ b).toString(2).match(/1/g) || []).length\\n}\",\n \"decodeMagnitudeAndBits(magnitude, bits) {\\n const power = 1 << (magnitude - 1);\\n if (bits >= power) {\\n return bits;\\n } else {\\n return bits - (power * 2) + 1;\\n }\\n }\",\n \"function am2(i, x, w, j, c, n) {\\n\\t var xl = x & 0x7fff,\\n\\t xh = x >> 15\\n\\t while (--n >= 0) {\\n\\t var l = this[i] & 0x7fff\\n\\t var h = this[i++] >> 15\\n\\t var m = xh * l + h * xl\\n\\t l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff)\\n\\t c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30)\\n\\t w[j++] = l & 0x3fffffff\\n\\t }\\n\\t return c\\n\\t}\",\n \"function am2(i, x, w, j, c, n) {\\n\\t var xl = x & 0x7fff,\\n\\t xh = x >> 15\\n\\t while (--n >= 0) {\\n\\t var l = this[i] & 0x7fff\\n\\t var h = this[i++] >> 15\\n\\t var m = xh * l + h * xl\\n\\t l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff)\\n\\t c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30)\\n\\t w[j++] = l & 0x3fffffff\\n\\t }\\n\\t return c\\n\\t}\",\n \"function am2(i,x,w,j,c,n) {\\n\\t var xl = x&0x7fff, xh = x>>15;\\n\\t while(--n >= 0) {\\n\\t var l = this[i]&0x7fff;\\n\\t var h = this[i++]>>15;\\n\\t var m = xh*l+h*xl;\\n\\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n\\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n\\t w[j++] = l&0x3fffffff;\\n\\t }\\n\\t return c;\\n\\t}\",\n \"function fnv_1a_b(a) {\\n a += (a << 1) + (a << 4) + (a << 7) + (a << 8) + (a << 24);\\n a += a << 13;\\n a ^= a >> 7;\\n a += a << 3;\\n a ^= a >> 17;\\n a += a << 5;\\n return a & 0xffffffff;\\n}\",\n \"function am2(i, x, w, j, c, n) {\\n\\t\\tvar xl = x & 0x7fff, xh = x >> 15;\\n\\t\\twhile (--n >= 0) {\\n\\t\\t\\tvar l = this[i] & 0x7fff;\\n\\t\\t\\tvar h = this[i++] >> 15;\\n\\t\\t\\tvar m = xh * l + h * xl;\\n\\t\\t\\tl = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n\\t\\t\\tc = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n\\t\\t\\tw[j++] = l & 0x3fffffff;\\n\\t\\t}\\n\\t\\treturn c;\\n\\t}\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff;\\n var xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff;\\n var xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this[i]&0x7fff;\\n var h = this[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function intakeBits(amt){\\r\\n\\r\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n\\t var xl = x&0x7fff, xh = x>>15;\\n\\t while(--n >= 0) {\\n\\t var l = this[i]&0x7fff;\\n\\t var h = this[i++]>>15;\\n\\t var m = xh*l+h*xl;\\n\\t l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\\n\\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n\\t w[j++] = l&0x3fffffff;\\n\\t }\\n\\t return c;\\n\\t }\",\n \"function am2(i, x, w, j, c, n) {\\r\\n\\t var xl = x & 0x7fff, xh = x >> 15;\\r\\n\\t while (--n >= 0) {\\r\\n\\t var l = this[i] & 0x7fff;\\r\\n\\t var h = this[i++] >> 15;\\r\\n\\t var m = xh * l + h * xl;\\r\\n\\t l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\r\\n\\t c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\r\\n\\t w[j++] = l & 0x3fffffff;\\r\\n\\t }\\r\\n\\t return c;\\r\\n\\t}\",\n \"_sha1FT(_t, _b, _c, _d) {\\n if (_t < 20) {\\n return (_b & _c) | ((~_b) & _d);\\n }\\n if (_t < 40) {\\n return _b ^ _c ^ _d;\\n }\\n if (_t < 60) {\\n return (_b & _c) | (_b & _d) | (_c & _d);\\n }\\n return _b ^ _c ^ _d;\\n }\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function am2(i,x,w,j,c,n) {\\n\\t var xl = x&0x7fff, xh = x>>15;\\n\\t while(--n >= 0) {\\n\\t var l = this.data[i]&0x7fff;\\n\\t var h = this.data[i++]>>15;\\n\\t var m = xh*l+h*xl;\\n\\t l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\\n\\t c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n\\t w.data[j++] = l&0x3fffffff;\\n\\t }\\n\\t return c;\\n\\t}\",\n \"function msfix1(gfc) {\\n for (var sb = 0; sb < Encoder.SBMAX_l; sb++) {\\n /* use this fix if L & R masking differs by 2db or less */\\n /* if db = 10*log10(x2/x1) < 2 */\\n /* if (x2 < 1.58*x1) { */\\n if (gfc.thm[0].l[sb] > 1.58 * gfc.thm[1].l[sb]\\n || gfc.thm[1].l[sb] > 1.58 * gfc.thm[0].l[sb])\\n continue;\\n var mld = gfc.mld_l[sb] * gfc.en[3].l[sb];\\n var rmid = Math.max(gfc.thm[2].l[sb],\\n Math.min(gfc.thm[3].l[sb], mld));\\n\\n mld = gfc.mld_l[sb] * gfc.en[2].l[sb];\\n var rside = Math.max(gfc.thm[3].l[sb],\\n Math.min(gfc.thm[2].l[sb], mld));\\n gfc.thm[2].l[sb] = rmid;\\n gfc.thm[3].l[sb] = rside;\\n }\\n\\n for (var sb = 0; sb < Encoder.SBMAX_s; sb++) {\\n for (var sblock = 0; sblock < 3; sblock++) {\\n if (gfc.thm[0].s[sb][sblock] > 1.58 * gfc.thm[1].s[sb][sblock]\\n || gfc.thm[1].s[sb][sblock] > 1.58 * gfc.thm[0].s[sb][sblock])\\n continue;\\n var mld = gfc.mld_s[sb] * gfc.en[3].s[sb][sblock];\\n var rmid = Math.max(gfc.thm[2].s[sb][sblock],\\n Math.min(gfc.thm[3].s[sb][sblock], mld));\\n\\n mld = gfc.mld_s[sb] * gfc.en[2].s[sb][sblock];\\n var rside = Math.max(gfc.thm[3].s[sb][sblock],\\n Math.min(gfc.thm[2].s[sb][sblock], mld));\\n\\n gfc.thm[2].s[sb][sblock] = rmid;\\n gfc.thm[3].s[sb][sblock] = rside;\\n }\\n }\\n }\",\n \"function msfix1(gfc) {\\n for (var sb = 0; sb < Encoder.SBMAX_l; sb++) {\\n /* use this fix if L & R masking differs by 2db or less */\\n /* if db = 10*log10(x2/x1) < 2 */\\n /* if (x2 < 1.58*x1) { */\\n if (gfc.thm[0].l[sb] > 1.58 * gfc.thm[1].l[sb]\\n || gfc.thm[1].l[sb] > 1.58 * gfc.thm[0].l[sb])\\n continue;\\n var mld = gfc.mld_l[sb] * gfc.en[3].l[sb];\\n var rmid = Math.max(gfc.thm[2].l[sb],\\n Math.min(gfc.thm[3].l[sb], mld));\\n\\n mld = gfc.mld_l[sb] * gfc.en[2].l[sb];\\n var rside = Math.max(gfc.thm[3].l[sb],\\n Math.min(gfc.thm[2].l[sb], mld));\\n gfc.thm[2].l[sb] = rmid;\\n gfc.thm[3].l[sb] = rside;\\n }\\n\\n for (var sb = 0; sb < Encoder.SBMAX_s; sb++) {\\n for (var sblock = 0; sblock < 3; sblock++) {\\n if (gfc.thm[0].s[sb][sblock] > 1.58 * gfc.thm[1].s[sb][sblock]\\n || gfc.thm[1].s[sb][sblock] > 1.58 * gfc.thm[0].s[sb][sblock])\\n continue;\\n var mld = gfc.mld_s[sb] * gfc.en[3].s[sb][sblock];\\n var rmid = Math.max(gfc.thm[2].s[sb][sblock],\\n Math.min(gfc.thm[3].s[sb][sblock], mld));\\n\\n mld = gfc.mld_s[sb] * gfc.en[2].s[sb][sblock];\\n var rside = Math.max(gfc.thm[3].s[sb][sblock],\\n Math.min(gfc.thm[2].s[sb][sblock], mld));\\n\\n gfc.thm[2].s[sb][sblock] = rmid;\\n gfc.thm[3].s[sb][sblock] = rside;\\n }\\n }\\n }\",\n \"function am2(i, x, w, j, c, n)\\n{\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0)\\n {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i, x, w, j, c, n) {\\n var xl = x & 0x7fff,\\n xh = x >> 15;\\n while (--n >= 0) {\\n var l = this[i] & 0x7fff;\\n var h = this[i++] >> 15;\\n var m = xh * l + h * xl;\\n l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);\\n c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);\\n w[j++] = l & 0x3fffffff;\\n }\\n return c;\\n }\",\n \"function twoToThe(m) {\\n var b = Math.floor(m / bpe) + 2\\n var t = new Array(b)\\n for (var i = 0; i < b; i++) t[i] = 0\\n t[b - 2] = 1 << (m % bpe)\\n return t\\n }\",\n \"function bytes2(b1, b2) {\\n /* U+0080..U+07FF */\\n /* 00000000 00000yyy yyxxxxxx | 110yyyyy 10xxxxxx */\\n if ((b2 & 0xc0) !== 0x80) {\\n return TRAILING;\\n }\\n const x = ((b1 & mask[5]) << 6) + (b2 & mask[6]);\\n if (x < 0x80) {\\n return NON_SHORTEST;\\n }\\n return x;\\n }\",\n \"function A7(){return function(n){var e=Uint8Array,t=Uint16Array,i=Uint32Array,r=new e([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0,0]),s=new e([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13,0,0]),o=new e([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),a=function(V,W){for(var F=new t(31),J=0;J<31;++J)F[J]=W+=1<<V[J-1];var K=new i(F[30]);for(J=1;J<30;++J)for(var ue=F[J];ue<F[J+1];++ue)K[ue]=ue-F[J]<<5|J;return[F,K]},l=a(r,2),c=l[0],d=l[1];c[28]=258,d[258]=28;for(var h=a(s,0)[0],p=new t(32768),m=0;m<32768;++m){var v=(43690&m)>>>1|(21845&m)<<1;v=(61680&(v=(52428&v)>>>2|(13107&v)<<2))>>>4|(3855&v)<<4,p[m]=((65280&v)>>>8|(255&v)<<8)>>>1}var y=function(V,W,F){for(var J=V.length,K=0,ue=new t(W);K<J;++K)++ue[V[K]-1];var O,U=new t(W);for(K=0;K<W;++K)U[K]=U[K-1]+ue[K-1]<<1;if(F){O=new t(1<<W);var X=15-W;for(K=0;K<J;++K)if(V[K])for(var D=K<<4|V[K],G=W-V[K],$=U[V[K]-1]++<<G,ne=$|(1<<G)-1;$<=ne;++$)O[p[$]>>>X]=D}else for(O=new t(J),K=0;K<J;++K)V[K]&&(O[K]=p[U[V[K]-1]++]>>>15-V[K]);return O},x=new e(288);for(m=0;m<144;++m)x[m]=8;for(m=144;m<256;++m)x[m]=9;for(m=256;m<280;++m)x[m]=7;for(m=280;m<288;++m)x[m]=8;var w=new e(32);for(m=0;m<32;++m)w[m]=5;var _=y(x,9,1),S=y(w,5,1),b=function(V){for(var W=V[0],F=1;F<V.length;++F)V[F]>W&&(W=V[F]);return W},T=function(V,W,F){var J=W/8|0;return(V[J]|V[J+1]<<8)>>(7&W)&F},A=function(V,W){var F=W/8|0;return(V[F]|V[F+1]<<8|V[F+2]<<16)>>(7&W)},L=[\\\"unexpected EOF\\\",\\\"invalid block type\\\",\\\"invalid length/literal\\\",\\\"invalid distance\\\",\\\"stream finished\\\",\\\"no stream handler\\\",,\\\"no callback\\\",\\\"invalid UTF-8 data\\\",\\\"extra field too long\\\",\\\"date not in range 1980-2099\\\",\\\"filename too long\\\",\\\"stream finishing\\\",\\\"invalid zip data\\\"],C=function(V,W,F){var J=new Error(W||L[V]);if(J.code=V,Error.captureStackTrace&&Error.captureStackTrace(J,C),!F)throw J;return J},R=function(V,W,F){var J=V.length;if(!J||F&&!F.l&&J<5)return W||new e(0);var K=!W||F,ue=!F||F.i;F||(F={}),W||(W=new e(3*J));var O,U=function(xe){var Ge=W.length;if(xe>Ge){var Ke=new e(Math.max(2*Ge,xe));Ke.set(W),W=Ke}},X=F.f||0,D=F.p||0,G=F.b||0,$=F.l,ne=F.d,ie=F.m,q=F.n,fe=8*J;do{if(!$){F.f=X=T(V,D,1);var de=T(V,D+1,3);if(D+=3,!de){var Ae=V[(Ue=((O=D)/8|0)+(7&O&&1)+4)-4]|V[Ue-3]<<8,Me=Ue+Ae;if(Me>J){ue&&C(0);break}K&&U(G+Ae),W.set(V.subarray(Ue,Me),G),F.b=G+=Ae,F.p=D=8*Me;continue}if(de==1)$=_,ne=S,ie=9,q=5;else if(de==2){var Pe=T(V,D,31)+257,Q=T(V,D+10,15)+4,ce=Pe+T(V,D+5,31)+1;D+=14;for(var Le=new e(ce),Ie=new e(19),Ee=0;Ee<Q;++Ee)Ie[o[Ee]]=T(V,D+3*Ee,7);D+=3*Q;var je=b(Ie),we=(1<<je)-1,ze=y(Ie,je,1);for(Ee=0;Ee<ce;){var Ue,Se=ze[T(V,D,we)];if(D+=15&Se,(Ue=Se>>>4)<16)Le[Ee++]=Ue;else{var z=0,I=0;for(Ue==16?(I=3+T(V,D,3),D+=2,z=Le[Ee-1]):Ue==17?(I=3+T(V,D,7),D+=3):Ue==18&&(I=11+T(V,D,127),D+=7);I--;)Le[Ee++]=z}}var te=Le.subarray(0,Pe),pe=Le.subarray(Pe);ie=b(te),q=b(pe),$=y(te,ie,1),ne=y(pe,q,1)}else C(1);if(D>fe){ue&&C(0);break}}K&&U(G+131072);for(var De=(1<<ie)-1,Oe=(1<<q)-1,Ne=D;;Ne=D){var Fe=(z=$[A(V,D)&De])>>>4;if((D+=15&z)>fe){ue&&C(0);break}if(z||C(2),Fe<256)W[G++]=Fe;else{if(Fe==256){Ne=D,$=null;break}var ge=Fe-254;if(Fe>264){var We=r[Ee=Fe-257];ge=T(V,D,(1<<We)-1)+c[Ee],D+=We}var Y=ne[A(V,D)&Oe],le=Y>>>4;if(Y||C(3),D+=15&Y,pe=h[le],le>3&&(We=s[le],pe+=A(V,D)&(1<<We)-1,D+=We),D>fe){ue&&C(0);break}K&&U(G+131072);for(var ve=G+ge;G<ve;G+=4)W[G]=W[G-pe],W[G+1]=W[G+1-pe],W[G+2]=W[G+2-pe],W[G+3]=W[G+3-pe];G=ve}}F.l=$,F.p=Ne,F.b=G,$&&(X=1,F.m=ie,F.d=ne,F.n=q)}while(!X);return G==W.length?W:function(xe,Ge,Ke){(Ge==null||Ge<0)&&(Ge=0),(Ke==null||Ke>xe.length)&&(Ke=xe.length);var ut=new(xe instanceof t?t:xe instanceof i?i:e)(Ke-Ge);return ut.set(xe.subarray(Ge,Ke)),ut}(W,0,G)},k=new e(0),H=typeof TextDecoder<\\\"u\\\"&&new TextDecoder;try{H.decode(k,{stream:!0})}catch{}return n.convert_streams=function(V){var W=new DataView(V),F=0;function J(){var Pe=W.getUint16(F);return F+=2,Pe}function K(){var Pe=W.getUint32(F);return F+=4,Pe}function ue(Pe){Ae.setUint16(Me,Pe),Me+=2}function O(Pe){Ae.setUint32(Me,Pe),Me+=4}for(var U={signature:K(),flavor:K(),length:K(),numTables:J(),reserved:J(),totalSfntSize:K(),majorVersion:J(),minorVersion:J(),metaOffset:K(),metaLength:K(),metaOrigLength:K(),privOffset:K(),privLength:K()},X=0;Math.pow(2,X)<=U.numTables;)X++;X--;for(var D=16*Math.pow(2,X),G=16*U.numTables-D,$=12,ne=[],ie=0;ie<U.numTables;ie++)ne.push({tag:K(),offset:K(),compLength:K(),origLength:K(),origChecksum:K()}),$+=16;var q,fe=new Uint8Array(12+16*ne.length+ne.reduce(function(Pe,Q){return Pe+Q.origLength+4},0)),de=fe.buffer,Ae=new DataView(de),Me=0;return O(U.flavor),ue(U.numTables),ue(D),ue(X),ue(G),ne.forEach(function(Pe){O(Pe.tag),O(Pe.origChecksum),O($),O(Pe.origLength),Pe.outOffset=$,($+=Pe.origLength)%4!=0&&($+=4-$%4)}),ne.forEach(function(Pe){var Q,ce=V.slice(Pe.offset,Pe.offset+Pe.compLength);if(Pe.compLength!=Pe.origLength){var Le=new Uint8Array(Pe.origLength);Q=new Uint8Array(ce,2),R(Q,Le)}else Le=new Uint8Array(ce);fe.set(Le,Pe.outOffset);var Ie=0;($=Pe.outOffset+Pe.origLength)%4!=0&&(Ie=4-$%4),fe.set(new Uint8Array(Ie).buffer,Pe.outOffset+Pe.origLength),q=$+Ie}),de.slice(0,q)},Object.defineProperty(n,\\\"__esModule\\\",{value:!0}),n}({}).convert_streams}\",\n \"function sha1_ft(t, b, c, d) {\\n\\t if (t < 20) {\\n\\t return (b & c) | ((~b) & d);\\n\\t }\\n\\t if (t < 40) {\\n\\t return b ^ c ^ d;\\n\\t }\\n\\t if (t < 60) {\\n\\t return (b & c) | (b & d) | (c & d);\\n\\t }\\n\\t return b ^ c ^ d;\\n\\t }\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this.data[i]&0x7fff;\\n var h = this.data[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w.data[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this.data[i]&0x7fff;\\n var h = this.data[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w.data[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this.data[i]&0x7fff;\\n var h = this.data[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w.data[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this.data[i]&0x7fff;\\n var h = this.data[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w.data[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\",\n \"function am2(i,x,w,j,c,n) {\\n var xl = x&0x7fff, xh = x>>15;\\n while(--n >= 0) {\\n var l = this.data[i]&0x7fff;\\n var h = this.data[i++]>>15;\\n var m = xh*l+h*xl;\\n l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\\n c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\\n w.data[j++] = l&0x3fffffff;\\n }\\n return c;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6851531","0.6258883","0.6119003","0.6056417","0.5773433","0.5773433","0.5708519","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.5693391","0.56930953","0.56813484","0.5676588","0.56642836","0.56610394","0.56610394","0.5653844","0.55947924","0.55844426","0.55710703","0.55710703","0.5564134","0.5564134","0.5564134","0.5564134","0.5564134","0.5564134","0.5564134","0.55578893","0.55578893","0.55578893","0.5551611","0.55445254","0.55441993","0.5520118","0.5500059","0.5500059","0.5500059","0.5489675","0.5462973","0.5462973","0.546258","0.5459234","0.54578215","0.54514766","0.54513997","0.5428183","0.5426113","0.5426113","0.5426113","0.5426113","0.5426113"],"string":"[\n \"0.6851531\",\n \"0.6258883\",\n \"0.6119003\",\n \"0.6056417\",\n \"0.5773433\",\n \"0.5773433\",\n \"0.5708519\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.5693391\",\n \"0.56930953\",\n \"0.56813484\",\n \"0.5676588\",\n \"0.56642836\",\n \"0.56610394\",\n \"0.56610394\",\n \"0.5653844\",\n \"0.55947924\",\n \"0.55844426\",\n \"0.55710703\",\n \"0.55710703\",\n \"0.5564134\",\n \"0.5564134\",\n \"0.5564134\",\n \"0.5564134\",\n \"0.5564134\",\n \"0.5564134\",\n \"0.5564134\",\n \"0.55578893\",\n \"0.55578893\",\n \"0.55578893\",\n \"0.5551611\",\n \"0.55445254\",\n \"0.55441993\",\n \"0.5520118\",\n \"0.5500059\",\n \"0.5500059\",\n \"0.5500059\",\n \"0.5489675\",\n \"0.5462973\",\n \"0.5462973\",\n \"0.546258\",\n \"0.5459234\",\n \"0.54578215\",\n \"0.54514766\",\n \"0.54513997\",\n \"0.5428183\",\n \"0.5426113\",\n \"0.5426113\",\n \"0.5426113\",\n \"0.5426113\",\n \"0.5426113\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5683907"},"document_rank":{"kind":"string","value":"57"}}},{"rowIdx":4689,"cells":{"query":{"kind":"string","value":"Alternately, set max digit bits to 28 since some browsers slow down when dealing with 32bit numbers."},"document":{"kind":"string","value":"function am3(i,x,w,j,c,n) {\n var xl = x&0x3fff, xh = x>>14;\n while(--n >= 0) {\n var l = this[i]&0x3fff;\n var h = this[i++]>>14;\n var m = xh*l+h*xl;\n l = xl*l+((m&0x3fff)<<14)+w[j]+c;\n c = (l>>28)+(m>>14)+xh*h;\n w[j++] = l&0xfffffff;\n }\n return c;\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 limitDigitDisplay(numb){\n return new Intl.NumberFormat('en-US', {minimumFractionDigits: 0,maximumFractionDigits: 8}).format(numb);\n}","function am2(i,x,w,j,c,n){var xl=x&0x7fff,xh=x>>15;while(--n>=0){var l=this[i]&0x7fff;var h=this[i++]>>15;var m=xh*l+h*xl;l=xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);c=(l>>>30)+(m>>>15)+xh*h+(c>>>30);w[j++]=l&0x3fffffff;}return c;}// Alternately, set max digit bits to 28 since some","function BitsPerMax(max) { return Math.log(max)/Math.log(2); }","function bitsWord() {\n \tvar b = document.results.bits.value;\n\tif (isNaN(b) || b < 32) {\n\t b = document.results.bits.value = 32;\n\t}\n\tif (b > 1024) {\n\t b = document.results.bits.value = 1024;\n\t}\n\tvar n;\n\tfor (n = 1; b > Math.floor(Math.LOG2E * Math.log(twords) * n); n++) ;\n\tdocument.results.howlong.value = n;\n }","function intakeBits(amt){\r\n\r\n}","function lz(num) {\n\tif (num >= 10)\n\t\treturn num;\n\treturn \"0\" + num;\n}","function lz(num) {\n\t\tif(num < 10) {\n\t\t\treturn '0' + num;\n\t\t} else {\n\t\t\treturn '' + num;\n\t\t}\n\t}","function limitValues(num) {\n if (num >= 255) {\n return 255;\n } else if (num <= 0) {\n return 0;\n } else {\n return num;\n }\n}","function alternative(num) {\n let i = 0;\n let digit = 0;\n let n = Math.floor(num);\n\n while (n >= 1) {\n if (n % 10 == 6) {\n digit = i + 1;\n }\n\n n = Math.floor(n / Math.floor(10));\n i++;\n }\n\n return digit === 0 ?\n num :\n num + 3 * Math.pow(10, digit - 1);\n}","function getLimit() {\n\tvar max = 9;\n\tfor (var i = 1; sumOfDigits(max) >= Math.pow(10, i); i++, max *= 10, max += 9) ;// console.log(sumOfDigits(max), Math.pow(10, i));\n\n\treturn Math.pow(10, i);\n}","function getMaximumJavascriptInt() {\n return 9007199254740992; // 2^53\n }","function createNumBitsPad(minValue, maxValue, titleStr, instructions, decimalAllowed, base, callback) {\n\t\tvar newNumpad = new NumberPad();\n\t\tnewNumpad.open(minValue, maxValue, titleStr, instructions, decimalAllowed, base, callback);\n }","function digitTransformation(n) {\n\treturn Math.pow(n, 5);\n}","static get MAX_VALUE() {\n return 127;\n }","function maxNumLength() {\r\n\t$('input').on('keyup', function () {\r\n\t\tvar max = $(this).attr('maxlength'),\r\n\t\tval = $(this).val(),\r\n\t\ttrimmed;\r\n\t\tif (max && val) {\r\n\t\ttrimmed = val.substr(0, max);\r\n\t\t$(this).val(trimmed);\r\n\t\t}\r\n\t});\r\n\t}","function lrgProduct(digit) {\r\n var num = \"7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450\";\r\n // var num = 731671765313306;\r\n var num_arr = num.split(\"\");\r\n var maxProduct = 0;\r\n for (var i = 0; i < num_arr.length - digit; i += 1) {\r\n var product = 1;\r\n for (var j = 0; j < digit; j += 1) {\r\n product = product * num_arr[i + j];\r\n }\r\n if (product > maxProduct) {\r\n maxProduct = product;\r\n }\r\n }\r\n return maxProduct;\r\n}","function de_exponentize(number) {\n\treturn number * 10000000;\n}","addDigits() {\n for (var i = 1; i <= 30; i++) {\n this.digits.push(i);\n }\n }","function large_number_above_bounds(num){\n var left_total = 0.0;\n var most_significant_section = num.substring(0,num.lastIndexOf(\".\"));\n var digits = most_significant_section.length;\n var max_base = (digits > 0) ? digits : most_significant_section.length;\n max_base = Math.pow(10, max_base-1)\n\n for(var i=0;i<18;i++){\n\n left_total += num.charAt(i) * max_base;\n max_base /= 10;\n\n }\n\n return left_total;\n}","function LZ(n){\treturn (n > 9 ? n : '0' + n); }","function LZ(n){\treturn (n > 9 ? n : '0' + n); }","function setTwoDigit(num) {\n return (\"0\" + num).slice(-2);\n}","function bigNum(x) {\n if (x < 1e+6) {\n return x.toLocaleString();\n }\n \n let digits = Math.floor(Math.log10(x));\n let thousands = Math.floor(digits / 3);\n let mantissa = x / Math.pow(10, thousands * 3);\n return `${+mantissa.toFixed(2)} ${POWERS[thousands - 1]}`;\n}","function convert32to64(id) {\n return new BigNumber('76561197960265728').plus(id);\n}","function convertToCelsius(num){\n return (num - 32) * 5 / 9;\n}","function featured(num) {\n var next = num + (7 - num % 7);\n if (next % 2 === 0) next += 7;\n\n while (next < 9876543210) {\n if (uniqueDigits(next)) return next;\n next += 7;\n }\n\n return 'ERROR! No Larger Featured Number Found.'\n}","function solution(digits) {\n let max = 0;\n for (let i = 0; i < digits.length; i++) {\n let num = digits.slice(i, i+5);\n if (num > max) max = num;\n }\n return +max;\n}","function bigNum(num) {\n return ethers_1.utils.bigNumberify(num);\n}","_getBigNumberFrom64BitBinOctHex(number, radix) {\n let result = new JQX.Utilities.BigNumber(0);\n for (let i = number.length - 1; i >= 0; i--) {\n let current = new JQX.Utilities.BigNumber(parseInt(number.charAt(i), radix));\n result = result.add((current.multiply(new JQX.Utilities.BigNumber(radix).pow(number.length - 1 - i))));\n }\n return result;\n }","function numToBase62(n) {\n\tif(n > 62) \n\t\treturn numToBase62(Math.floor(n / 62)) + CHARS[n % 62];\n\telse \n\t\treturn CHARS[n];\n}","function storeNum(num) {\n if (num.length > 40) {\n storedNumber.innerText = num.slice(0,39);\n } else {\n storedNumber.innerText = num; \n }\n}","function BigInteger(digits) {\n Object(C_Users_Abid_Loqmen_Desktop_NGforce_thesis_node_modules_babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_12__[\"default\"])(this, BigInteger);\n\n this.digits = digits;\n }","function LengthConverter(valNum) {\n return valNum * 0.000621371;\n }","function makeOneDigit(number) {\n return number - 9;\n}","function Numeral(number){this._value=number;}","function strfbits(i32) {\n if (typeof arguments.callee.ZERO32 == 'undefined') {\n arguments.callee.ZERO32 = new Array(33).join(\"0\");\n }\n \n var bits = Number(i32).toString(2);\n // '0' padding \n if (bits.length < 32) bits = arguments.callee.ZERO32.substr(0, 32 - bits.length) + bits;\n // split by 8 bits\n return bits.replace(/(\\d{8})/g, '$1 ')\n .replace(/^\\s*(.*?)\\s*$/, '$1');\n }","function _getMillerRabinTests(bits) {\n\t if(bits <= 100) return 27;\n\t if(bits <= 150) return 18;\n\t if(bits <= 200) return 15;\n\t if(bits <= 250) return 12;\n\t if(bits <= 300) return 9;\n\t if(bits <= 350) return 8;\n\t if(bits <= 400) return 7;\n\t if(bits <= 500) return 6;\n\t if(bits <= 600) return 5;\n\t if(bits <= 800) return 4;\n\t if(bits <= 1250) return 3;\n\t return 2;\n\t}","function NUM_BYTES(bits) {\n return (bits + 7) >> 3;\n}","function checkDigit () {\n c = 0;\n for (i = 0; i < nif.length - 1; ++i) {\n c += Number(nif[i]) * (10 - i - 1);\n }\n c = 11 - (c % 11);\n return c >= 10 ? 0 : c;\n }","function h$ghcjsbn_readBigNatDigits(digits) {\n if(digits.length > 9) {\n var h = (digits.length / 2)|0,\n l = digits.substring(0, h),\n r = digits.substring(h),\n m = h$ghcjsbn_pow_ww(10, r.length),\n bl = h$ghcjsbn_readBigNatDigits(l),\n br = h$ghcjsbn_readBigNatDigits(r);\n return h$ghcjsbn_add_bb(h$ghcjsbn_mul_bb(bl, m), br);\n } else {\n return h$ghcjsbn_mkBigNat_w(parseInt(digits));\n }\n}","function convertableToSciNotation(num) {\n var MAX_DIGITS = 6;\n return Math.log(Math.abs(num))*Math.LOG10E>=MAX_DIGITS;\n }","function g(a) {\n if (a) {\n var b = i(a);\n b && b.length > 8 && (b = b.substr(0, 8));\n return (\"1\" + b + h(11)).substr(0, 12)\n }\n return \"0\" + h(11)\n }","function zfill(number, size) {\n number = number.toString();\n while (number.length < size) {\n number = '0' + number;\n }\n return number;\n }","function int2bigInt(t,bits,minSize) { \n var i,k, buff;\n k=Math.ceil(bits/bpe)+1;\n k=minSize>k ? minSize : k;\n buff=new Array(k);\n copyInt_(buff,t);\n return buff;\n }","function twodigits( x ) {\n if (x < 10) { return \"0\"+x } else { return x }\n }","function decimalFrom1e7(digit1e7, needLeadingZeros) {\n var partial = digit1e7 ? String(digit1e7) : '';\n if (needLeadingZeros) {\n return '0000000'.slice(partial.length) + partial;\n }\n return partial;\n }","function numOfBitsNeeded(num) {\n for (var i = 8; i <= 64; i += 8) {\n if (num < Math.pow(2, i)) {\n return i;\n }\n }\n }","function checkNumberFieldLength(elem) {\r\n if (elem.value.length > 4) {\r\n elem.value = elem.value.slice(0, 4);\r\n }\r\n}","function getMillerRabinTests(bits) {\n\t if(bits <= 100) return 27;\n\t if(bits <= 150) return 18;\n\t if(bits <= 200) return 15;\n\t if(bits <= 250) return 12;\n\t if(bits <= 300) return 9;\n\t if(bits <= 350) return 8;\n\t if(bits <= 400) return 7;\n\t if(bits <= 500) return 6;\n\t if(bits <= 600) return 5;\n\t if(bits <= 800) return 4;\n\t if(bits <= 1250) return 3;\n\t return 2;\n\t}","function get64binary(int) {\n if (int>=0)\n return int\n .toString(2)\n .padStart(36, \"0\");\n // else\n return (-int-1)\n .toString(2)\n .replace(/[01]/g, function(d){return +!+d;}) // hehe: inverts each char\n .padStart(36, \"1\");\n}","function fix(n,p) {\n return parseInt(n * Math.pow(10,p));\n}","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function _getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function numtohxt($n) {\n $s = \"\";\n $m = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n if ($n===undefined || $n===0) { return \"0\"; }\n while ($n>0) {\n $d = $n % 36;\n $s = strcat($m[$d],$s);\n $n = ($n-$d)/36;\n }\n return $s;\n}","function roundToEightMax(num) {\n return +(Math.round(num + \"e+8\") + \"e-8\");\n}","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }","function getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n }","function getBase10Exponent(digits, e) {\n var w = digits[0];\n\n // Add the number of digits of the first word of the digits array.\n for (e *= LOG_BASE; w >= 10; w /= 10) {e++;}\n return e;\n }","function baseDigits(n) {\n return range(n).map(function(x) { return x.toString(n); });\n}","function writeInt(number) {\n do {\n encoded += URL64Code[(number & 0x1f) | (number > 0x1f ? 0x20 : 0)];\n number >>= 5;\n } while (number > 0);\n }","function getFrom10000To19999(x) {\r\n return getFrom11To19(Math.floor(x / 1000)) + getFromMILA(x);\r\n}","function n(n) {\n return n > 9 ? \"\" + n : \"0\" + n; \n }","bigNumber(value) {\n return bignumber[\"a\" /* BigNumber */].from(value);\n }","function convert(num) {\n\n\n}","function getBinary(num) {\n if (num === 0) return 0;\n else return (num % 2) + 10 * getBinary(Math.floor(num / 2));\n}","function getBase10Exponent(digits, e) {\n var w = digits[0];\n\n // Add the number of digits of the first word of the digits array.\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\n return e;\n }","toBase10(value, b = 62) {\n const limit = value.length;\n let result = base.indexOf(value[0]);\n for (let i = 1; i < limit; i++) {\n result = b * result + base.indexOf(value[i]);\n }\n return result;\n }","function latitudeBitsForResolution(resolution) {\r\n return Math.min(log2(EARTH_MERI_CIRCUMFERENCE / 2 / resolution), MAXIMUM_BITS_PRECISION);\r\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function getMillerRabinTests(bits) {\n if(bits <= 100) return 27;\n if(bits <= 150) return 18;\n if(bits <= 200) return 15;\n if(bits <= 250) return 12;\n if(bits <= 300) return 9;\n if(bits <= 350) return 8;\n if(bits <= 400) return 7;\n if(bits <= 500) return 6;\n if(bits <= 600) return 5;\n if(bits <= 800) return 4;\n if(bits <= 1250) return 3;\n return 2;\n}","function checkbitsInt() {\n\tvar num = 1,\n\t\tlastNum = 0,\n\t\tbits = 0;\n\n\tdo {\n\t\tlastNum = num;\n\t\tnum *= 2;\n\t\tnum++;\n\t\tbits++;\n\t} while ((((num - 1) / 2) === lastNum) && (bits < 101));\n\treturn bits;\n}","function fix(num, length) {\n return ('' + num).length < length ? ((new Array(length + 1)).join('0') + num).slice(-length) : '' + num;\n }","function _changeNumber(_express, iSize) {\n\t_express = _express - 1 + 1;\n\tiSize = iSize - 1 + 1;\n\t\n\tiKey1 = Math.pow(10, 12);\n\tdTemp = Math.round(_express * iKey1);\n\tsTemp = \"\" + dTemp;\n\tiEndNum = sTemp.substring(sTemp.length - 1, sTemp.length) - 1 + 1\n\tif (iEndNum = 9) {\n\t\tdTemp = dTemp + 1;\n\t} else {\n\t\tdTemp = dTemp + 2;\n\t}\n\t\n\tdTemp = dTemp / iKey1;\n\n\tiKey = Math.pow(10, iSize);\n\tdTemp = Math.round(dTemp * iKey);\n\t\n\treturn dTemp / iKey;\n}","function numberMax(n1, n2) {\n // bit problem\n}","function glslifyNumber (n) {\n return n === (n | 0) ? n + '.0' : n + '';\n }","function getLotto6() {\n var num = getRanNum6();\n for (var i = 0; i < num.length; i++) {\n if (num[i] < 10) {\n num[i] = \"0\" + num[i] \n }\n else {\n num[i] = num[i].toString();\n } \n }\n var cnum = num.join(\"\");\n return cnum;\n}","function int2bigInt(t, bits, minSize) {\n var i, k;\n k = Math.ceil(bits / bpe) + 1;\n k = minSize > k ? minSize : k;\n buff = new Array(k);\n copyInt_(buff, t);\n return buff;\n }","function LCG(s) {\n return function () {\n s = Math.imul(16807, s) | 0 % 2147483647;\n return (s & 2147483647) / 2147483648;\n }\n}","function pad(n) { return (\"0\" + n).slice(-2); }","function adjust(val) {\n if (val < 0) {\n return 0;\n }\n else if (val > 65535) {\n return 65535;\n }\n else {\n return val;\n }\n}","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 convert64to32(id) {\n return new BigNumber(id).minus('76561197960265728');\n}","function toBigNumber(value) {\n return web3.utils.toBN(value);\n}"],"string":"[\n \"function limitDigitDisplay(numb){\\n return new Intl.NumberFormat('en-US', {minimumFractionDigits: 0,maximumFractionDigits: 8}).format(numb);\\n}\",\n \"function am2(i,x,w,j,c,n){var xl=x&0x7fff,xh=x>>15;while(--n>=0){var l=this[i]&0x7fff;var h=this[i++]>>15;var m=xh*l+h*xl;l=xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);c=(l>>>30)+(m>>>15)+xh*h+(c>>>30);w[j++]=l&0x3fffffff;}return c;}// Alternately, set max digit bits to 28 since some\",\n \"function BitsPerMax(max) { return Math.log(max)/Math.log(2); }\",\n \"function bitsWord() {\\n \\tvar b = document.results.bits.value;\\n\\tif (isNaN(b) || b < 32) {\\n\\t b = document.results.bits.value = 32;\\n\\t}\\n\\tif (b > 1024) {\\n\\t b = document.results.bits.value = 1024;\\n\\t}\\n\\tvar n;\\n\\tfor (n = 1; b > Math.floor(Math.LOG2E * Math.log(twords) * n); n++) ;\\n\\tdocument.results.howlong.value = n;\\n }\",\n \"function intakeBits(amt){\\r\\n\\r\\n}\",\n \"function lz(num) {\\n\\tif (num >= 10)\\n\\t\\treturn num;\\n\\treturn \\\"0\\\" + num;\\n}\",\n \"function lz(num) {\\n\\t\\tif(num < 10) {\\n\\t\\t\\treturn '0' + num;\\n\\t\\t} else {\\n\\t\\t\\treturn '' + num;\\n\\t\\t}\\n\\t}\",\n \"function limitValues(num) {\\n if (num >= 255) {\\n return 255;\\n } else if (num <= 0) {\\n return 0;\\n } else {\\n return num;\\n }\\n}\",\n \"function alternative(num) {\\n let i = 0;\\n let digit = 0;\\n let n = Math.floor(num);\\n\\n while (n >= 1) {\\n if (n % 10 == 6) {\\n digit = i + 1;\\n }\\n\\n n = Math.floor(n / Math.floor(10));\\n i++;\\n }\\n\\n return digit === 0 ?\\n num :\\n num + 3 * Math.pow(10, digit - 1);\\n}\",\n \"function getLimit() {\\n\\tvar max = 9;\\n\\tfor (var i = 1; sumOfDigits(max) >= Math.pow(10, i); i++, max *= 10, max += 9) ;// console.log(sumOfDigits(max), Math.pow(10, i));\\n\\n\\treturn Math.pow(10, i);\\n}\",\n \"function getMaximumJavascriptInt() {\\n return 9007199254740992; // 2^53\\n }\",\n \"function createNumBitsPad(minValue, maxValue, titleStr, instructions, decimalAllowed, base, callback) {\\n\\t\\tvar newNumpad = new NumberPad();\\n\\t\\tnewNumpad.open(minValue, maxValue, titleStr, instructions, decimalAllowed, base, callback);\\n }\",\n \"function digitTransformation(n) {\\n\\treturn Math.pow(n, 5);\\n}\",\n \"static get MAX_VALUE() {\\n return 127;\\n }\",\n \"function maxNumLength() {\\r\\n\\t$('input').on('keyup', function () {\\r\\n\\t\\tvar max = $(this).attr('maxlength'),\\r\\n\\t\\tval = $(this).val(),\\r\\n\\t\\ttrimmed;\\r\\n\\t\\tif (max && val) {\\r\\n\\t\\ttrimmed = val.substr(0, max);\\r\\n\\t\\t$(this).val(trimmed);\\r\\n\\t\\t}\\r\\n\\t});\\r\\n\\t}\",\n \"function lrgProduct(digit) {\\r\\n var num = \\\"7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450\\\";\\r\\n // var num = 731671765313306;\\r\\n var num_arr = num.split(\\\"\\\");\\r\\n var maxProduct = 0;\\r\\n for (var i = 0; i < num_arr.length - digit; i += 1) {\\r\\n var product = 1;\\r\\n for (var j = 0; j < digit; j += 1) {\\r\\n product = product * num_arr[i + j];\\r\\n }\\r\\n if (product > maxProduct) {\\r\\n maxProduct = product;\\r\\n }\\r\\n }\\r\\n return maxProduct;\\r\\n}\",\n \"function de_exponentize(number) {\\n\\treturn number * 10000000;\\n}\",\n \"addDigits() {\\n for (var i = 1; i <= 30; i++) {\\n this.digits.push(i);\\n }\\n }\",\n \"function large_number_above_bounds(num){\\n var left_total = 0.0;\\n var most_significant_section = num.substring(0,num.lastIndexOf(\\\".\\\"));\\n var digits = most_significant_section.length;\\n var max_base = (digits > 0) ? digits : most_significant_section.length;\\n max_base = Math.pow(10, max_base-1)\\n\\n for(var i=0;i<18;i++){\\n\\n left_total += num.charAt(i) * max_base;\\n max_base /= 10;\\n\\n }\\n\\n return left_total;\\n}\",\n \"function LZ(n){\\treturn (n > 9 ? n : '0' + n); }\",\n \"function LZ(n){\\treturn (n > 9 ? n : '0' + n); }\",\n \"function setTwoDigit(num) {\\n return (\\\"0\\\" + num).slice(-2);\\n}\",\n \"function bigNum(x) {\\n if (x < 1e+6) {\\n return x.toLocaleString();\\n }\\n \\n let digits = Math.floor(Math.log10(x));\\n let thousands = Math.floor(digits / 3);\\n let mantissa = x / Math.pow(10, thousands * 3);\\n return `${+mantissa.toFixed(2)} ${POWERS[thousands - 1]}`;\\n}\",\n \"function convert32to64(id) {\\n return new BigNumber('76561197960265728').plus(id);\\n}\",\n \"function convertToCelsius(num){\\n return (num - 32) * 5 / 9;\\n}\",\n \"function featured(num) {\\n var next = num + (7 - num % 7);\\n if (next % 2 === 0) next += 7;\\n\\n while (next < 9876543210) {\\n if (uniqueDigits(next)) return next;\\n next += 7;\\n }\\n\\n return 'ERROR! No Larger Featured Number Found.'\\n}\",\n \"function solution(digits) {\\n let max = 0;\\n for (let i = 0; i < digits.length; i++) {\\n let num = digits.slice(i, i+5);\\n if (num > max) max = num;\\n }\\n return +max;\\n}\",\n \"function bigNum(num) {\\n return ethers_1.utils.bigNumberify(num);\\n}\",\n \"_getBigNumberFrom64BitBinOctHex(number, radix) {\\n let result = new JQX.Utilities.BigNumber(0);\\n for (let i = number.length - 1; i >= 0; i--) {\\n let current = new JQX.Utilities.BigNumber(parseInt(number.charAt(i), radix));\\n result = result.add((current.multiply(new JQX.Utilities.BigNumber(radix).pow(number.length - 1 - i))));\\n }\\n return result;\\n }\",\n \"function numToBase62(n) {\\n\\tif(n > 62) \\n\\t\\treturn numToBase62(Math.floor(n / 62)) + CHARS[n % 62];\\n\\telse \\n\\t\\treturn CHARS[n];\\n}\",\n \"function storeNum(num) {\\n if (num.length > 40) {\\n storedNumber.innerText = num.slice(0,39);\\n } else {\\n storedNumber.innerText = num; \\n }\\n}\",\n \"function BigInteger(digits) {\\n Object(C_Users_Abid_Loqmen_Desktop_NGforce_thesis_node_modules_babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_12__[\\\"default\\\"])(this, BigInteger);\\n\\n this.digits = digits;\\n }\",\n \"function LengthConverter(valNum) {\\n return valNum * 0.000621371;\\n }\",\n \"function makeOneDigit(number) {\\n return number - 9;\\n}\",\n \"function Numeral(number){this._value=number;}\",\n \"function strfbits(i32) {\\n if (typeof arguments.callee.ZERO32 == 'undefined') {\\n arguments.callee.ZERO32 = new Array(33).join(\\\"0\\\");\\n }\\n \\n var bits = Number(i32).toString(2);\\n // '0' padding \\n if (bits.length < 32) bits = arguments.callee.ZERO32.substr(0, 32 - bits.length) + bits;\\n // split by 8 bits\\n return bits.replace(/(\\\\d{8})/g, '$1 ')\\n .replace(/^\\\\s*(.*?)\\\\s*$/, '$1');\\n }\",\n \"function _getMillerRabinTests(bits) {\\n\\t if(bits <= 100) return 27;\\n\\t if(bits <= 150) return 18;\\n\\t if(bits <= 200) return 15;\\n\\t if(bits <= 250) return 12;\\n\\t if(bits <= 300) return 9;\\n\\t if(bits <= 350) return 8;\\n\\t if(bits <= 400) return 7;\\n\\t if(bits <= 500) return 6;\\n\\t if(bits <= 600) return 5;\\n\\t if(bits <= 800) return 4;\\n\\t if(bits <= 1250) return 3;\\n\\t return 2;\\n\\t}\",\n \"function NUM_BYTES(bits) {\\n return (bits + 7) >> 3;\\n}\",\n \"function checkDigit () {\\n c = 0;\\n for (i = 0; i < nif.length - 1; ++i) {\\n c += Number(nif[i]) * (10 - i - 1);\\n }\\n c = 11 - (c % 11);\\n return c >= 10 ? 0 : c;\\n }\",\n \"function h$ghcjsbn_readBigNatDigits(digits) {\\n if(digits.length > 9) {\\n var h = (digits.length / 2)|0,\\n l = digits.substring(0, h),\\n r = digits.substring(h),\\n m = h$ghcjsbn_pow_ww(10, r.length),\\n bl = h$ghcjsbn_readBigNatDigits(l),\\n br = h$ghcjsbn_readBigNatDigits(r);\\n return h$ghcjsbn_add_bb(h$ghcjsbn_mul_bb(bl, m), br);\\n } else {\\n return h$ghcjsbn_mkBigNat_w(parseInt(digits));\\n }\\n}\",\n \"function convertableToSciNotation(num) {\\n var MAX_DIGITS = 6;\\n return Math.log(Math.abs(num))*Math.LOG10E>=MAX_DIGITS;\\n }\",\n \"function g(a) {\\n if (a) {\\n var b = i(a);\\n b && b.length > 8 && (b = b.substr(0, 8));\\n return (\\\"1\\\" + b + h(11)).substr(0, 12)\\n }\\n return \\\"0\\\" + h(11)\\n }\",\n \"function zfill(number, size) {\\n number = number.toString();\\n while (number.length < size) {\\n number = '0' + number;\\n }\\n return number;\\n }\",\n \"function int2bigInt(t,bits,minSize) { \\n var i,k, buff;\\n k=Math.ceil(bits/bpe)+1;\\n k=minSize>k ? minSize : k;\\n buff=new Array(k);\\n copyInt_(buff,t);\\n return buff;\\n }\",\n \"function twodigits( x ) {\\n if (x < 10) { return \\\"0\\\"+x } else { return x }\\n }\",\n \"function decimalFrom1e7(digit1e7, needLeadingZeros) {\\n var partial = digit1e7 ? String(digit1e7) : '';\\n if (needLeadingZeros) {\\n return '0000000'.slice(partial.length) + partial;\\n }\\n return partial;\\n }\",\n \"function numOfBitsNeeded(num) {\\n for (var i = 8; i <= 64; i += 8) {\\n if (num < Math.pow(2, i)) {\\n return i;\\n }\\n }\\n }\",\n \"function checkNumberFieldLength(elem) {\\r\\n if (elem.value.length > 4) {\\r\\n elem.value = elem.value.slice(0, 4);\\r\\n }\\r\\n}\",\n \"function getMillerRabinTests(bits) {\\n\\t if(bits <= 100) return 27;\\n\\t if(bits <= 150) return 18;\\n\\t if(bits <= 200) return 15;\\n\\t if(bits <= 250) return 12;\\n\\t if(bits <= 300) return 9;\\n\\t if(bits <= 350) return 8;\\n\\t if(bits <= 400) return 7;\\n\\t if(bits <= 500) return 6;\\n\\t if(bits <= 600) return 5;\\n\\t if(bits <= 800) return 4;\\n\\t if(bits <= 1250) return 3;\\n\\t return 2;\\n\\t}\",\n \"function get64binary(int) {\\n if (int>=0)\\n return int\\n .toString(2)\\n .padStart(36, \\\"0\\\");\\n // else\\n return (-int-1)\\n .toString(2)\\n .replace(/[01]/g, function(d){return +!+d;}) // hehe: inverts each char\\n .padStart(36, \\\"1\\\");\\n}\",\n \"function fix(n,p) {\\n return parseInt(n * Math.pow(10,p));\\n}\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n }\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function _getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function numtohxt($n) {\\n $s = \\\"\\\";\\n $m = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n if ($n===undefined || $n===0) { return \\\"0\\\"; }\\n while ($n>0) {\\n $d = $n % 36;\\n $s = strcat($m[$d],$s);\\n $n = ($n-$d)/36;\\n }\\n return $s;\\n}\",\n \"function roundToEightMax(num) {\\n return +(Math.round(num + \\\"e+8\\\") + \\\"e-8\\\");\\n}\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n }\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n }\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n }\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n }\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n }\",\n \"function getBase10Exponent(digits, e) {\\r\\n var w = digits[0];\\r\\n\\r\\n // Add the number of digits of the first word of the digits array.\\r\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\r\\n return e;\\r\\n }\",\n \"function getBase10Exponent(digits, e) {\\n var w = digits[0];\\n\\n // Add the number of digits of the first word of the digits array.\\n for (e *= LOG_BASE; w >= 10; w /= 10) {e++;}\\n return e;\\n }\",\n \"function baseDigits(n) {\\n return range(n).map(function(x) { return x.toString(n); });\\n}\",\n \"function writeInt(number) {\\n do {\\n encoded += URL64Code[(number & 0x1f) | (number > 0x1f ? 0x20 : 0)];\\n number >>= 5;\\n } while (number > 0);\\n }\",\n \"function getFrom10000To19999(x) {\\r\\n return getFrom11To19(Math.floor(x / 1000)) + getFromMILA(x);\\r\\n}\",\n \"function n(n) {\\n return n > 9 ? \\\"\\\" + n : \\\"0\\\" + n; \\n }\",\n \"bigNumber(value) {\\n return bignumber[\\\"a\\\" /* BigNumber */].from(value);\\n }\",\n \"function convert(num) {\\n\\n\\n}\",\n \"function getBinary(num) {\\n if (num === 0) return 0;\\n else return (num % 2) + 10 * getBinary(Math.floor(num / 2));\\n}\",\n \"function getBase10Exponent(digits, e) {\\n var w = digits[0];\\n\\n // Add the number of digits of the first word of the digits array.\\n for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\\n return e;\\n }\",\n \"toBase10(value, b = 62) {\\n const limit = value.length;\\n let result = base.indexOf(value[0]);\\n for (let i = 1; i < limit; i++) {\\n result = b * result + base.indexOf(value[i]);\\n }\\n return result;\\n }\",\n \"function latitudeBitsForResolution(resolution) {\\r\\n return Math.min(log2(EARTH_MERI_CIRCUMFERENCE / 2 / resolution), MAXIMUM_BITS_PRECISION);\\r\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function getMillerRabinTests(bits) {\\n if(bits <= 100) return 27;\\n if(bits <= 150) return 18;\\n if(bits <= 200) return 15;\\n if(bits <= 250) return 12;\\n if(bits <= 300) return 9;\\n if(bits <= 350) return 8;\\n if(bits <= 400) return 7;\\n if(bits <= 500) return 6;\\n if(bits <= 600) return 5;\\n if(bits <= 800) return 4;\\n if(bits <= 1250) return 3;\\n return 2;\\n}\",\n \"function checkbitsInt() {\\n\\tvar num = 1,\\n\\t\\tlastNum = 0,\\n\\t\\tbits = 0;\\n\\n\\tdo {\\n\\t\\tlastNum = num;\\n\\t\\tnum *= 2;\\n\\t\\tnum++;\\n\\t\\tbits++;\\n\\t} while ((((num - 1) / 2) === lastNum) && (bits < 101));\\n\\treturn bits;\\n}\",\n \"function fix(num, length) {\\n return ('' + num).length < length ? ((new Array(length + 1)).join('0') + num).slice(-length) : '' + num;\\n }\",\n \"function _changeNumber(_express, iSize) {\\n\\t_express = _express - 1 + 1;\\n\\tiSize = iSize - 1 + 1;\\n\\t\\n\\tiKey1 = Math.pow(10, 12);\\n\\tdTemp = Math.round(_express * iKey1);\\n\\tsTemp = \\\"\\\" + dTemp;\\n\\tiEndNum = sTemp.substring(sTemp.length - 1, sTemp.length) - 1 + 1\\n\\tif (iEndNum = 9) {\\n\\t\\tdTemp = dTemp + 1;\\n\\t} else {\\n\\t\\tdTemp = dTemp + 2;\\n\\t}\\n\\t\\n\\tdTemp = dTemp / iKey1;\\n\\n\\tiKey = Math.pow(10, iSize);\\n\\tdTemp = Math.round(dTemp * iKey);\\n\\t\\n\\treturn dTemp / iKey;\\n}\",\n \"function numberMax(n1, n2) {\\n // bit problem\\n}\",\n \"function glslifyNumber (n) {\\n return n === (n | 0) ? n + '.0' : n + '';\\n }\",\n \"function getLotto6() {\\n var num = getRanNum6();\\n for (var i = 0; i < num.length; i++) {\\n if (num[i] < 10) {\\n num[i] = \\\"0\\\" + num[i] \\n }\\n else {\\n num[i] = num[i].toString();\\n } \\n }\\n var cnum = num.join(\\\"\\\");\\n return cnum;\\n}\",\n \"function int2bigInt(t, bits, minSize) {\\n var i, k;\\n k = Math.ceil(bits / bpe) + 1;\\n k = minSize > k ? minSize : k;\\n buff = new Array(k);\\n copyInt_(buff, t);\\n return buff;\\n }\",\n \"function LCG(s) {\\n return function () {\\n s = Math.imul(16807, s) | 0 % 2147483647;\\n return (s & 2147483647) / 2147483648;\\n }\\n}\",\n \"function pad(n) { return (\\\"0\\\" + n).slice(-2); }\",\n \"function adjust(val) {\\n if (val < 0) {\\n return 0;\\n }\\n else if (val > 65535) {\\n return 65535;\\n }\\n else {\\n return val;\\n }\\n}\",\n \"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}\",\n \"function convert64to32(id) {\\n return new BigNumber(id).minus('76561197960265728');\\n}\",\n \"function toBigNumber(value) {\\n return web3.utils.toBN(value);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.63417995","0.60637635","0.59968776","0.59458524","0.5878678","0.58499455","0.5831066","0.57583326","0.57344615","0.571807","0.57118917","0.5695717","0.5691538","0.5676504","0.5668075","0.5662858","0.5655844","0.56378764","0.5586695","0.5567974","0.5567974","0.55656904","0.556477","0.556381","0.5547741","0.5526079","0.5502364","0.54930836","0.54912573","0.54884744","0.54875934","0.548305","0.5482424","0.54786307","0.5477603","0.5469484","0.54674274","0.54596734","0.54578596","0.54504955","0.544253","0.5434684","0.5427233","0.54248595","0.5415197","0.5414202","0.5410372","0.54059905","0.5395652","0.53860474","0.53840697","0.5382736","0.5382149","0.5380778","0.5380778","0.5380778","0.5380778","0.5380778","0.5380778","0.5380778","0.5380778","0.5378173","0.5377806","0.53774023","0.53774023","0.53774023","0.53774023","0.53774023","0.53774023","0.53692925","0.5368389","0.53618854","0.53467155","0.5345387","0.5344956","0.53370154","0.5333359","0.53277636","0.53242314","0.53239864","0.5314806","0.5314806","0.5314806","0.5314806","0.5314806","0.5314806","0.5314806","0.5314806","0.53120434","0.5308772","0.5308661","0.5305783","0.5303009","0.5302358","0.5300723","0.529777","0.52974945","0.52946556","0.52919215","0.52888983","0.5287479"],"string":"[\n \"0.63417995\",\n \"0.60637635\",\n \"0.59968776\",\n \"0.59458524\",\n \"0.5878678\",\n \"0.58499455\",\n \"0.5831066\",\n \"0.57583326\",\n \"0.57344615\",\n \"0.571807\",\n \"0.57118917\",\n \"0.5695717\",\n \"0.5691538\",\n \"0.5676504\",\n \"0.5668075\",\n \"0.5662858\",\n \"0.5655844\",\n \"0.56378764\",\n \"0.5586695\",\n \"0.5567974\",\n \"0.5567974\",\n \"0.55656904\",\n \"0.556477\",\n \"0.556381\",\n \"0.5547741\",\n \"0.5526079\",\n \"0.5502364\",\n \"0.54930836\",\n \"0.54912573\",\n \"0.54884744\",\n \"0.54875934\",\n \"0.548305\",\n \"0.5482424\",\n \"0.54786307\",\n \"0.5477603\",\n \"0.5469484\",\n \"0.54674274\",\n \"0.54596734\",\n \"0.54578596\",\n \"0.54504955\",\n \"0.544253\",\n \"0.5434684\",\n \"0.5427233\",\n \"0.54248595\",\n \"0.5415197\",\n \"0.5414202\",\n \"0.5410372\",\n \"0.54059905\",\n \"0.5395652\",\n \"0.53860474\",\n \"0.53840697\",\n \"0.5382736\",\n \"0.5382149\",\n \"0.5380778\",\n \"0.5380778\",\n \"0.5380778\",\n \"0.5380778\",\n \"0.5380778\",\n \"0.5380778\",\n \"0.5380778\",\n \"0.5380778\",\n \"0.5378173\",\n \"0.5377806\",\n \"0.53774023\",\n \"0.53774023\",\n \"0.53774023\",\n \"0.53774023\",\n \"0.53774023\",\n \"0.53774023\",\n \"0.53692925\",\n \"0.5368389\",\n \"0.53618854\",\n \"0.53467155\",\n \"0.5345387\",\n \"0.5344956\",\n \"0.53370154\",\n \"0.5333359\",\n \"0.53277636\",\n \"0.53242314\",\n \"0.53239864\",\n \"0.5314806\",\n \"0.5314806\",\n \"0.5314806\",\n \"0.5314806\",\n \"0.5314806\",\n \"0.5314806\",\n \"0.5314806\",\n \"0.5314806\",\n \"0.53120434\",\n \"0.5308772\",\n \"0.5308661\",\n \"0.5305783\",\n \"0.5303009\",\n \"0.5302358\",\n \"0.5300723\",\n \"0.529777\",\n \"0.52974945\",\n \"0.52946556\",\n \"0.52919215\",\n \"0.52888983\",\n \"0.5287479\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4690,"cells":{"query":{"kind":"string","value":"(protected) copy this to r"},"document":{"kind":"string","value":"function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\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":["copyR(rv) {\nthis._r.setFromRQ(r);\nreturn this;\n}","copyRV(rv) {\nRQ.setQV(this._r.xyzw, rv);\nreturn this;\n}","copyFrom(source) {\n this.r = source.r;\n this.g = source.g;\n this.b = source.b;\n this.a = source.a;\n return this;\n }","setR(r) {\nthis._r = r;\nreturn this;\n}","copy(from) {\n if (!from)\n return this;\n if (from.r !== undefined)\n this.r = from.r;\n if (from.g !== undefined)\n this.g = from.g;\n if (from.b !== undefined)\n this.b = from.b;\n if (from.a !== undefined)\n this.a = from.a;\n return this;\n }","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\r\n\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\r\n\t r.t = this.t;\r\n\t r.s = this.s;\r\n\t}","function bnpCopyTo(r) {\r\n\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\r\n\t r.t = this.t;\r\n\t r.s = this.s;\r\n\t}","function bnpCopyTo(r) {\n\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n\t r.t = this.t;\n\t r.s = this.s;\n\t }","copyTRV(tv, rv) {\nV3.setV3(this._t.xyz, tv);\nRQ.setQV(this._r.xyzw, rv);\nreturn this;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n r.t = this.t;\n r.s = this.s;\n }","copy() {\r\n return new Color(this.r, this.g, this.b, this.a);\r\n }","function bnpCopyTo(r) {\n\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n\t r.t = this.t;\n\t r.s = this.s;\n\t }","function bnpCopyTo(r) {\n\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n\t r.t = this.t;\n\t r.s = this.s;\n\t }","copy()\n\t{\n\t\treturn this.constructor.createNewInstance(this);\n\t}","function bnpCopyTo(r) {\n\tfor(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n\tr.t = this.t;\n\tr.s = this.s;\n }","copy() {\n return Object.assign(Object.create(this), JSON.parse(JSON.stringify(this)))\n }","function bnpCopyTo(r) {\n\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\n\t r.t = this.t\n\t r.s = this.s\n\t}","function bnpCopyTo(r) {\n\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\n\t r.t = this.t\n\t r.s = this.s\n\t}","copyTR(t, r) {\nthis._t.setFromE3V(t);\nthis._r.setFromRQ(r);\nreturn this;\n}","function bnpCopyTo(r) {\n\t for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n\t r.t = this.t;\n\t r.s = this.s;\n\t}","function bnpCopyTo(r) {\n\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n\t r.t = this.t;\n\t r.s = this.s;\n\t}","function bnpCopyTo(r) {\n\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n\t r.t = this.t;\n\t r.s = this.s;\n\t}","function copyTo(o,r) {\r\n for(var i = (r.t = o.t)-1; i >= 0; --i) r[i] = o[i];\r\n r.s = o.s;\r\n}","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) {\n r[i] = this[i];\n }r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) {\n r[i] = this[i];\n }r.t = this.t;\n r.s = this.s;\n }","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) {\n r[i] = this[i];\n }r.t = this.t;\n r.s = this.s;\n }","copy() {\n return Record.create(getSnapshot(self))\n }","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","function bnpCopyTo(r) {\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n r.t = this.t;\n r.s = this.s;\n}","clone() {\n return Object.assign(Object.create(this), this)\n }","clone() {\n return _.cloneDeep(this);\n }","copy() {\r\n let result = new Matrix(this.rows,this.cols);\r\n result.data = this.data.slice(0);\r\n return result;\r\n }","copyXYZW() {\nreturn RQ.copyOfQV(this.xyzw);\n}","copy (from) {\n\t\t\tthis.x = from.x; this.y = from.y; return this;\n\t\t}","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\n r.t = this.t\n r.s = this.s\n}","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\n r.t = this.t\n r.s = this.s\n}","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\n r.t = this.t\n r.s = this.s\n}","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\n r.t = this.t\n r.s = this.s\n}","function bnpCopyTo(r) {\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\n r.t = this.t\n r.s = this.s\n}"],"string":"[\n \"copyR(rv) {\\nthis._r.setFromRQ(r);\\nreturn this;\\n}\",\n \"copyRV(rv) {\\nRQ.setQV(this._r.xyzw, rv);\\nreturn this;\\n}\",\n \"copyFrom(source) {\\n this.r = source.r;\\n this.g = source.g;\\n this.b = source.b;\\n this.a = source.a;\\n return this;\\n }\",\n \"setR(r) {\\nthis._r = r;\\nreturn this;\\n}\",\n \"copy(from) {\\n if (!from)\\n return this;\\n if (from.r !== undefined)\\n this.r = from.r;\\n if (from.g !== undefined)\\n this.g = from.g;\\n if (from.b !== undefined)\\n this.b = from.b;\\n if (from.a !== undefined)\\n this.a = from.a;\\n return this;\\n }\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\r\\n\\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\\r\\n\\t r.t = this.t;\\r\\n\\t r.s = this.s;\\r\\n\\t}\",\n \"function bnpCopyTo(r) {\\r\\n\\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];\\r\\n\\t r.t = this.t;\\r\\n\\t r.s = this.s;\\r\\n\\t}\",\n \"function bnpCopyTo(r) {\\n\\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n\\t r.t = this.t;\\n\\t r.s = this.s;\\n\\t }\",\n \"copyTRV(tv, rv) {\\nV3.setV3(this._t.xyz, tv);\\nRQ.setQV(this._r.xyzw, rv);\\nreturn this;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n r.t = this.t;\\n r.s = this.s;\\n }\",\n \"copy() {\\r\\n return new Color(this.r, this.g, this.b, this.a);\\r\\n }\",\n \"function bnpCopyTo(r) {\\n\\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n\\t r.t = this.t;\\n\\t r.s = this.s;\\n\\t }\",\n \"function bnpCopyTo(r) {\\n\\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n\\t r.t = this.t;\\n\\t r.s = this.s;\\n\\t }\",\n \"copy()\\n\\t{\\n\\t\\treturn this.constructor.createNewInstance(this);\\n\\t}\",\n \"function bnpCopyTo(r) {\\n\\tfor(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n\\tr.t = this.t;\\n\\tr.s = this.s;\\n }\",\n \"copy() {\\n return Object.assign(Object.create(this), JSON.parse(JSON.stringify(this)))\\n }\",\n \"function bnpCopyTo(r) {\\n\\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\\n\\t r.t = this.t\\n\\t r.s = this.s\\n\\t}\",\n \"function bnpCopyTo(r) {\\n\\t for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\\n\\t r.t = this.t\\n\\t r.s = this.s\\n\\t}\",\n \"copyTR(t, r) {\\nthis._t.setFromE3V(t);\\nthis._r.setFromRQ(r);\\nreturn this;\\n}\",\n \"function bnpCopyTo(r) {\\n\\t for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n\\t r.t = this.t;\\n\\t r.s = this.s;\\n\\t}\",\n \"function bnpCopyTo(r) {\\n\\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n\\t r.t = this.t;\\n\\t r.s = this.s;\\n\\t}\",\n \"function bnpCopyTo(r) {\\n\\t for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\\n\\t r.t = this.t;\\n\\t r.s = this.s;\\n\\t}\",\n \"function copyTo(o,r) {\\r\\n for(var i = (r.t = o.t)-1; i >= 0; --i) r[i] = o[i];\\r\\n r.s = o.s;\\r\\n}\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) {\\n r[i] = this[i];\\n }r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) {\\n r[i] = this[i];\\n }r.t = this.t;\\n r.s = this.s;\\n }\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) {\\n r[i] = this[i];\\n }r.t = this.t;\\n r.s = this.s;\\n }\",\n \"copy() {\\n return Record.create(getSnapshot(self))\\n }\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"function bnpCopyTo(r) {\\n for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\\n r.t = this.t;\\n r.s = this.s;\\n}\",\n \"clone() {\\n return Object.assign(Object.create(this), this)\\n }\",\n \"clone() {\\n return _.cloneDeep(this);\\n }\",\n \"copy() {\\r\\n let result = new Matrix(this.rows,this.cols);\\r\\n result.data = this.data.slice(0);\\r\\n return result;\\r\\n }\",\n \"copyXYZW() {\\nreturn RQ.copyOfQV(this.xyzw);\\n}\",\n \"copy (from) {\\n\\t\\t\\tthis.x = from.x; this.y = from.y; return this;\\n\\t\\t}\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\\n r.t = this.t\\n r.s = this.s\\n}\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\\n r.t = this.t\\n r.s = this.s\\n}\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\\n r.t = this.t\\n r.s = this.s\\n}\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\\n r.t = this.t\\n r.s = this.s\\n}\",\n \"function bnpCopyTo(r) {\\n for (var i = this.t - 1; i >= 0; --i) r[i] = this[i]\\n r.t = this.t\\n r.s = this.s\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.75497603","0.72476476","0.72389024","0.7011037","0.6864913","0.64402145","0.64402145","0.6410029","0.6410029","0.63942933","0.63942933","0.63565814","0.63523525","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.63438","0.6311983","0.62882245","0.62882245","0.6285415","0.6281959","0.6274416","0.6271788","0.6271788","0.62696356","0.6258314","0.62420905","0.62420905","0.623672","0.62269694","0.62269694","0.62269694","0.61903113","0.618819","0.618819","0.618819","0.618819","0.618819","0.618819","0.618819","0.618819","0.618819","0.6182488","0.6181357","0.61791575","0.6169375","0.61621195","0.6157571","0.6157571","0.6157571","0.6157571","0.6157571"],"string":"[\n \"0.75497603\",\n \"0.72476476\",\n \"0.72389024\",\n \"0.7011037\",\n \"0.6864913\",\n \"0.64402145\",\n \"0.64402145\",\n \"0.6410029\",\n \"0.6410029\",\n \"0.63942933\",\n \"0.63942933\",\n \"0.63565814\",\n \"0.63523525\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.63438\",\n \"0.6311983\",\n \"0.62882245\",\n \"0.62882245\",\n \"0.6285415\",\n \"0.6281959\",\n \"0.6274416\",\n \"0.6271788\",\n \"0.6271788\",\n \"0.62696356\",\n \"0.6258314\",\n \"0.62420905\",\n \"0.62420905\",\n \"0.623672\",\n \"0.62269694\",\n \"0.62269694\",\n \"0.62269694\",\n \"0.61903113\",\n \"0.618819\",\n \"0.618819\",\n \"0.618819\",\n \"0.618819\",\n \"0.618819\",\n \"0.618819\",\n \"0.618819\",\n \"0.618819\",\n \"0.618819\",\n \"0.6182488\",\n \"0.6181357\",\n \"0.61791575\",\n \"0.6169375\",\n \"0.61621195\",\n \"0.6157571\",\n \"0.6157571\",\n \"0.6157571\",\n \"0.6157571\",\n \"0.6157571\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6274418"},"document_rank":{"kind":"string","value":"66"}}},{"rowIdx":4691,"cells":{"query":{"kind":"string","value":"(protected) set from integer value x, DV <= x < DV"},"document":{"kind":"string","value":"function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+DV;\n else this.t = 0;\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":["set x(value) {this._x = value;}","set x(v) {}","set setX (x) {\n this.x = x;\n }","set x(value) {}","function fromInt(o,x) {\r\n o.t = 1;\r\n o.s = (x<0)?-1:0;\r\n if(x > 0) o[0] = x;\r\n else if(x < -1) o[0] = x+DV;\r\n else o.t = 0;\r\n}","function numberInSet() {\n\n}","static set(of, sort = false) {\n return state.RangeSet.of(of, sort);\n }","setX(val) {\r\n this.x=val;\r\n }","setValue(x) {\n x = clamp(x, 0, 1);\n this.handle.position.x = this.width*x + this.position.x - 6;\n this.value = x;\n }","setX(x) { this.x = x; return this; }","set(val, idx) {\n\n }","setX(x) {\n this.setXY(toInt(x), this.position[1]);\n }","set x(x) {\n this[0] = x;\n }","setX(x){ this.x = x; }","static constrain(v){\r\n while(v<0){v+=1;}\r\n while(v>1){v-=1;}\r\n return v;\r\n }","setX(x)\n {\n this.x=x;\n }","function setX(i:int){\n\tif(i<0 || i>columns) print(\"Invalid size!\");\n\telse{\n\t\t_x=i*_offsetX;\n\t}\n}","function range(x) {\r\n let intRange = new Array(x);\r\n for (let i = 0; i < x; i++) {\r\n intRange[i] = i + 1;\r\n }\r\n return intRange;\r\n}","function constrain(x,lower,upper) {\n if (x > upper) {\n return upper;\n } else if (x < lower) {\n return lower;\n } else {\n return x;\n }\n }","set DXT1(value) {}","setx(a)\n\t{\n\t\tthis.x = a;\n\t}","set index(_val) {\n (typeof _val === \"number\") && (this.maxIndex = _val, this.minIndex = _val);\n }","_setX (x) {\n this._xPosition = x;\n this._dotElement.style.left = `${x}px`;\n\n // X position relative to center to simplify calculations\n let halfSliderWidth = this._sliderElement.offsetWidth / 2;\n let relativeX = x - halfSliderWidth;\n\n // Update style\n this._fillElement.style.width = `${Math.abs(relativeX)}px`;\n if (relativeX < 0) {\n this._fillElement.style.left = halfSliderWidth - Math.abs(relativeX) + \"px\";\n } else {\n this._fillElement.style.left = halfSliderWidth + \"px\";\n }\n }","set intValue(value) {}","function x(t){return t[0]=0,t[1]=0,t[2]=0,t[3]=1,t}","function domainX(x) {\n x.domain([35,90])\n}","function setValueV1i( gl, v ) {\n\n\t\tconst cache = this.cache;\n\n\t\tif ( cache[ 0 ] === v ) return;\n\n\t\tgl.uniform1i( this.addr, v );\n\n\t\tcache[ 0 ] = v;\n\n\t}","function setValueV1i( gl, v ) {\n\n\t\tconst cache = this.cache;\n\n\t\tif ( cache[ 0 ] === v ) return;\n\n\t\tgl.uniform1i( this.addr, v );\n\n\t\tcache[ 0 ] = v;\n\n\t}","set DXT5(value) {}","function xValue(d) { return d.x; } // accessors","function RangeSet(lower, upper){\n\tthis.lower = lower;\n\tthis.upper = upper;\n\tthis.getRange = function(){\n\t\treturn upper- lower;\n\t};\n}","set this[int](value) {}","set this[int](value) {}","set(x,y,z) {\r\n try {\r\n if ((typeof(x) !== \"number\") || (typeof(y) !== \"number\") || (typeof(z) !== \"number\"))\r\n throw \"vector component not a number\";\r\n else\r\n this.x = x; this.y = y; this.z = z;\r\n } // end try\r\n\r\n catch(e) {\r\n console.log(e);\r\n }\r\n }","function calculateSet(x0,y0,x,y, ratio, zoom){\n\n var a = (-2 + (x0 / x) * (1 + 2)) * zoom * ratio;\n var b = (-1 + (y0 / y) * (1 + 1)) * zoom * ratio;\n\n var ca = a;\n var cb = b;\n\n var i = 0;\n\n for (i ; i < MAX_ITER ; i++){\n var an = a * a - b * b;\n var bn = 2 * a * b;\n\n a = an + ca;\n b = bn + cb;\n\n if ( Math.pow(a,2) + Math.pow(b,2) > 4 ){\n break;\n }\n }\n\n return i;\n}","set minIndex(_val) {\n (typeof _val === \"number\") && this.setAttribute(\"min\", _val);\n }","function constrain(x, x0, x1) {\r\n return Math.min(Math.max(x, x0), x1);\r\n}","function setValueV1i( gl, v ) {\n\n\tconst cache = this.cache;\n\n\tif ( cache[ 0 ] === v ) return;\n\n\tgl.uniform1i( this.addr, v );\n\n\tcache[ 0 ] = v;\n\n}","set x(nx){\n\t\tthis.position.nx = nx;\n\t}","set(x,y,z) {\n try {\n if ((typeof(x) !== \"number\") || (typeof(y) !== \"number\") || (typeof(z) !== \"number\"))\n throw \"vector component not a number\";\n else\n this.x = x; this.y = y; this.z = z; \n } // end try\n \n catch(e) {\n console.log(e);\n }\n }","function setColorBasedOnValue (x) {\n\t\treturn x > 4 ? '#b30000' :\n\t\t\t\tx > 3 ? '#e34a33' :\n\t\t\t\tx > 2 ? '#fc8d59' :\n\t\t\t\tx > 1 ? '#fdcc8a' :\n\t\t\t\tx > 0 ? '#fef0d9' : '#990';\n\t}","function IncrementClamp(x, dx, upper){\n var newX = x+dx;\n if (newX > upper){\n return newX-upper;\n }\n return newX;\n}","mset(id, x, y) {\n if (id < 0 || id > this.mapData[0].tilesets[0].tileCount) {\n throw new RangeError(\"mset(): Tile id: \" + id + \" is out of the range / does not exist. \");\n }\n else if (x < 0 ||\n x >= this.mapData[0].layers[0].width ||\n y < 0 ||\n y >= this.mapData[0].layers[0].height) {\n throw new RangeError(\"mset(): Tile coordinate: \" + x + \" / \" + y + \" is out of the range. \");\n }\n this.mapData[0].layers[0].data[y][x] = id;\n }","restrictValue(values) {\n if (values[1].constructor === JQX.Utilities.BigNumber) {\n if (values[1].compare(values[0]) === -1) {\n values[1].set(values[0]);\n }\n }\n else {\n if (values[1] < values[0]) {\n values[1] = values[0];\n }\n }\n }","setPoint1X(x) {\n\n return this.point1.setX(x);\n }","function ejemploSet4(){\n let set = new Set([1,2,3,4,4,4,4,4,7,8,1]);\n console.log('set',set);\n console.log('has 4',set.has(4)); //true\n console.log('has 6',set.has(6)); //false\n}","set low(low){\n\t\tthis._low = low;\n\t}","set low(low){\n\t\tthis._low = low;\n\t}","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x < 0) ? -1 : 0;\n if (x > 0) this[0] = x;\n else if (x < -1) this[0] = x + DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x < 0) ? -1 : 0;\n if (x > 0) this[0] = x;\n else if (x < -1) this[0] = x + DV;\n else this.t = 0;\n }","function set_last_X_bits_to_bit_val(x, num_dd, bin_cs, bit_val) {\n var negate_bit_val = (bit_val + 1) % 2;\n\n if ((x + num_dd) > bin_cs.length) {\n\tconsole.log(\"APPU Error: (x(\" + x + \") + num_dd(\" + num_dd + \")) exceeds bin_cs.length(\" + bin_cs.length + \")\");\n\t//report_fatal_error(\"\");\n\treturn -1;\n }\n\n for (var i = (bin_cs.length - 1); i >= 0; i--) {\n\tif (x > 0) {\n\t bin_cs[i] = bit_val;\n\t x -= 1;\n\t}\n\telse if (i >= num_dd) {\n\t bin_cs[i] = negate_bit_val;\n\t}\n }\n return bin_cs\n}","set x(value = 42) {}","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x < 0) ? -1 : 0;\n if (x > 0) this[0] = x;\n else if (x < -1) this[0] = x + DV;\n else this.t = 0;\n }","Set() {}","siftdown(i, x) {\n\t\tlet cx = this.#minchild(x);\n\t\twhile (cx != 0 && this.#key[this.#item[cx]] < this.#key[i]) {\n\t\t\tthis.#item[x] = this.#item[cx]; this.#pos[this.#item[x]] = x;\n\t\t\tx = cx; cx = this.#minchild(x);\n\t\t}\n\t\tthis.#item[x] = i; this.#pos[i] = x;\n\t}","function xrangeset(min,max) {\n // Force the slider thumbs to adjust to the appropriate place\n $(\"#slider-range\").slider(\"option\", \"values\", [min,max]);\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+DV;\n else this.t = 0;\n }","set x(value) {\n var _a, _b;\n // value = Math.round(value);\n this._x = value;\n this.position.x = value;\n (_b = (_a = this.entity) === null || _a === void 0 ? void 0 : _a.gameObject) === null || _b === void 0 ? void 0 : _b.setPosition(value, this.y);\n }","range(val) {\n this._range = val;\n return this;\n }","function setValueV2i( gl, v ) {\n\n\t\tconst cache = this.cache;\n\n\t\tif ( v.x !== undefined ) {\n\n\t\t\tif ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y ) {\n\n\t\t\t\tgl.uniform2i( this.addr, v.x, v.y );\n\n\t\t\t\tcache[ 0 ] = v.x;\n\t\t\t\tcache[ 1 ] = v.y;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tif ( arraysEqual( cache, v ) ) return;\n\n\t\t\tgl.uniform2iv( this.addr, v );\n\n\t\t\tcopyArray( cache, v );\n\n\t\t}\n\n\t}","function selectionSort(set) {\n var size = set.length;\n\n // loop through each element\n for (var i = 0; i < size; i++) {\n // assumption: the location of the smallest value is the current index; initially 0\n var min_location = i;\n\n // find the location of the smallest value of the remaining elements\n // from j to size\n // initially, j = 1, then 2, etc\n // *** algorithmically similar to maxVal\n for (var j = i + 1; j < size; j++) {\n if (set[j] < set[min_location]) {\n min_location = j;\n }\n }\n // swap if the minimum value is not in the current value\n if (min_location != i) {\n var temp = set[i];\n set[i] = set[min_location];\n set[min_location] = temp;\n }\n }\n\n return set;\n}","function x(d) { return d.xVal; }","set(n, val) {\n //Takes the index of a certain node and changes the value of that node \n let foundNode = this.get(n)\n if (foundNode) {\n foundNode.val = val\n return true\n }\n else {\n return false\n }\n }","function setValueV2i( gl, v ) {\n\n\tconst cache = this.cache;\n\n\tif ( v.x !== undefined ) {\n\n\t\tif ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y ) {\n\n\t\t\tgl.uniform2i( this.addr, v.x, v.y );\n\n\t\t\tcache[ 0 ] = v.x;\n\t\t\tcache[ 1 ] = v.y;\n\n\t\t}\n\n\t} else {\n\n\t\tif ( arraysEqual( cache, v ) ) return;\n\n\t\tgl.uniform2iv( this.addr, v );\n\n\t\tcopyArray( cache, v );\n\n\t}\n\n}","function IntegerBufferSet() {\n this.$IntegerBufferSet_valueToPositionMap = {};\n this.$IntegerBufferSet_size = 0;\n this.$IntegerBufferSet_smallValues = new Heap(\n [], // Initial data in the heap\n this.$IntegerBufferSet_smallerComparator\n );\n this.$IntegerBufferSet_largeValues = new Heap(\n [], // Initial data in the heap\n this.$IntegerBufferSet_greaterComparator\n );\n\n this.getNewPositionForValue = this.getNewPositionForValue.bind(this);\n this.getValuePosition = this.getValuePosition.bind(this);\n this.getSize = this.getSize.bind(this);\n this.replaceFurthestValuePosition =\n this.replaceFurthestValuePosition.bind(this);\n }","function setBit(num, i){\n return num | (1 << i)\n}","function bnpFromInt(x) {\n\t this.t = 1;\n\t this.s = (x<0)?-1:0;\n\t if(x > 0) this[0] = x;\n\t else if(x < -1) this[0] = x+this.DV;\n\t else this.t = 0;\n\t }","set_parameter(id, value) {\n if (id > 39 || id < 0) {\n throw \"Out of bounds!\";\n } else {\n _parameters[id] = value;\n }\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function bnpFromInt(x) {\n this.t = 1;\n this.s = (x<0)?-1:0;\n if(x > 0) this[0] = x;\n else if(x < -1) this[0] = x+this.DV;\n else this.t = 0;\n }","function inProducer(x, y) {\r\n return (x >= 3 && x <= 4 && y >= 3 && y <= 4);\r\n}","function bnpFromInt(x) {\n\tthis.t = 1;\n\tthis.s = (x<0)?-1:0;\n\tif(x > 0) this[0] = x;\n\telse if(x < -1) this[0] = x+DV;\n\telse this.t = 0;\n }","function setX(xString) {\n x = Number(xString);\n}","set(v) { /* empty */ }","function set(d, s) {\n d[0] = s;\n for (var i = 1; i < UNPACKED_SIZE; ++i)\n d[i] = 0;\n }","set x (value)\n {\n if (value !== this._x || this.waiting === false)\n {\n this.queueMove(this.dir, value, spriteX);\n }\n }","static addToDivvy(w, lo, hi) {\n for (let i = lo; i <= hi; i++) {\n if (!this.divvy.has(i))\n this.divvy.set(i, new Set());\n if (DEBUG_MODE && this.divvy.get(i).has(w))\n throw new Error(\"programmer error: addtodivvy adding a dup\");\n this.divvy.get(i).add(w); // on set representing index i, add w.\n }\n }"],"string":"[\n \"set x(value) {this._x = value;}\",\n \"set x(v) {}\",\n \"set setX (x) {\\n this.x = x;\\n }\",\n \"set x(value) {}\",\n \"function fromInt(o,x) {\\r\\n o.t = 1;\\r\\n o.s = (x<0)?-1:0;\\r\\n if(x > 0) o[0] = x;\\r\\n else if(x < -1) o[0] = x+DV;\\r\\n else o.t = 0;\\r\\n}\",\n \"function numberInSet() {\\n\\n}\",\n \"static set(of, sort = false) {\\n return state.RangeSet.of(of, sort);\\n }\",\n \"setX(val) {\\r\\n this.x=val;\\r\\n }\",\n \"setValue(x) {\\n x = clamp(x, 0, 1);\\n this.handle.position.x = this.width*x + this.position.x - 6;\\n this.value = x;\\n }\",\n \"setX(x) { this.x = x; return this; }\",\n \"set(val, idx) {\\n\\n }\",\n \"setX(x) {\\n this.setXY(toInt(x), this.position[1]);\\n }\",\n \"set x(x) {\\n this[0] = x;\\n }\",\n \"setX(x){ this.x = x; }\",\n \"static constrain(v){\\r\\n while(v<0){v+=1;}\\r\\n while(v>1){v-=1;}\\r\\n return v;\\r\\n }\",\n \"setX(x)\\n {\\n this.x=x;\\n }\",\n \"function setX(i:int){\\n\\tif(i<0 || i>columns) print(\\\"Invalid size!\\\");\\n\\telse{\\n\\t\\t_x=i*_offsetX;\\n\\t}\\n}\",\n \"function range(x) {\\r\\n let intRange = new Array(x);\\r\\n for (let i = 0; i < x; i++) {\\r\\n intRange[i] = i + 1;\\r\\n }\\r\\n return intRange;\\r\\n}\",\n \"function constrain(x,lower,upper) {\\n if (x > upper) {\\n return upper;\\n } else if (x < lower) {\\n return lower;\\n } else {\\n return x;\\n }\\n }\",\n \"set DXT1(value) {}\",\n \"setx(a)\\n\\t{\\n\\t\\tthis.x = a;\\n\\t}\",\n \"set index(_val) {\\n (typeof _val === \\\"number\\\") && (this.maxIndex = _val, this.minIndex = _val);\\n }\",\n \"_setX (x) {\\n this._xPosition = x;\\n this._dotElement.style.left = `${x}px`;\\n\\n // X position relative to center to simplify calculations\\n let halfSliderWidth = this._sliderElement.offsetWidth / 2;\\n let relativeX = x - halfSliderWidth;\\n\\n // Update style\\n this._fillElement.style.width = `${Math.abs(relativeX)}px`;\\n if (relativeX < 0) {\\n this._fillElement.style.left = halfSliderWidth - Math.abs(relativeX) + \\\"px\\\";\\n } else {\\n this._fillElement.style.left = halfSliderWidth + \\\"px\\\";\\n }\\n }\",\n \"set intValue(value) {}\",\n \"function x(t){return t[0]=0,t[1]=0,t[2]=0,t[3]=1,t}\",\n \"function domainX(x) {\\n x.domain([35,90])\\n}\",\n \"function setValueV1i( gl, v ) {\\n\\n\\t\\tconst cache = this.cache;\\n\\n\\t\\tif ( cache[ 0 ] === v ) return;\\n\\n\\t\\tgl.uniform1i( this.addr, v );\\n\\n\\t\\tcache[ 0 ] = v;\\n\\n\\t}\",\n \"function setValueV1i( gl, v ) {\\n\\n\\t\\tconst cache = this.cache;\\n\\n\\t\\tif ( cache[ 0 ] === v ) return;\\n\\n\\t\\tgl.uniform1i( this.addr, v );\\n\\n\\t\\tcache[ 0 ] = v;\\n\\n\\t}\",\n \"set DXT5(value) {}\",\n \"function xValue(d) { return d.x; } // accessors\",\n \"function RangeSet(lower, upper){\\n\\tthis.lower = lower;\\n\\tthis.upper = upper;\\n\\tthis.getRange = function(){\\n\\t\\treturn upper- lower;\\n\\t};\\n}\",\n \"set this[int](value) {}\",\n \"set this[int](value) {}\",\n \"set(x,y,z) {\\r\\n try {\\r\\n if ((typeof(x) !== \\\"number\\\") || (typeof(y) !== \\\"number\\\") || (typeof(z) !== \\\"number\\\"))\\r\\n throw \\\"vector component not a number\\\";\\r\\n else\\r\\n this.x = x; this.y = y; this.z = z;\\r\\n } // end try\\r\\n\\r\\n catch(e) {\\r\\n console.log(e);\\r\\n }\\r\\n }\",\n \"function calculateSet(x0,y0,x,y, ratio, zoom){\\n\\n var a = (-2 + (x0 / x) * (1 + 2)) * zoom * ratio;\\n var b = (-1 + (y0 / y) * (1 + 1)) * zoom * ratio;\\n\\n var ca = a;\\n var cb = b;\\n\\n var i = 0;\\n\\n for (i ; i < MAX_ITER ; i++){\\n var an = a * a - b * b;\\n var bn = 2 * a * b;\\n\\n a = an + ca;\\n b = bn + cb;\\n\\n if ( Math.pow(a,2) + Math.pow(b,2) > 4 ){\\n break;\\n }\\n }\\n\\n return i;\\n}\",\n \"set minIndex(_val) {\\n (typeof _val === \\\"number\\\") && this.setAttribute(\\\"min\\\", _val);\\n }\",\n \"function constrain(x, x0, x1) {\\r\\n return Math.min(Math.max(x, x0), x1);\\r\\n}\",\n \"function setValueV1i( gl, v ) {\\n\\n\\tconst cache = this.cache;\\n\\n\\tif ( cache[ 0 ] === v ) return;\\n\\n\\tgl.uniform1i( this.addr, v );\\n\\n\\tcache[ 0 ] = v;\\n\\n}\",\n \"set x(nx){\\n\\t\\tthis.position.nx = nx;\\n\\t}\",\n \"set(x,y,z) {\\n try {\\n if ((typeof(x) !== \\\"number\\\") || (typeof(y) !== \\\"number\\\") || (typeof(z) !== \\\"number\\\"))\\n throw \\\"vector component not a number\\\";\\n else\\n this.x = x; this.y = y; this.z = z; \\n } // end try\\n \\n catch(e) {\\n console.log(e);\\n }\\n }\",\n \"function setColorBasedOnValue (x) {\\n\\t\\treturn x > 4 ? '#b30000' :\\n\\t\\t\\t\\tx > 3 ? '#e34a33' :\\n\\t\\t\\t\\tx > 2 ? '#fc8d59' :\\n\\t\\t\\t\\tx > 1 ? '#fdcc8a' :\\n\\t\\t\\t\\tx > 0 ? '#fef0d9' : '#990';\\n\\t}\",\n \"function IncrementClamp(x, dx, upper){\\n var newX = x+dx;\\n if (newX > upper){\\n return newX-upper;\\n }\\n return newX;\\n}\",\n \"mset(id, x, y) {\\n if (id < 0 || id > this.mapData[0].tilesets[0].tileCount) {\\n throw new RangeError(\\\"mset(): Tile id: \\\" + id + \\\" is out of the range / does not exist. \\\");\\n }\\n else if (x < 0 ||\\n x >= this.mapData[0].layers[0].width ||\\n y < 0 ||\\n y >= this.mapData[0].layers[0].height) {\\n throw new RangeError(\\\"mset(): Tile coordinate: \\\" + x + \\\" / \\\" + y + \\\" is out of the range. \\\");\\n }\\n this.mapData[0].layers[0].data[y][x] = id;\\n }\",\n \"restrictValue(values) {\\n if (values[1].constructor === JQX.Utilities.BigNumber) {\\n if (values[1].compare(values[0]) === -1) {\\n values[1].set(values[0]);\\n }\\n }\\n else {\\n if (values[1] < values[0]) {\\n values[1] = values[0];\\n }\\n }\\n }\",\n \"setPoint1X(x) {\\n\\n return this.point1.setX(x);\\n }\",\n \"function ejemploSet4(){\\n let set = new Set([1,2,3,4,4,4,4,4,7,8,1]);\\n console.log('set',set);\\n console.log('has 4',set.has(4)); //true\\n console.log('has 6',set.has(6)); //false\\n}\",\n \"set low(low){\\n\\t\\tthis._low = low;\\n\\t}\",\n \"set low(low){\\n\\t\\tthis._low = low;\\n\\t}\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x < 0) ? -1 : 0;\\n if (x > 0) this[0] = x;\\n else if (x < -1) this[0] = x + DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x < 0) ? -1 : 0;\\n if (x > 0) this[0] = x;\\n else if (x < -1) this[0] = x + DV;\\n else this.t = 0;\\n }\",\n \"function set_last_X_bits_to_bit_val(x, num_dd, bin_cs, bit_val) {\\n var negate_bit_val = (bit_val + 1) % 2;\\n\\n if ((x + num_dd) > bin_cs.length) {\\n\\tconsole.log(\\\"APPU Error: (x(\\\" + x + \\\") + num_dd(\\\" + num_dd + \\\")) exceeds bin_cs.length(\\\" + bin_cs.length + \\\")\\\");\\n\\t//report_fatal_error(\\\"\\\");\\n\\treturn -1;\\n }\\n\\n for (var i = (bin_cs.length - 1); i >= 0; i--) {\\n\\tif (x > 0) {\\n\\t bin_cs[i] = bit_val;\\n\\t x -= 1;\\n\\t}\\n\\telse if (i >= num_dd) {\\n\\t bin_cs[i] = negate_bit_val;\\n\\t}\\n }\\n return bin_cs\\n}\",\n \"set x(value = 42) {}\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x < 0) ? -1 : 0;\\n if (x > 0) this[0] = x;\\n else if (x < -1) this[0] = x + DV;\\n else this.t = 0;\\n }\",\n \"Set() {}\",\n \"siftdown(i, x) {\\n\\t\\tlet cx = this.#minchild(x);\\n\\t\\twhile (cx != 0 && this.#key[this.#item[cx]] < this.#key[i]) {\\n\\t\\t\\tthis.#item[x] = this.#item[cx]; this.#pos[this.#item[x]] = x;\\n\\t\\t\\tx = cx; cx = this.#minchild(x);\\n\\t\\t}\\n\\t\\tthis.#item[x] = i; this.#pos[i] = x;\\n\\t}\",\n \"function xrangeset(min,max) {\\n // Force the slider thumbs to adjust to the appropriate place\\n $(\\\"#slider-range\\\").slider(\\\"option\\\", \\\"values\\\", [min,max]);\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+DV;\\n else this.t = 0;\\n }\",\n \"set x(value) {\\n var _a, _b;\\n // value = Math.round(value);\\n this._x = value;\\n this.position.x = value;\\n (_b = (_a = this.entity) === null || _a === void 0 ? void 0 : _a.gameObject) === null || _b === void 0 ? void 0 : _b.setPosition(value, this.y);\\n }\",\n \"range(val) {\\n this._range = val;\\n return this;\\n }\",\n \"function setValueV2i( gl, v ) {\\n\\n\\t\\tconst cache = this.cache;\\n\\n\\t\\tif ( v.x !== undefined ) {\\n\\n\\t\\t\\tif ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y ) {\\n\\n\\t\\t\\t\\tgl.uniform2i( this.addr, v.x, v.y );\\n\\n\\t\\t\\t\\tcache[ 0 ] = v.x;\\n\\t\\t\\t\\tcache[ 1 ] = v.y;\\n\\n\\t\\t\\t}\\n\\n\\t\\t} else {\\n\\n\\t\\t\\tif ( arraysEqual( cache, v ) ) return;\\n\\n\\t\\t\\tgl.uniform2iv( this.addr, v );\\n\\n\\t\\t\\tcopyArray( cache, v );\\n\\n\\t\\t}\\n\\n\\t}\",\n \"function selectionSort(set) {\\n var size = set.length;\\n\\n // loop through each element\\n for (var i = 0; i < size; i++) {\\n // assumption: the location of the smallest value is the current index; initially 0\\n var min_location = i;\\n\\n // find the location of the smallest value of the remaining elements\\n // from j to size\\n // initially, j = 1, then 2, etc\\n // *** algorithmically similar to maxVal\\n for (var j = i + 1; j < size; j++) {\\n if (set[j] < set[min_location]) {\\n min_location = j;\\n }\\n }\\n // swap if the minimum value is not in the current value\\n if (min_location != i) {\\n var temp = set[i];\\n set[i] = set[min_location];\\n set[min_location] = temp;\\n }\\n }\\n\\n return set;\\n}\",\n \"function x(d) { return d.xVal; }\",\n \"set(n, val) {\\n //Takes the index of a certain node and changes the value of that node \\n let foundNode = this.get(n)\\n if (foundNode) {\\n foundNode.val = val\\n return true\\n }\\n else {\\n return false\\n }\\n }\",\n \"function setValueV2i( gl, v ) {\\n\\n\\tconst cache = this.cache;\\n\\n\\tif ( v.x !== undefined ) {\\n\\n\\t\\tif ( cache[ 0 ] !== v.x || cache[ 1 ] !== v.y ) {\\n\\n\\t\\t\\tgl.uniform2i( this.addr, v.x, v.y );\\n\\n\\t\\t\\tcache[ 0 ] = v.x;\\n\\t\\t\\tcache[ 1 ] = v.y;\\n\\n\\t\\t}\\n\\n\\t} else {\\n\\n\\t\\tif ( arraysEqual( cache, v ) ) return;\\n\\n\\t\\tgl.uniform2iv( this.addr, v );\\n\\n\\t\\tcopyArray( cache, v );\\n\\n\\t}\\n\\n}\",\n \"function IntegerBufferSet() {\\n this.$IntegerBufferSet_valueToPositionMap = {};\\n this.$IntegerBufferSet_size = 0;\\n this.$IntegerBufferSet_smallValues = new Heap(\\n [], // Initial data in the heap\\n this.$IntegerBufferSet_smallerComparator\\n );\\n this.$IntegerBufferSet_largeValues = new Heap(\\n [], // Initial data in the heap\\n this.$IntegerBufferSet_greaterComparator\\n );\\n\\n this.getNewPositionForValue = this.getNewPositionForValue.bind(this);\\n this.getValuePosition = this.getValuePosition.bind(this);\\n this.getSize = this.getSize.bind(this);\\n this.replaceFurthestValuePosition =\\n this.replaceFurthestValuePosition.bind(this);\\n }\",\n \"function setBit(num, i){\\n return num | (1 << i)\\n}\",\n \"function bnpFromInt(x) {\\n\\t this.t = 1;\\n\\t this.s = (x<0)?-1:0;\\n\\t if(x > 0) this[0] = x;\\n\\t else if(x < -1) this[0] = x+this.DV;\\n\\t else this.t = 0;\\n\\t }\",\n \"set_parameter(id, value) {\\n if (id > 39 || id < 0) {\\n throw \\\"Out of bounds!\\\";\\n } else {\\n _parameters[id] = value;\\n }\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function bnpFromInt(x) {\\n this.t = 1;\\n this.s = (x<0)?-1:0;\\n if(x > 0) this[0] = x;\\n else if(x < -1) this[0] = x+this.DV;\\n else this.t = 0;\\n }\",\n \"function inProducer(x, y) {\\r\\n return (x >= 3 && x <= 4 && y >= 3 && y <= 4);\\r\\n}\",\n \"function bnpFromInt(x) {\\n\\tthis.t = 1;\\n\\tthis.s = (x<0)?-1:0;\\n\\tif(x > 0) this[0] = x;\\n\\telse if(x < -1) this[0] = x+DV;\\n\\telse this.t = 0;\\n }\",\n \"function setX(xString) {\\n x = Number(xString);\\n}\",\n \"set(v) { /* empty */ }\",\n \"function set(d, s) {\\n d[0] = s;\\n for (var i = 1; i < UNPACKED_SIZE; ++i)\\n d[i] = 0;\\n }\",\n \"set x (value)\\n {\\n if (value !== this._x || this.waiting === false)\\n {\\n this.queueMove(this.dir, value, spriteX);\\n }\\n }\",\n \"static addToDivvy(w, lo, hi) {\\n for (let i = lo; i <= hi; i++) {\\n if (!this.divvy.has(i))\\n this.divvy.set(i, new Set());\\n if (DEBUG_MODE && this.divvy.get(i).has(w))\\n throw new Error(\\\"programmer error: addtodivvy adding a dup\\\");\\n this.divvy.get(i).add(w); // on set representing index i, add w.\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5840981","0.5767726","0.56658965","0.5584814","0.5517628","0.5415022","0.5413354","0.53563","0.5282238","0.52688783","0.5221515","0.52208304","0.5156121","0.5138402","0.5137577","0.5112822","0.50835586","0.504482","0.50268924","0.501813","0.50094223","0.5008662","0.49136204","0.4901228","0.48960808","0.48870477","0.4861168","0.4861168","0.48545337","0.48543006","0.48531717","0.48456237","0.48456237","0.48397747","0.48396274","0.48392516","0.48043275","0.4802058","0.4787821","0.47826657","0.47569567","0.47486326","0.47436762","0.47330317","0.47316363","0.47224265","0.47130856","0.47130856","0.46976468","0.46976468","0.469635","0.46753326","0.467218","0.4670477","0.46673483","0.46669078","0.4666753","0.4666085","0.4661059","0.46528938","0.46517488","0.46446463","0.46368235","0.46346697","0.4633081","0.4629726","0.4626866","0.4626179","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46221694","0.46201596","0.46200937","0.46165067","0.46146956","0.46098137","0.46095335","0.46039808"],"string":"[\n \"0.5840981\",\n \"0.5767726\",\n \"0.56658965\",\n \"0.5584814\",\n \"0.5517628\",\n \"0.5415022\",\n \"0.5413354\",\n \"0.53563\",\n \"0.5282238\",\n \"0.52688783\",\n \"0.5221515\",\n \"0.52208304\",\n \"0.5156121\",\n \"0.5138402\",\n \"0.5137577\",\n \"0.5112822\",\n \"0.50835586\",\n \"0.504482\",\n \"0.50268924\",\n \"0.501813\",\n \"0.50094223\",\n \"0.5008662\",\n \"0.49136204\",\n \"0.4901228\",\n \"0.48960808\",\n \"0.48870477\",\n \"0.4861168\",\n \"0.4861168\",\n \"0.48545337\",\n \"0.48543006\",\n \"0.48531717\",\n \"0.48456237\",\n \"0.48456237\",\n \"0.48397747\",\n \"0.48396274\",\n \"0.48392516\",\n \"0.48043275\",\n \"0.4802058\",\n \"0.4787821\",\n \"0.47826657\",\n \"0.47569567\",\n \"0.47486326\",\n \"0.47436762\",\n \"0.47330317\",\n \"0.47316363\",\n \"0.47224265\",\n \"0.47130856\",\n \"0.47130856\",\n \"0.46976468\",\n \"0.46976468\",\n \"0.469635\",\n \"0.46753326\",\n \"0.467218\",\n \"0.4670477\",\n \"0.46673483\",\n \"0.46669078\",\n \"0.4666753\",\n \"0.4666085\",\n \"0.4661059\",\n \"0.46528938\",\n \"0.46517488\",\n \"0.46446463\",\n \"0.46368235\",\n \"0.46346697\",\n \"0.4633081\",\n \"0.4629726\",\n \"0.4626866\",\n \"0.4626179\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46221694\",\n \"0.46201596\",\n \"0.46200937\",\n \"0.46165067\",\n \"0.46146956\",\n \"0.46098137\",\n \"0.46095335\",\n \"0.46039808\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4692,"cells":{"query":{"kind":"string","value":"return bigint initialized to value"},"document":{"kind":"string","value":"function nbv(i) { var r = nbi(); r.fromInt(i); return r; }"},"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 nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() { return new BigInteger(null); }","function nbi() {return new BigInteger(null);}","function nbi() {return new BigInteger(null);}","toBigInt() {\n return BigInt(this.toString());\n }","function nbi()\n{\n return new BigInteger(null);\n}","static fromBigInt(value, unsigned) {\n return Long.fromString(value.toString(), unsigned);\n }","function nbi() {\n return new BigInteger(null);\n}","function nbi() {\n return new BigInteger(null);\n}","function getBigIntConstructor() {\n if (typeof window !== 'undefined') {\n return window['BigInt'] || null;\n }\n\n if (typeof global !== 'undefined') {\n return global['BigInt'] || null;\n }\n\n if (typeof self !== 'undefined') {\n return self['BigInt'] || null;\n }\n\n throw new Error('Can\\'t search globals for BigInt!');\n }","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\n return new BigInteger(null);\n }","function nbi() { return new BigInteger$4(null); }","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function parseBigInt(b,a){return new BigInteger(b,a)}","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\n return new BigInteger(null);\n }","function nbi() {\r\n\t return new BigInteger(null);\r\n\t}","function nbv(i) {\n var r = new BigInteger()\n r.fromInt(i)\n return r\n}","function nbv(i) {\n var r = new BigInteger()\n r.fromInt(i)\n return r\n}","function nbv(i) {\n var r = new BigInteger()\n r.fromInt(i)\n return r\n}","function nbv(i) {\n var r = new BigInteger()\n r.fromInt(i)\n return r\n}","function nbv(i) {\n var r = new BigInteger()\n r.fromInt(i)\n return r\n}"],"string":"[\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() { return new BigInteger(null); }\",\n \"function nbi() {return new BigInteger(null);}\",\n \"function nbi() {return new BigInteger(null);}\",\n \"toBigInt() {\\n return BigInt(this.toString());\\n }\",\n \"function nbi()\\n{\\n return new BigInteger(null);\\n}\",\n \"static fromBigInt(value, unsigned) {\\n return Long.fromString(value.toString(), unsigned);\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n}\",\n \"function nbi() {\\n return new BigInteger(null);\\n}\",\n \"function getBigIntConstructor() {\\n if (typeof window !== 'undefined') {\\n return window['BigInt'] || null;\\n }\\n\\n if (typeof global !== 'undefined') {\\n return global['BigInt'] || null;\\n }\\n\\n if (typeof self !== 'undefined') {\\n return self['BigInt'] || null;\\n }\\n\\n throw new Error('Can\\\\'t search globals for BigInt!');\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() { return new BigInteger$4(null); }\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function parseBigInt(b,a){return new BigInteger(b,a)}\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\n return new BigInteger(null);\\n }\",\n \"function nbi() {\\r\\n\\t return new BigInteger(null);\\r\\n\\t}\",\n \"function nbv(i) {\\n var r = new BigInteger()\\n r.fromInt(i)\\n return r\\n}\",\n \"function nbv(i) {\\n var r = new BigInteger()\\n r.fromInt(i)\\n return r\\n}\",\n \"function nbv(i) {\\n var r = new BigInteger()\\n r.fromInt(i)\\n return r\\n}\",\n \"function nbv(i) {\\n var r = new BigInteger()\\n r.fromInt(i)\\n return r\\n}\",\n \"function nbv(i) {\\n var r = new BigInteger()\\n r.fromInt(i)\\n return r\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.6788916","0.67669594","0.67669594","0.6717212","0.6668359","0.66623807","0.6655804","0.6655804","0.6633499","0.6537913","0.6537913","0.6537913","0.64864737","0.6463325","0.6463325","0.6463325","0.6463325","0.6463325","0.6462601","0.6462601","0.6456022","0.63894707","0.63894707","0.63894707","0.63894707","0.63894707"],"string":"[\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.6788916\",\n \"0.67669594\",\n \"0.67669594\",\n \"0.6717212\",\n \"0.6668359\",\n \"0.66623807\",\n \"0.6655804\",\n \"0.6655804\",\n \"0.6633499\",\n \"0.6537913\",\n \"0.6537913\",\n \"0.6537913\",\n \"0.64864737\",\n \"0.6463325\",\n \"0.6463325\",\n \"0.6463325\",\n \"0.6463325\",\n \"0.6463325\",\n \"0.6462601\",\n \"0.6462601\",\n \"0.6456022\",\n \"0.63894707\",\n \"0.63894707\",\n \"0.63894707\",\n \"0.63894707\",\n \"0.63894707\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4693,"cells":{"query":{"kind":"string","value":"(protected) set from string and radix"},"document":{"kind":"string","value":"function bnpFromString(s,b) {\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 256) k = 8; // byte array\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else { this.fromRadix(s,b); return; }\n this.t = 0;\n this.s = 0;\n var i = s.length, mi = false, sh = 0;\n while(--i >= 0) {\n var x = (k==8)?s[i]&0xff:intAt(s,i);\n if(x < 0) {\n if(s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if(sh == 0)\n this[this.t++] = x;\n else if(sh+k > this.DB) {\n this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n this[this.t++] = (x>>(this.DB-sh));\n }\n else\n this[this.t-1] |= x<<sh;\n sh += k;\n if(sh >= this.DB) sh -= this.DB;\n }\n if(k == 8 && (s[0]&0x80) != 0) {\n this.s = -1;\n if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\n }\n this.clamp();\n if(mi) BigInteger.ZERO.subTo(this,this);\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":["setFromStr(name, value) {\n//---------\nreturn this.set(FourCC.fourCCInt(name), value);\n}","static fromString(str, unsigned, radix) {\n if (str.length === 0)\n throw Error('empty string');\n if (str === 'NaN' || str === 'Infinity' || str === '+Infinity' || str === '-Infinity')\n return Long.ZERO;\n if (typeof unsigned === 'number') {\n // For goog.math.long compatibility\n (radix = unsigned), (unsigned = false);\n }\n else {\n unsigned = !!unsigned;\n }\n radix = radix || 10;\n if (radix < 2 || 36 < radix)\n throw RangeError('radix');\n let p;\n if ((p = str.indexOf('-')) > 0)\n throw Error('interior hyphen');\n else if (p === 0) {\n return Long.fromString(str.substring(1), unsigned, radix).neg();\n }\n // Do several (8) digits each time through the loop, so as to\n // minimize the calls to the very expensive emulated div.\n const radixToPower = Long.fromNumber(Math.pow(radix, 8));\n let result = Long.ZERO;\n for (let i = 0; i < str.length; i += 8) {\n const size = Math.min(8, str.length - i), value = parseInt(str.substring(i, i + size), radix);\n if (size < 8) {\n const power = Long.fromNumber(Math.pow(radix, size));\n result = result.mul(power).add(Long.fromNumber(value));\n }\n else {\n result = result.mul(radixToPower);\n result = result.add(Long.fromNumber(value));\n }\n }\n result.unsigned = unsigned;\n return result;\n }","function sc_string2integer(s, radix) {\n return parseInt(s, radix);\n}","set(n) {\n if (n === undefined) {\n return this // don't bother\n }\n if (typeof n === 'string') {\n n = parse(n).num\n }\n let m = this\n let res = m.map((val) => {\n let obj = parse(val)\n obj.num = n\n if (obj.num === null) {\n return val\n }\n let fmt = val.has('#Ordinal') ? 'Ordinal' : 'Cardinal'\n if (val.has('#TextValue')) {\n fmt = val.has('#Ordinal') ? 'TextOrdinal' : 'TextCardinal'\n }\n let str = format(obj, fmt)\n // add commas to number\n if (obj.hasComma && fmt === 'Cardinal') {\n str = Number(str).toLocaleString()\n }\n val = val.not('#Currency')\n val.replaceWith(str, { tags: true })\n // handle plural/singular unit\n // agreeUnits(agree, val, obj)\n return val\n })\n return new Numbers(res.document, res.pointer)\n }","function parseInt_(radix) {\n return function(s) {\n var charset = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'.slice (0, radix);\n var pattern = new RegExp ('^[' + charset + ']+$', 'i');\n\n var t = s.replace (/^[+-]/, '');\n if (pattern.test (radix === 16 ? t.replace (/^0x/i, '') : t)) {\n var n = parseInt (s, radix);\n if ($.test ([]) ($.Integer) (n)) return Just (n);\n }\n return Nothing;\n };\n }","correctIndex(bytes, set) {\n if (set === '0') {\n let charCode = bytes.shift();\n return charCode < 32 ? charCode + 64 : charCode - 32;\n }\n else if (set === '1') {\n return bytes.shift() - 32;\n }\n else {\n return (bytes.shift() - 48) * 10 + bytes.shift() - 48;\n }\n }","function convert2IntegerWithRadix(str){\n return parseInt(str, 2); // passing it as a base 2\n}","function setX(xString) {\n x = Number(xString);\n}","_changeRadix(radix) {\n const that = this,\n newRadix = that._getRadix(radix),\n oldRadix = that.radix;\n\n if (newRadix === that._radixNumber) {\n return;\n }\n\n that.radix = radix;\n that._radixNumber = newRadix;\n\n const input = that.$.input,\n oldValue = input.value;\n let newValue, renderedValue;\n\n if (that.value !== null) {\n newValue = that._number.toString(newRadix, that._wordLengthNumber, that.leadingZeros);\n renderedValue = that._renderValue(newValue);\n }\n else {\n renderedValue = '';\n }\n\n input.value = renderedValue;\n that._cachedInputValue = renderedValue;\n\n that.$.radixDisplayButton.innerHTML = that._radixPrefixes[newRadix];\n\n that.$.fireEvent('radixChange', { 'radix': radix, 'oldRadix': oldRadix, 'displayedValue': renderedValue, 'oldDisplayedValue': oldValue });\n }","function parseBigInt(str, r) {\n return new BigInteger(str, r);\n }","function parseBigInt(str,r) {\n return new BigInteger(str,r);\n }","function parseBigInt(str, r) {\n return new BigInteger(str, r);\n }","function parseBigInt(str,r) {\n\t return new BigInteger(str,r);\n\t}","function parseBigInt(str, r) {\n\treturn new BigInteger(str, r);\n}","function caml_string_set (s, i, c) {\n if (i >>> 0 >= s.l) caml_string_bound_error();\n return caml_string_unsafe_set (s, i, c);\n}","function setBitString(BitStringObj , value) {\r\n\t//we assume lower bound is same as upper bound\r\n\tvar bitCount = BitStringObj.getSize();\r\n\t//print('Bounds ' + bitCount);\r\n\tfor (var i=bitCount-1;i>=0;i--) {\r\n\t\tvar bit = value & 1;\r\n\t\tif (bit) {\r\n\t\t\tBitStringObj.setBit(i);\r\n\t\t}\r\n\t\telse { \r\n\t\t\tBitStringObj.clearBit(i);\r\n\t\t}\r\n\t\tvalue = value >>> 1;\r\n\t}\r\n}","function convertToInteger(str) {\n return parseInt(str,10);/*radix is considered as the base d*/\n}","function parseBigInt(str,r) {\n return new BigInteger(str,r);\n}","function parseBigInt(str,r) {\n return new BigInteger(str,r);\n}","function parseBigInt(str,r) {\n return new BigInteger(str,r);\n}","function setValue(number){\n // change the int to string, split into array, reverse the order, join it back into a single string \n let s = number.toString().split('').reverse().join('');\n console.log(\"my S: \", s)\n // length of s, to know when to produce a 0\n let l = s.length;\n console.log(\"my L: \", l)\n console.log(\"digits.length: \", digits.length)\n // if length of the number is greater than digits array length, invoke generateDigits passing l minus length of digits array. i.e. 7-6. Unlikely to hit given the value within data-value attribute. if you reduce that starting value to something less, you can see this code run.\n if(l > digits.length){\n console.log('TEST! TEST!!')\n generateDigits(l - digits.length);\n }\n\n // for each i while i is less than the length of digits array, invoke setDigit(declared below)\n for(let i=0; i<digits.length; i++){\n // pass setDigit i as the digitIndex, and the i index of the s array as the number or 0\n setDigit(i, s[i] || 0)\n }\n }","SetValue(str)\n\t{\n\t\tthis.value = str;\n\t}","function parseBigInt(str,r) {\n return new jsbn.BigInteger(str,r);\n}","function sc_symbol2number(s, radix) {\n return sc_jsstring2number(s.slice(1), radix);\n}","function parseInteger(str, uopts) {\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing, 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise, 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace, 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal, 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride, '\"base\" and \"leadingZeroIsOctal\" are ' + 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn new Error('invalid number: ' + JSON.stringify(str));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn new Error('trailing characters after number: ' + JSON.stringify(str.slice(idx)));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn 0;\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n * If the string represents a value that cannot be precisely represented\n * by JavaScript, then we want to check that:\n *\n * - We never increased the value past MAX_SAFE_INTEGER\n * - We don't make the result negative and below MIN_SAFE_INTEGER\n *\n * Because we only ever increment the value during parsing, there's no\n * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n * again, losing precision in the process. This means that we only need\n * to do our checks here, at the end.\n */\n\tif (!options.allowImprecise && (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn new Error('number is outside of the supported range: ' + JSON.stringify(str.slice(start, idx)));\n\t}\n\n\treturn result;\n}","function TrieSetConstructor () {\n if (!(this instanceof TrieSetConstructor)) {\n return new TrieSetConstructor(word);\n }\n this.root = new TrieNodeConstructor(\"\");\n this.trieSize = 0;\n this.radixTable = {};\n this.radixLength = 26;\n for (var i = 0; i < this.radixLength; i+=1) {\n var letter = String.fromCharCode(97 + i);\n this.radixTable[letter] = i;\n }\n}","function convertToBase10(string) {\n if (parseInt(string, 10)) {\n return parseInt(string, 10);\n } else if (string === '0' || string === '1') {\n return NaN;\n } else if (string.startsWith('0b') && parseInt(string.substr(2), 2)) {\n return parseInt(string.substr(2), 2);\n } else if (roman.parseRoman(string)) {\n return roman.parseRoman(string);\n } else if (string.startsWith('0x') && parseInt(string, 16)) {\n return parseInt(string, 16);\n }\n return NaN;\n\n}","function parseTriple(str, base) {\n var n = parseInt(str, base);\n return (n << 8) >> 8;\n}","function set(d, s) {\n d[0] = s;\n for (var i = 1; i < UNPACKED_SIZE; ++i)\n d[i] = 0;\n }","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","function parseInteger(str, uopts)\n{\n\tmod_assert.string(str, 'str');\n\tmod_assert.optionalObject(uopts, 'options');\n\n\tvar baseOverride = false;\n\tvar options = PI_DEFAULTS;\n\n\tif (uopts) {\n\t\tbaseOverride = hasKey(uopts, 'base');\n\t\toptions = mergeObjects(options, uopts);\n\t\tmod_assert.number(options.base, 'options.base');\n\t\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\n\t\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\n\t\tmod_assert.bool(options.allowSign, 'options.allowSign');\n\t\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\n\t\tmod_assert.bool(options.allowTrailing,\n\t\t 'options.allowTrailing');\n\t\tmod_assert.bool(options.allowImprecise,\n\t\t 'options.allowImprecise');\n\t\tmod_assert.bool(options.trimWhitespace,\n\t\t 'options.trimWhitespace');\n\t\tmod_assert.bool(options.leadingZeroIsOctal,\n\t\t 'options.leadingZeroIsOctal');\n\n\t\tif (options.leadingZeroIsOctal) {\n\t\t\tmod_assert.ok(!baseOverride,\n\t\t\t '\"base\" and \"leadingZeroIsOctal\" are ' +\n\t\t\t 'mutually exclusive');\n\t\t}\n\t}\n\n\tvar c;\n\tvar pbase = -1;\n\tvar base = options.base;\n\tvar start;\n\tvar mult = 1;\n\tvar value = 0;\n\tvar idx = 0;\n\tvar len = str.length;\n\n\t/* Trim any whitespace on the left side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check the number for a leading sign. */\n\tif (options.allowSign) {\n\t\tif (str[idx] === '-') {\n\t\t\tidx += 1;\n\t\t\tmult = -1;\n\t\t} else if (str[idx] === '+') {\n\t\t\tidx += 1;\n\t\t}\n\t}\n\n\t/* Parse the base-indicating prefix if there is one. */\n\tif (str[idx] === '0') {\n\t\tif (options.allowPrefix) {\n\t\t\tpbase = prefixToBase(str.charCodeAt(idx + 1));\n\t\t\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\n\t\t\t\tbase = pbase;\n\t\t\t\tidx += 2;\n\t\t\t}\n\t\t}\n\n\t\tif (pbase === -1 && options.leadingZeroIsOctal) {\n\t\t\tbase = 8;\n\t\t}\n\t}\n\n\t/* Parse the actual digits. */\n\tfor (start = idx; idx < len; ++idx) {\n\t\tc = translateDigit(str.charCodeAt(idx));\n\t\tif (c !== -1 && c < base) {\n\t\t\tvalue *= base;\n\t\t\tvalue += c;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* If we didn't parse any digits, we have an invalid number. */\n\tif (start === idx) {\n\t\treturn (new Error('invalid number: ' + JSON.stringify(str)));\n\t}\n\n\t/* Trim any whitespace on the right side. */\n\tif (options.trimWhitespace) {\n\t\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\n\t\t\t++idx;\n\t\t}\n\t}\n\n\t/* Check for trailing characters. */\n\tif (idx < len && !options.allowTrailing) {\n\t\treturn (new Error('trailing characters after number: ' +\n\t\t JSON.stringify(str.slice(idx))));\n\t}\n\n\t/* If our value is 0, we return now, to avoid returning -0. */\n\tif (value === 0) {\n\t\treturn (0);\n\t}\n\n\t/* Calculate our final value. */\n\tvar result = value * mult;\n\n\t/*\n\t * If the string represents a value that cannot be precisely represented\n\t * by JavaScript, then we want to check that:\n\t *\n\t * - We never increased the value past MAX_SAFE_INTEGER\n\t * - We don't make the result negative and below MIN_SAFE_INTEGER\n\t *\n\t * Because we only ever increment the value during parsing, there's no\n\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\n\t * again, losing precision in the process. This means that we only need\n\t * to do our checks here, at the end.\n\t */\n\tif (!options.allowImprecise &&\n\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\n\t\treturn (new Error('number is outside of the supported range: ' +\n\t\t JSON.stringify(str.slice(start, idx))));\n\t}\n\n\treturn (result);\n}","static numberSetFromStrings(value) {\n return new DynamoAttributeValue({ NS: value });\n }","function setZ(zString) {\n z = Number(zString);\n}","set stringValue(value) {}","function setNumber(number)\n{\n return phoneUtil.parseAndKeepRawInput(number, 'BR').values_[2];\n}","static fromString(str, optRadix) {\n return new Timestamp(long_1.Long.fromString(str, true, optRadix));\n }","constructor(digits) {\n this.digits = digits;\n }","constructor(digits) {\n this.digits = digits;\n }","function parseBigInt(str, r) {\n if(r == 64)\n return bigInt(b64tob8(str), 8);\n\n if(str.length === 0)\n str = \"0\";\n\n return bigInt(str, r);\n}","function Numeral(number){this._value=number;}","set this[string](value) {}","function setTwoDigit(num) {\n return (\"0\" + num).slice(-2);\n}","function str2bigInt(s, base, minSize) {\n var d, i, j, x, y, kk;\n var k = s.length;\n if (base == -1) { //comma-separated list of array elements in decimal\n x = new Array(0);\n for (; ; ) {\n y = new Array(x.length + 1);\n for (i = 0; i < x.length; i++)\n y[i + 1] = x[i];\n y[0] = parseInt(s, 10);\n x = y;\n d = s.indexOf(',', 0);\n if (d < 1)\n break;\n s = s.substring(d + 1);\n if (s.length == 0)\n break;\n }\n if (x.length < minSize) {\n y = new Array(minSize);\n copy_(y, x);\n return y;\n }\n return x;\n }\n\n x = int2bigInt(0, base * k, 0);\n for (i = 0; i < k; i++) {\n d = digitsStr.indexOf(s.substring(i, i + 1), 0);\n if (base <= 36 && d >= 36) //convert lowercase to uppercase if base<=36\n d -= 26;\n if (d >= base || d < 0) { //stop at first illegal character\n break;\n }\n multInt_(x, base);\n addInt_(x, d);\n }\n\n for (k = x.length; k > 0 && !x[k - 1]; k--); //strip off leading zeros\n k = minSize > k + 1 ? minSize : k + 1;\n y = new Array(k);\n kk = k < x.length ? k : x.length;\n for (i = 0; i < kk; i++)\n y[i] = x[i];\n for (; i < k; i++)\n y[i] = 0;\n return y;\n }","function str2bigInt(s,base,minSize) {\n var d, i, j, x, y, kk;\n var k=s.length;\n if (base==-1) { //comma-separated list of array elements in decimal\n x=new Array(0);\n for (;;) {\n y=new Array(x.length+1);\n for (i=0;i<x.length;i++)\n y[i+1]=x[i];\n y[0]=parseInt(s,10);\n x=y;\n d=s.indexOf(',',0);\n if (d<1) \n break;\n s=s.substring(d+1);\n if (s.length==0)\n break;\n }\n if (x.length<minSize) {\n y=new Array(minSize);\n copy_(y,x);\n return y;\n }\n return x;\n }\n\n // log2(base)*k\n var bb = base, p = 0;\n var b = base == 1 ? k : 0;\n while (bb > 1) {\n if (bb & 1) p = 1;\n b += k;\n bb >>= 1;\n }\n b += p*k;\n\n x=int2bigInt(0,b,0);\n for (i=0;i<k;i++) {\n d=digitsStr.indexOf(s.substring(i,i+1),0);\n if (base<=36 && d>=36) //convert lowercase to uppercase if base<=36\n d-=26;\n if (d>=base || d<0) { //stop at first illegal character\n break;\n }\n multInt_(x,base);\n addInt_(x,d);\n }\n\n for (k=x.length;k>0 && !x[k-1];k--); //strip off leading zeros\n k=minSize>k+1 ? minSize : k+1;\n y=new Array(k);\n kk=k<x.length ? k : x.length;\n for (i=0;i<kk;i++)\n y[i]=x[i];\n for (;i<k;i++)\n y[i]=0;\n return y;\n }","function bnpFromString(data, radix, unsigned) {\r\n\t var k;\r\n\t switch (radix) {\r\n\t case 2:\r\n\t k = 1;\r\n\t break;\r\n\t case 4:\r\n\t k = 2;\r\n\t break;\r\n\t case 8:\r\n\t k = 3;\r\n\t break;\r\n\t case 16:\r\n\t k = 4;\r\n\t break;\r\n\t case 32:\r\n\t k = 5;\r\n\t break;\r\n\t case 256:\r\n\t k = 8;\r\n\t break;\r\n\t default:\r\n\t this.fromRadix(data, radix);\r\n\t return;\r\n\t }\r\n\r\n\t this.t = 0;\r\n\t this.s = 0;\r\n\r\n\t var i = data.length;\r\n\t var mi = false;\r\n\t var sh = 0;\r\n\r\n\t while (--i >= 0) {\r\n\t var x = (k == 8) ? data[i] & 0xff : intAt(data, i);\r\n\t if (x < 0) {\r\n\t if (data.charAt(i) == \"-\") mi = true;\r\n\t continue;\r\n\t }\r\n\t mi = false;\r\n\t if (sh === 0)\r\n\t this[this.t++] = x;\r\n\t else if (sh + k > this.DB) {\r\n\t this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\r\n\t this[this.t++] = (x >> (this.DB - sh));\r\n\t }\r\n\t else\r\n\t this[this.t - 1] |= x << sh;\r\n\t sh += k;\r\n\t if (sh >= this.DB) sh -= this.DB;\r\n\t }\r\n\t if ((!unsigned) && k == 8 && (data[0] & 0x80) != 0) {\r\n\t this.s = -1;\r\n\t if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\r\n\t }\r\n\t this.clamp();\r\n\t if (mi) BigInteger.ZERO.subTo(this, this);\r\n\t}","function bnpFromString(data, radix, unsigned) {\n var k;\n switch (radix) {\n case 2:\n k = 1;\n break;\n case 4:\n k = 2;\n break;\n case 8:\n k = 3;\n break;\n case 16:\n k = 4;\n break;\n case 32:\n k = 5;\n break;\n case 256:\n k = 8;\n break;\n default:\n this.fromRadix(data, radix);\n return;\n }\n\n this.t = 0;\n this.s = 0;\n\n var i = data.length;\n var mi = false;\n var sh = 0;\n\n while (--i >= 0) {\n var x = (k == 8) ? data[i] & 0xff : intAt(data, i);\n if (x < 0) {\n if (data.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh === 0)\n this[this.t++] = x;\n else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\n this[this.t++] = (x >> (this.DB - sh));\n }\n else\n this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if ((!unsigned) && k == 8 && (data[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n}","function bnpFromString(data, radix, unsigned) {\r\n\t var k;\r\n\t switch (radix) {\r\n\t case 2:\r\n\t k = 1;\r\n\t break;\r\n\t case 4:\r\n\t k = 2;\r\n\t break;\r\n\t case 8:\r\n\t k = 3;\r\n\t break;\r\n\t case 16:\r\n\t k = 4;\r\n\t break;\r\n\t case 32:\r\n\t k = 5;\r\n\t break;\r\n\t case 256:\r\n\t k = 8;\r\n\t break;\r\n\t default:\r\n\t this.fromRadix(data, radix);\r\n\t return;\r\n\t }\r\n\r\n\t this.t = 0;\r\n\t this.s = 0;\r\n\r\n\t var i = data.length;\r\n\t var mi = false;\r\n\t var sh = 0;\r\n\r\n\t while (--i >= 0) {\r\n\t var x = (k == 8) ? data[i] & 0xff : intAt(data, i);\r\n\t if (x < 0) {\r\n\t if (data.charAt(i) == \"-\") mi = true;\r\n\t continue;\r\n\t }\r\n\t mi = false;\r\n\t if (sh === 0)\r\n\t this[this.t++] = x;\r\n\t else if (sh + k > this.DB) {\r\n\t this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\r\n\t this[this.t++] = (x >> (this.DB - sh));\r\n\t }\r\n\t else\r\n\t this[this.t - 1] |= x << sh;\r\n\t sh += k;\r\n\t if (sh >= this.DB) sh -= this.DB;\r\n\t }\r\n\t if ((!unsigned) && k == 8 && (data[0] & 0x80) != 0) {\r\n\t this.s = -1;\r\n\t if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\r\n\t }\r\n\t this.clamp();\r\n\t if (mi) BigInteger$4.ZERO.subTo(this, this);\r\n\t}","readNumber_int(radix, len) {\n let start = this.state.pos;\n let total = 0;\n for (let i = 0, end = len == null ? Infinity : len; i < end; ++i) {\n let code = this.input.charCodeAt(this.state.pos);\n let val;\n if (code >= 97) {\n val = code - 97 + 10; // a-z\n } else if (code >= 65) {\n val = code - 65 + 10; // A-Z\n } else if (code >= 48 && code <= 57) {\n val = code - 48; // 0-9\n } else {\n val = Infinity;\n }\n if (val >= radix) break;\n ++this.state.pos;\n total = total * radix + val;\n }\n if (this.state.pos === start || len != null && this.state.pos - start !== len) return null;\n\n return total;\n }","function convertStringToInt(string) {\n\tif(!isNaN(parseInt(string, 10))) {\n\t\t/* https://stackoverflow.com/questions/10398834/using-javascript-parseint-and-a-radix-parameter */\n\t\treturn parseInt(string, 10)\n\t} else {\n\t\treturn string;\n\t}\n}","function setNumber(id, value) {\n let text = padLeft(value.toString(), 2, '0');\n let digits = digitsElements[id];\n\n // remove extra elements if needed\n for (let i = digits.childElementCount; i > text.length; i--) {\n digits.removeChild(digits.lastElementChild);\n }\n\n // add missing elements if needed\n for (let i = digits.childElementCount; i < text.length; i++) {\n let digit = document.createElement('div');\n digit.className = 'digit';\n digits.appendChild(digit);\n }\n\n for (let i = 0; i < digits.childElementCount; i++) {\n let digit = digits.children[i];\n // only update this digit if needed\n if (text[i] !== digit.textContent) digit.textContent = text[i];\n }\n }","static fromString(representation) {\n // Parse state tracking\n let isNegative = false;\n let sawRadix = false;\n let foundNonZero = false;\n // Total number of significant digits (no leading or trailing zero)\n let significantDigits = 0;\n // Total number of significand digits read\n let nDigitsRead = 0;\n // Total number of digits (no leading zeros)\n let nDigits = 0;\n // The number of the digits after radix\n let radixPosition = 0;\n // The index of the first non-zero in *str*\n let firstNonZero = 0;\n // Digits Array\n const digits = [0];\n // The number of digits in digits\n let nDigitsStored = 0;\n // Insertion pointer for digits\n let digitsInsert = 0;\n // The index of the first non-zero digit\n let firstDigit = 0;\n // The index of the last digit\n let lastDigit = 0;\n // Exponent\n let exponent = 0;\n // loop index over array\n let i = 0;\n // The high 17 digits of the significand\n let significandHigh = new long_1.Long(0, 0);\n // The low 17 digits of the significand\n let significandLow = new long_1.Long(0, 0);\n // The biased exponent\n let biasedExponent = 0;\n // Read index\n let index = 0;\n // Naively prevent against REDOS attacks.\n // TODO: implementing a custom parsing for this, or refactoring the regex would yield\n // further gains.\n if (representation.length >= 7000) {\n throw new TypeError('' + representation + ' not a valid Decimal128 string');\n }\n // Results\n const stringMatch = representation.match(PARSE_STRING_REGEXP);\n const infMatch = representation.match(PARSE_INF_REGEXP);\n const nanMatch = representation.match(PARSE_NAN_REGEXP);\n // Validate the string\n if ((!stringMatch && !infMatch && !nanMatch) || representation.length === 0) {\n throw new TypeError('' + representation + ' not a valid Decimal128 string');\n }\n if (stringMatch) {\n // full_match = stringMatch[0]\n // sign = stringMatch[1]\n const unsignedNumber = stringMatch[2];\n // stringMatch[3] is undefined if a whole number (ex \"1\", 12\")\n // but defined if a number w/ decimal in it (ex \"1.0, 12.2\")\n const e = stringMatch[4];\n const expSign = stringMatch[5];\n const expNumber = stringMatch[6];\n // they provided e, but didn't give an exponent number. for ex \"1e\"\n if (e && expNumber === undefined)\n invalidErr(representation, 'missing exponent power');\n // they provided e, but didn't give a number before it. for ex \"e1\"\n if (e && unsignedNumber === undefined)\n invalidErr(representation, 'missing exponent base');\n if (e === undefined && (expSign || expNumber)) {\n invalidErr(representation, 'missing e before exponent');\n }\n }\n // Get the negative or positive sign\n if (representation[index] === '+' || representation[index] === '-') {\n isNegative = representation[index++] === '-';\n }\n // Check if user passed Infinity or NaN\n if (!isDigit(representation[index]) && representation[index] !== '.') {\n if (representation[index] === 'i' || representation[index] === 'I') {\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER));\n }\n else if (representation[index] === 'N') {\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(NAN_BUFFER));\n }\n }\n // Read all the digits\n while (isDigit(representation[index]) || representation[index] === '.') {\n if (representation[index] === '.') {\n if (sawRadix)\n invalidErr(representation, 'contains multiple periods');\n sawRadix = true;\n index = index + 1;\n continue;\n }\n if (nDigitsStored < 34) {\n if (representation[index] !== '0' || foundNonZero) {\n if (!foundNonZero) {\n firstNonZero = nDigitsRead;\n }\n foundNonZero = true;\n // Only store 34 digits\n digits[digitsInsert++] = parseInt(representation[index], 10);\n nDigitsStored = nDigitsStored + 1;\n }\n }\n if (foundNonZero)\n nDigits = nDigits + 1;\n if (sawRadix)\n radixPosition = radixPosition + 1;\n nDigitsRead = nDigitsRead + 1;\n index = index + 1;\n }\n if (sawRadix && !nDigitsRead)\n throw new TypeError('' + representation + ' not a valid Decimal128 string');\n // Read exponent if exists\n if (representation[index] === 'e' || representation[index] === 'E') {\n // Read exponent digits\n const match = representation.substr(++index).match(EXPONENT_REGEX);\n // No digits read\n if (!match || !match[2])\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(NAN_BUFFER));\n // Get exponent\n exponent = parseInt(match[0], 10);\n // Adjust the index\n index = index + match[0].length;\n }\n // Return not a number\n if (representation[index])\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(NAN_BUFFER));\n // Done reading input\n // Find first non-zero digit in digits\n firstDigit = 0;\n if (!nDigitsStored) {\n firstDigit = 0;\n lastDigit = 0;\n digits[0] = 0;\n nDigits = 1;\n nDigitsStored = 1;\n significantDigits = 0;\n }\n else {\n lastDigit = nDigitsStored - 1;\n significantDigits = nDigits;\n if (significantDigits !== 1) {\n while (representation[firstNonZero + significantDigits - 1] === '0') {\n significantDigits = significantDigits - 1;\n }\n }\n }\n // Normalization of exponent\n // Correct exponent based on radix position, and shift significand as needed\n // to represent user input\n // Overflow prevention\n if (exponent <= radixPosition && radixPosition - exponent > 1 << 14) {\n exponent = EXPONENT_MIN;\n }\n else {\n exponent = exponent - radixPosition;\n }\n // Attempt to normalize the exponent\n while (exponent > EXPONENT_MAX) {\n // Shift exponent to significand and decrease\n lastDigit = lastDigit + 1;\n if (lastDigit - firstDigit > MAX_DIGITS) {\n // Check if we have a zero then just hard clamp, otherwise fail\n const digitsString = digits.join('');\n if (digitsString.match(/^0+$/)) {\n exponent = EXPONENT_MAX;\n break;\n }\n invalidErr(representation, 'overflow');\n }\n exponent = exponent - 1;\n }\n while (exponent < EXPONENT_MIN || nDigitsStored < nDigits) {\n // Shift last digit. can only do this if < significant digits than # stored.\n if (lastDigit === 0 && significantDigits < nDigitsStored) {\n exponent = EXPONENT_MIN;\n significantDigits = 0;\n break;\n }\n if (nDigitsStored < nDigits) {\n // adjust to match digits not stored\n nDigits = nDigits - 1;\n }\n else {\n // adjust to round\n lastDigit = lastDigit - 1;\n }\n if (exponent < EXPONENT_MAX) {\n exponent = exponent + 1;\n }\n else {\n // Check if we have a zero then just hard clamp, otherwise fail\n const digitsString = digits.join('');\n if (digitsString.match(/^0+$/)) {\n exponent = EXPONENT_MAX;\n break;\n }\n invalidErr(representation, 'overflow');\n }\n }\n // Round\n // We've normalized the exponent, but might still need to round.\n if (lastDigit - firstDigit + 1 < significantDigits) {\n let endOfString = nDigitsRead;\n // If we have seen a radix point, 'string' is 1 longer than we have\n // documented with ndigits_read, so inc the position of the first nonzero\n // digit and the position that digits are read to.\n if (sawRadix) {\n firstNonZero = firstNonZero + 1;\n endOfString = endOfString + 1;\n }\n // if negative, we need to increment again to account for - sign at start.\n if (isNegative) {\n firstNonZero = firstNonZero + 1;\n endOfString = endOfString + 1;\n }\n const roundDigit = parseInt(representation[firstNonZero + lastDigit + 1], 10);\n let roundBit = 0;\n if (roundDigit >= 5) {\n roundBit = 1;\n if (roundDigit === 5) {\n roundBit = digits[lastDigit] % 2 === 1 ? 1 : 0;\n for (i = firstNonZero + lastDigit + 2; i < endOfString; i++) {\n if (parseInt(representation[i], 10)) {\n roundBit = 1;\n break;\n }\n }\n }\n }\n if (roundBit) {\n let dIdx = lastDigit;\n for (; dIdx >= 0; dIdx--) {\n if (++digits[dIdx] > 9) {\n digits[dIdx] = 0;\n // overflowed most significant digit\n if (dIdx === 0) {\n if (exponent < EXPONENT_MAX) {\n exponent = exponent + 1;\n digits[dIdx] = 1;\n }\n else {\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER));\n }\n }\n }\n }\n }\n }\n // Encode significand\n // The high 17 digits of the significand\n significandHigh = long_1.Long.fromNumber(0);\n // The low 17 digits of the significand\n significandLow = long_1.Long.fromNumber(0);\n // read a zero\n if (significantDigits === 0) {\n significandHigh = long_1.Long.fromNumber(0);\n significandLow = long_1.Long.fromNumber(0);\n }\n else if (lastDigit - firstDigit < 17) {\n let dIdx = firstDigit;\n significandLow = long_1.Long.fromNumber(digits[dIdx++]);\n significandHigh = new long_1.Long(0, 0);\n for (; dIdx <= lastDigit; dIdx++) {\n significandLow = significandLow.multiply(long_1.Long.fromNumber(10));\n significandLow = significandLow.add(long_1.Long.fromNumber(digits[dIdx]));\n }\n }\n else {\n let dIdx = firstDigit;\n significandHigh = long_1.Long.fromNumber(digits[dIdx++]);\n for (; dIdx <= lastDigit - 17; dIdx++) {\n significandHigh = significandHigh.multiply(long_1.Long.fromNumber(10));\n significandHigh = significandHigh.add(long_1.Long.fromNumber(digits[dIdx]));\n }\n significandLow = long_1.Long.fromNumber(digits[dIdx++]);\n for (; dIdx <= lastDigit; dIdx++) {\n significandLow = significandLow.multiply(long_1.Long.fromNumber(10));\n significandLow = significandLow.add(long_1.Long.fromNumber(digits[dIdx]));\n }\n }\n const significand = multiply64x2(significandHigh, long_1.Long.fromString('100000000000000000'));\n significand.low = significand.low.add(significandLow);\n if (lessThan(significand.low, significandLow)) {\n significand.high = significand.high.add(long_1.Long.fromNumber(1));\n }\n // Biased exponent\n biasedExponent = exponent + EXPONENT_BIAS;\n const dec = { low: long_1.Long.fromNumber(0), high: long_1.Long.fromNumber(0) };\n // Encode combination, exponent, and significand.\n if (significand.high.shiftRightUnsigned(49).and(long_1.Long.fromNumber(1)).equals(long_1.Long.fromNumber(1))) {\n // Encode '11' into bits 1 to 3\n dec.high = dec.high.or(long_1.Long.fromNumber(0x3).shiftLeft(61));\n dec.high = dec.high.or(long_1.Long.fromNumber(biasedExponent).and(long_1.Long.fromNumber(0x3fff).shiftLeft(47)));\n dec.high = dec.high.or(significand.high.and(long_1.Long.fromNumber(0x7fffffffffff)));\n }\n else {\n dec.high = dec.high.or(long_1.Long.fromNumber(biasedExponent & 0x3fff).shiftLeft(49));\n dec.high = dec.high.or(significand.high.and(long_1.Long.fromNumber(0x1ffffffffffff)));\n }\n dec.low = significand.low;\n // Encode sign\n if (isNegative) {\n dec.high = dec.high.or(long_1.Long.fromString('9223372036854775808'));\n }\n // Encode into a buffer\n const buffer$1 = buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.alloc(16);\n index = 0;\n // Encode the low 64 bits of the decimal\n // Encode low bits\n buffer$1[index++] = dec.low.low & 0xff;\n buffer$1[index++] = (dec.low.low >> 8) & 0xff;\n buffer$1[index++] = (dec.low.low >> 16) & 0xff;\n buffer$1[index++] = (dec.low.low >> 24) & 0xff;\n // Encode high bits\n buffer$1[index++] = dec.low.high & 0xff;\n buffer$1[index++] = (dec.low.high >> 8) & 0xff;\n buffer$1[index++] = (dec.low.high >> 16) & 0xff;\n buffer$1[index++] = (dec.low.high >> 24) & 0xff;\n // Encode the high 64 bits of the decimal\n // Encode low bits\n buffer$1[index++] = dec.high.low & 0xff;\n buffer$1[index++] = (dec.high.low >> 8) & 0xff;\n buffer$1[index++] = (dec.high.low >> 16) & 0xff;\n buffer$1[index++] = (dec.high.low >> 24) & 0xff;\n // Encode high bits\n buffer$1[index++] = dec.high.high & 0xff;\n buffer$1[index++] = (dec.high.high >> 8) & 0xff;\n buffer$1[index++] = (dec.high.high >> 16) & 0xff;\n buffer$1[index++] = (dec.high.high >> 24) & 0xff;\n // Return the new Decimal128\n return new Decimal128(buffer$1);\n }","constructor(str) {\n super(str.length * 2);\n\n const view = new Uint16Array(this.buffer);\n\n for (let i = 0; i < str.length; i++) {\n view[i] = str.charCodeAt(i);\n }\n }","function convertToInteger(str) {\n\n\n return parseInt(str, 2); // radix 2 -> binary base 2\n}","function bnpFromString(s, b) {\n\t var self = this\n\n\t var k\n\t if (b == 16) k = 4\n\t else if (b == 8) k = 3\n\t else if (b == 256) k = 8; // byte array\n\t else if (b == 2) k = 1\n\t else if (b == 32) k = 5\n\t else if (b == 4) k = 2\n\t else {\n\t self.fromRadix(s, b)\n\t return\n\t }\n\t self.t = 0\n\t self.s = 0\n\t var i = s.length,\n\t mi = false,\n\t sh = 0\n\t while (--i >= 0) {\n\t var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n\t if (x < 0) {\n\t if (s.charAt(i) == \"-\") mi = true\n\t continue\n\t }\n\t mi = false\n\t if (sh == 0)\n\t self[self.t++] = x\n\t else if (sh + k > self.DB) {\n\t self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n\t self[self.t++] = (x >> (self.DB - sh))\n\t } else\n\t self[self.t - 1] |= x << sh\n\t sh += k\n\t if (sh >= self.DB) sh -= self.DB\n\t }\n\t if (k == 8 && (s[0] & 0x80) != 0) {\n\t self.s = -1\n\t if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n\t }\n\t self.clamp()\n\t if (mi) BigInteger.ZERO.subTo(self, self)\n\t}","function bnpFromString(s, b) {\n\t var self = this\n\n\t var k\n\t if (b == 16) k = 4\n\t else if (b == 8) k = 3\n\t else if (b == 256) k = 8; // byte array\n\t else if (b == 2) k = 1\n\t else if (b == 32) k = 5\n\t else if (b == 4) k = 2\n\t else {\n\t self.fromRadix(s, b)\n\t return\n\t }\n\t self.t = 0\n\t self.s = 0\n\t var i = s.length,\n\t mi = false,\n\t sh = 0\n\t while (--i >= 0) {\n\t var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n\t if (x < 0) {\n\t if (s.charAt(i) == \"-\") mi = true\n\t continue\n\t }\n\t mi = false\n\t if (sh == 0)\n\t self[self.t++] = x\n\t else if (sh + k > self.DB) {\n\t self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n\t self[self.t++] = (x >> (self.DB - sh))\n\t } else\n\t self[self.t - 1] |= x << sh\n\t sh += k\n\t if (sh >= self.DB) sh -= self.DB\n\t }\n\t if (k == 8 && (s[0] & 0x80) != 0) {\n\t self.s = -1\n\t if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n\t }\n\t self.clamp()\n\t if (mi) BigInteger.ZERO.subTo(self, self)\n\t}","function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else {\n this.fromRadix(s, b);\n return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0)\n this[this.t++] = x;\n else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\n this[this.t++] = (x >> (this.DB - sh));\n } else\n this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }","function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else {\n this.fromRadix(s, b);\n return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0)\n this[this.t++] = x;\n else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\n this[this.t++] = (x >> (this.DB - sh));\n } else\n this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }","function Integer(v, radix, alphabet, caseSensitive) {\r\n if (typeof v === \"undefined\") return Integer[0];\r\n if (typeof radix !== \"undefined\") return +radix === 10 && !alphabet ? parseValue(v) : parseBase(v, radix, alphabet, caseSensitive);\r\n return parseValue(v);\r\n }","set normalized(value) {}","function bnpFromString(s, b) {\n var self = this\n\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else {\n self.fromRadix(s, b)\n return\n }\n self.t = 0\n self.s = 0\n var i = s.length,\n mi = false,\n sh = 0\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true\n continue\n }\n mi = false\n if (sh == 0)\n self[self.t++] = x\n else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n self[self.t++] = (x >> (self.DB - sh))\n } else\n self[self.t - 1] |= x << sh\n sh += k\n if (sh >= self.DB) sh -= self.DB\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n }\n self.clamp()\n if (mi) BigInteger.ZERO.subTo(self, self)\n}","function bnpFromString(s, b) {\n var self = this\n\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else {\n self.fromRadix(s, b)\n return\n }\n self.t = 0\n self.s = 0\n var i = s.length,\n mi = false,\n sh = 0\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true\n continue\n }\n mi = false\n if (sh == 0)\n self[self.t++] = x\n else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n self[self.t++] = (x >> (self.DB - sh))\n } else\n self[self.t - 1] |= x << sh\n sh += k\n if (sh >= self.DB) sh -= self.DB\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n }\n self.clamp()\n if (mi) BigInteger.ZERO.subTo(self, self)\n}","function bnpFromString(s, b) {\n var self = this\n\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else {\n self.fromRadix(s, b)\n return\n }\n self.t = 0\n self.s = 0\n var i = s.length,\n mi = false,\n sh = 0\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true\n continue\n }\n mi = false\n if (sh == 0)\n self[self.t++] = x\n else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n self[self.t++] = (x >> (self.DB - sh))\n } else\n self[self.t - 1] |= x << sh\n sh += k\n if (sh >= self.DB) sh -= self.DB\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n }\n self.clamp()\n if (mi) BigInteger.ZERO.subTo(self, self)\n}","function bnpFromString(s, b) {\n var self = this\n\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else {\n self.fromRadix(s, b)\n return\n }\n self.t = 0\n self.s = 0\n var i = s.length,\n mi = false,\n sh = 0\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true\n continue\n }\n mi = false\n if (sh == 0)\n self[self.t++] = x\n else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n self[self.t++] = (x >> (self.DB - sh))\n } else\n self[self.t - 1] |= x << sh\n sh += k\n if (sh >= self.DB) sh -= self.DB\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n }\n self.clamp()\n if (mi) BigInteger.ZERO.subTo(self, self)\n}","function bnpFromString(s, b) {\n var self = this\n\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else {\n self.fromRadix(s, b)\n return\n }\n self.t = 0\n self.s = 0\n var i = s.length,\n mi = false,\n sh = 0\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true\n continue\n }\n mi = false\n if (sh == 0)\n self[self.t++] = x\n else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n self[self.t++] = (x >> (self.DB - sh))\n } else\n self[self.t - 1] |= x << sh\n sh += k\n if (sh >= self.DB) sh -= self.DB\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n }\n self.clamp()\n if (mi) BigInteger.ZERO.subTo(self, self)\n}","function bnpFromString(s, b) {\n var self = this\n\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else {\n self.fromRadix(s, b)\n return\n }\n self.t = 0\n self.s = 0\n var i = s.length,\n mi = false,\n sh = 0\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true\n continue\n }\n mi = false\n if (sh == 0)\n self[self.t++] = x\n else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n self[self.t++] = (x >> (self.DB - sh))\n } else\n self[self.t - 1] |= x << sh\n sh += k\n if (sh >= self.DB) sh -= self.DB\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n }\n self.clamp()\n if (mi) BigInteger.ZERO.subTo(self, self)\n}","function bnpFromString(s, b) {\n var self = this\n\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else {\n self.fromRadix(s, b)\n return\n }\n self.t = 0\n self.s = 0\n var i = s.length,\n mi = false,\n sh = 0\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true\n continue\n }\n mi = false\n if (sh == 0)\n self[self.t++] = x\n else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\n self[self.t++] = (x >> (self.DB - sh))\n } else\n self[self.t - 1] |= x << sh\n sh += k\n if (sh >= self.DB) sh -= self.DB\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\n }\n self.clamp()\n if (mi) BigInteger.ZERO.subTo(self, self)\n}","function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else {\n this.fromRadix(s, b);\n return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0)\n this[this.t++] = x;\n else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\n this[this.t++] = (x >> (this.DB - sh));\n } else\n this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }","readInt(radix: number, len?: number): number | null {\n const start = this.state.pos;\n const forbiddenSiblings =\n radix === 16\n ? forbiddenNumericSeparatorSiblings.hex\n : forbiddenNumericSeparatorSiblings.decBinOct;\n const allowedSiblings =\n radix === 16\n ? allowedNumericSeparatorSiblings.hex\n : radix === 10\n ? allowedNumericSeparatorSiblings.dec\n : radix === 8\n ? allowedNumericSeparatorSiblings.oct\n : allowedNumericSeparatorSiblings.bin;\n\n let total = 0;\n\n for (let i = 0, e = len == null ? Infinity : len; i < e; ++i) {\n const code = this.input.charCodeAt(this.state.pos);\n let val;\n\n if (this.hasPlugin(\"numericSeparator\")) {\n const prev = this.input.charCodeAt(this.state.pos - 1);\n const next = this.input.charCodeAt(this.state.pos + 1);\n if (code === charCodes.underscore) {\n if (allowedSiblings.indexOf(next) === -1) {\n this.raise(this.state.pos, \"Invalid or unexpected token\");\n }\n\n if (\n forbiddenSiblings.indexOf(prev) > -1 ||\n forbiddenSiblings.indexOf(next) > -1 ||\n Number.isNaN(next)\n ) {\n this.raise(this.state.pos, \"Invalid or unexpected token\");\n }\n\n // Ignore this _ character\n ++this.state.pos;\n continue;\n }\n }\n\n if (code >= charCodes.lowercaseA) {\n val = code - charCodes.lowercaseA + charCodes.lineFeed;\n } else if (code >= charCodes.uppercaseA) {\n val = code - charCodes.uppercaseA + charCodes.lineFeed;\n }","function setLen(len) \n{\n\t// Create the len array.\n\tif (len.length == 0 || len == null)\n\t\tlen = \"13,14,15,16,19\";\n\tvar tmplen = len;\n\tn = 1;\n\twhile (tmplen.indexOf(\",\") != -1) \n\t{\n\t\ttmplen = tmplen.substring(tmplen.indexOf(\",\") + 1, tmplen.length);\n\t\tn++;\n\t}\n\tthis.len = new makeArray(n);\n\tn = 0;\n\twhile (len.indexOf(\",\") != -1) \n\t{\n\t\tvar tmpstr = len.substring(0, len.indexOf(\",\"));\n\t\tthis.len[n] = tmpstr;\n\t\tlen = len.substring(len.indexOf(\",\") + 1, len.length);\n\t\tn++;\n\t}\n\tthis.len[n] = len;\n\treturn this;\n}","function stringToNumber(str, base) {\n var sanitized, isDecimal;\n sanitized = str.replace(NumberNormalizeReg, function(chr) {\n var replacement = NumberNormalizeMap[chr];\n if(replacement === HalfWidthPeriod) {\n isDecimal = true;\n }\n return replacement;\n });\n return isDecimal ? parseFloat(sanitized) : parseInt(sanitized, base || 10);\n }","set intValue(value) {}","function readInt(radix, len) {\n var start = tokPos, total = 0;\n for (var i = 0, e = len == null ? Infinity : len; i < e; ++i) {\n var code = input.charCodeAt(tokPos), val;\n if (code >= 97) val = code - 97 + 10; // a\n else if (code >= 65) val = code - 65 + 10; // A\n else if (code >= 48 && code <= 57) val = code - 48; // 0-9\n else val = Infinity;\n if (val >= radix) break;\n ++tokPos;\n total = total * radix + val;\n }\n if (tokPos === start || len != null && tokPos - start !== len) return null;\n\n return total;\n }","function toBaseOut(str,baseIn,baseOut,alphabet){var j,arr=[0],arrL,i=0,len=str.length;for(;i<len;){for(arrL=arr.length;arrL--;arr[arrL]*=baseIn){;}arr[0]+=alphabet.indexOf(str.charAt(i++));for(j=0;j<arr.length;j++){if(arr[j]>baseOut-1){if(arr[j+1]==null)arr[j+1]=0;arr[j+1]+=arr[j]/baseOut|0;arr[j]%=baseOut}}}return arr.reverse()}// Convert a numeric string of baseIn to a numeric string of baseOut.","function jsoo_z_of_js_string_base(base, s) {\n if (base == 0) { // https://github.com/ocaml/Zarith/blob/b8dbaf48a7927061df699ad7ce642bb4f1fe5308/caml_z.c#L598\n base = 10;\n var p = 0;\n var sign = 1;\n if(s[p] == '-') { sign = -1; p++ }\n else if (s[p] == '+') { p++ }\n if (s[p] == '0') {\n p ++;\n if (s.length == p) {\n return 0;\n } else {\n var bc = s[p];\n if (bc == 'o' || bc == 'O') {\n base = 8;\n } else if (bc == 'x' || bc == 'X') {\n base = 16;\n } else if (bc == 'b' || bc == 'B') {\n base = 2;\n }\n if(base != 10) {\n s = s.substring(p+1);\n if(sign == -1) s = \"-\" + s;\n }\n }\n }\n }\n //remove leading '+'\n if (s[0] == '+') s = s.substring(1);\n //remove leading '0's\n s = s.replace(/^0+/, '');\n //normalize \"empty\" numbers\n if(s == '-' || s == '') s = '0';\n\n function digit(code){\n if(code >= 48 && code <= 57) return code - 48;\n if(code >= 97 && code <= 102) return code - 97 + 10;\n if(code >= 65 && code <= 70) return code - 65 + 10;\n }\n var i = 0;\n if(s[i] == '-') i++;\n for( ; i < s.length ; i++){\n var c = digit(s.charCodeAt(i));\n if(c == undefined || c >= base)\n caml_invalid_argument(\"Z.of_substring_base: invalid digit\");\n }\n return ml_z_normalize(bigInt(s, base));\n \n}","function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\n this.fromRadix(s, b);return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0) this[this.t++] = x;else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;\n this[this.t++] = x >> this.DB - sh;\n } else this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }","function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\n this.fromRadix(s, b);return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0) this[this.t++] = x;else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;\n this[this.t++] = x >> this.DB - sh;\n } else this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }","function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\n this.fromRadix(s, b);return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0) this[this.t++] = x;else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;\n this[this.t++] = x >> this.DB - sh;\n } else this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }","function get_int(str, index) {\n var orig = index;\n while (str[index] >= '0' && str[index] <= '9') {\n index++;\n }\n return { value: parseInt(str.slice(orig)), len: index - orig };\n}","function bnpFromString(s, b) {\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else { this.fromRadix(s, b); return; }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0)\n this[this.t++] = x;\n else if (sh + k > this.DB) {\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\n this[this.t++] = (x >> (this.DB - sh));\n } else\n this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n }","function convertOctal(string) {\n let num = parseInt(string,10);\n return num;\n}","function RangeFromStr(str) {\n\tvals = str.split('-');\n\t\n\tthis.low = vals[0];\n\tthis.high = vals[1];\n}","toBase10(value, b = 62) {\n const limit = value.length;\n let result = base.indexOf(value[0]);\n for (let i = 1; i < limit; i++) {\n result = b * result + base.indexOf(value[i]);\n }\n return result;\n }","function caml_parse_sign_and_base (s) {\n var i = 0, base = 10, sign = s.get(0) == 45?(i++,-1):1;\n if (s.get(i) == 48)\n switch (s.get(i + 1)) {\n case 120: case 88: base = 16; i += 2; break;\n case 111: case 79: base = 8; i += 2; break;\n case 98: case 66: base = 2; i += 2; break;\n }\n return [i, sign, base];\n}","function bnpFromString(s,b,unsigned) {\n\t var k;\n\t if(b == 16) k = 4;\n\t else if(b == 8) k = 3;\n\t else if(b == 256) k = 8; // byte array\n\t else if(b == 2) k = 1;\n\t else if(b == 32) k = 5;\n\t else if(b == 4) k = 2;\n\t else { this.fromRadix(s,b); return this; }\n\t this.t = 0;\n\t this.s = 0;\n\t var i = s.length, mi = false, sh = 0;\n\t while(--i >= 0) {\n\t var x = (k==8)?s[i]&0xff:intAt(s,i);\n\t if(x < 0) {\n\t if(s.charAt(i) == \"-\") mi = true;\n\t continue;\n\t }\n\t mi = false;\n\t if(sh == 0)\n\t this[this.t++] = x;\n\t else if(sh+k > this.DB) {\n\t this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n\t this[this.t++] = (x>>(this.DB-sh));\n\t }\n\t else\n\t this[this.t-1] |= x<<sh;\n\t sh += k;\n\t if(sh >= this.DB) sh -= this.DB;\n\t }\n\t if(!unsigned && k == 8 && (s[0]&0x80) != 0) {\n\t this.s = -1;\n\t if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\n\t }\n\t this.clamp();\n\t if(mi) BigInteger.ZERO.subTo(this,this);\n\t return this;\n\t }","function caml_string_unsafe_set (s, i, c) {\n // The OCaml compiler uses Char.unsafe_chr on integers larger than 255!\n c &= 0xff;\n if (s.t != 4 /* ARRAY */) {\n if (i == s.c.length) {\n s.c += String.fromCharCode (c);\n if (i + 1 == s.l) s.t = 0; /*BYTES | UNKOWN*/\n return 0;\n }\n caml_convert_string_to_array (s);\n }\n s.c[i] = c;\n return 0;\n}","function bnpFromString(s, b) {\n var self = this;\n\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\n self.fromRadix(s, b);\n return;\n }\n self.t = 0;\n self.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0) {\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\n if (x < 0) {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0) self[self.t++] = x;else if (sh + k > self.DB) {\n self[self.t - 1] |= (x & (1 << self.DB - sh) - 1) << sh;\n self[self.t++] = x >> self.DB - sh;\n } else self[self.t - 1] |= x << sh;\n sh += k;\n if (sh >= self.DB) sh -= self.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0) {\n self.s = -1;\n if (sh > 0) self[self.t - 1] |= (1 << self.DB - sh) - 1 << sh;\n }\n self.clamp();\n if (mi) BigInteger.ZERO.subTo(self, self);\n}","function bnpFromString(s,b) {\n\tvar k;\n\tif(b == 16) k = 4;\n\telse if(b == 8) k = 3;\n\telse if(b == 256) k = 8; // byte array\n\telse if(b == 2) k = 1;\n\telse if(b == 32) k = 5;\n\telse if(b == 4) k = 2;\n\telse { this.fromRadix(s,b); return; }\n\tthis.t = 0;\n\tthis.s = 0;\n\tvar i = s.length, mi = false, sh = 0;\n\twhile(--i >= 0) {\n\t var x = (k==8)?s[i]&0xff:intAt(s,i);\n\t if(x < 0) {\n\t\tif(s.charAt(i) == \"-\") mi = true;\n\t\tcontinue;\n\t }\n\t mi = false;\n\t if(sh == 0)\n\t\tthis[this.t++] = x;\n\t else if(sh+k > this.DB) {\n\t\tthis[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n\t\tthis[this.t++] = (x>>(this.DB-sh));\n\t }\n\t else\n\t\tthis[this.t-1] |= x<<sh;\n\t sh += k;\n\t if(sh >= this.DB) sh -= this.DB;\n\t}\n\tif(k == 8 && (s[0]&0x80) != 0) {\n\t this.s = -1;\n\t if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\n\t}\n\tthis.clamp();\n\tif(mi) BigInteger.ZERO.subTo(this,this);\n }","function bnpFromString(s,b) {\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 256) k = 8; // byte array\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else { this.fromRadix(s,b); return; }\n this.t = 0;\n this.s = 0;\n var i = s.length, mi = false, sh = 0;\n while(--i >= 0) {\n var x = (k==8)?s.charCodeAt(i)&0xff:intAt(s,i); /** MODIFIED **/\n if(x < 0) {\n if(s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if(sh == 0)\n this[this.t++] = x;\n else if(sh+k > this.DB) {\n this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n this[this.t++] = (x>>(this.DB-sh));\n }\n else\n this[this.t-1] |= x<<sh;\n sh += k;\n if(sh >= this.DB) sh -= this.DB;\n }\n if(k == 8 && (s[0]&0x80) != 0) {\n this.s = -1;\n if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\n }\n this.clamp();\n if(mi) BigInteger.ZERO.subTo(this,this);\n}","function digitize(val) {\n return Array.from('' + val, Number);\n}","function stringToNumber(str, base) {\n var sanitized, isDecimal;\n sanitized = str.replace(fullWidthNumberReg, function(chr) {\n var replacement = getOwn(fullWidthNumberMap, chr);\n if (replacement === HALF_WIDTH_PERIOD) {\n isDecimal = true;\n }\n return replacement;\n });\n return isDecimal ? parseFloat(sanitized) : parseInt(sanitized, base || 10);\n }","set Alpha9(value) {}","function bnpFromString(s, b)\n{\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 256) k = 8; // byte array\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else\n {\n this.fromRadix(s, b);\n return;\n }\n this.t = 0;\n this.s = 0;\n var i = s.length,\n mi = false,\n sh = 0;\n while (--i >= 0)\n {\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\n if (x < 0)\n {\n if (s.charAt(i) == \"-\") mi = true;\n continue;\n }\n mi = false;\n if (sh == 0)\n this[this.t++] = x;\n else if (sh + k > this.DB)\n {\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\n this[this.t++] = (x >> (this.DB - sh));\n }\n else\n this[this.t - 1] |= x << sh;\n sh += k;\n if (sh >= this.DB) sh -= this.DB;\n }\n if (k == 8 && (s[0] & 0x80) != 0)\n {\n this.s = -1;\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\n }\n this.clamp();\n if (mi) BigInteger.ZERO.subTo(this, this);\n}"],"string":"[\n \"setFromStr(name, value) {\\n//---------\\nreturn this.set(FourCC.fourCCInt(name), value);\\n}\",\n \"static fromString(str, unsigned, radix) {\\n if (str.length === 0)\\n throw Error('empty string');\\n if (str === 'NaN' || str === 'Infinity' || str === '+Infinity' || str === '-Infinity')\\n return Long.ZERO;\\n if (typeof unsigned === 'number') {\\n // For goog.math.long compatibility\\n (radix = unsigned), (unsigned = false);\\n }\\n else {\\n unsigned = !!unsigned;\\n }\\n radix = radix || 10;\\n if (radix < 2 || 36 < radix)\\n throw RangeError('radix');\\n let p;\\n if ((p = str.indexOf('-')) > 0)\\n throw Error('interior hyphen');\\n else if (p === 0) {\\n return Long.fromString(str.substring(1), unsigned, radix).neg();\\n }\\n // Do several (8) digits each time through the loop, so as to\\n // minimize the calls to the very expensive emulated div.\\n const radixToPower = Long.fromNumber(Math.pow(radix, 8));\\n let result = Long.ZERO;\\n for (let i = 0; i < str.length; i += 8) {\\n const size = Math.min(8, str.length - i), value = parseInt(str.substring(i, i + size), radix);\\n if (size < 8) {\\n const power = Long.fromNumber(Math.pow(radix, size));\\n result = result.mul(power).add(Long.fromNumber(value));\\n }\\n else {\\n result = result.mul(radixToPower);\\n result = result.add(Long.fromNumber(value));\\n }\\n }\\n result.unsigned = unsigned;\\n return result;\\n }\",\n \"function sc_string2integer(s, radix) {\\n return parseInt(s, radix);\\n}\",\n \"set(n) {\\n if (n === undefined) {\\n return this // don't bother\\n }\\n if (typeof n === 'string') {\\n n = parse(n).num\\n }\\n let m = this\\n let res = m.map((val) => {\\n let obj = parse(val)\\n obj.num = n\\n if (obj.num === null) {\\n return val\\n }\\n let fmt = val.has('#Ordinal') ? 'Ordinal' : 'Cardinal'\\n if (val.has('#TextValue')) {\\n fmt = val.has('#Ordinal') ? 'TextOrdinal' : 'TextCardinal'\\n }\\n let str = format(obj, fmt)\\n // add commas to number\\n if (obj.hasComma && fmt === 'Cardinal') {\\n str = Number(str).toLocaleString()\\n }\\n val = val.not('#Currency')\\n val.replaceWith(str, { tags: true })\\n // handle plural/singular unit\\n // agreeUnits(agree, val, obj)\\n return val\\n })\\n return new Numbers(res.document, res.pointer)\\n }\",\n \"function parseInt_(radix) {\\n return function(s) {\\n var charset = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'.slice (0, radix);\\n var pattern = new RegExp ('^[' + charset + ']+$', 'i');\\n\\n var t = s.replace (/^[+-]/, '');\\n if (pattern.test (radix === 16 ? t.replace (/^0x/i, '') : t)) {\\n var n = parseInt (s, radix);\\n if ($.test ([]) ($.Integer) (n)) return Just (n);\\n }\\n return Nothing;\\n };\\n }\",\n \"correctIndex(bytes, set) {\\n if (set === '0') {\\n let charCode = bytes.shift();\\n return charCode < 32 ? charCode + 64 : charCode - 32;\\n }\\n else if (set === '1') {\\n return bytes.shift() - 32;\\n }\\n else {\\n return (bytes.shift() - 48) * 10 + bytes.shift() - 48;\\n }\\n }\",\n \"function convert2IntegerWithRadix(str){\\n return parseInt(str, 2); // passing it as a base 2\\n}\",\n \"function setX(xString) {\\n x = Number(xString);\\n}\",\n \"_changeRadix(radix) {\\n const that = this,\\n newRadix = that._getRadix(radix),\\n oldRadix = that.radix;\\n\\n if (newRadix === that._radixNumber) {\\n return;\\n }\\n\\n that.radix = radix;\\n that._radixNumber = newRadix;\\n\\n const input = that.$.input,\\n oldValue = input.value;\\n let newValue, renderedValue;\\n\\n if (that.value !== null) {\\n newValue = that._number.toString(newRadix, that._wordLengthNumber, that.leadingZeros);\\n renderedValue = that._renderValue(newValue);\\n }\\n else {\\n renderedValue = '';\\n }\\n\\n input.value = renderedValue;\\n that._cachedInputValue = renderedValue;\\n\\n that.$.radixDisplayButton.innerHTML = that._radixPrefixes[newRadix];\\n\\n that.$.fireEvent('radixChange', { 'radix': radix, 'oldRadix': oldRadix, 'displayedValue': renderedValue, 'oldDisplayedValue': oldValue });\\n }\",\n \"function parseBigInt(str, r) {\\n return new BigInteger(str, r);\\n }\",\n \"function parseBigInt(str,r) {\\n return new BigInteger(str,r);\\n }\",\n \"function parseBigInt(str, r) {\\n return new BigInteger(str, r);\\n }\",\n \"function parseBigInt(str,r) {\\n\\t return new BigInteger(str,r);\\n\\t}\",\n \"function parseBigInt(str, r) {\\n\\treturn new BigInteger(str, r);\\n}\",\n \"function caml_string_set (s, i, c) {\\n if (i >>> 0 >= s.l) caml_string_bound_error();\\n return caml_string_unsafe_set (s, i, c);\\n}\",\n \"function setBitString(BitStringObj , value) {\\r\\n\\t//we assume lower bound is same as upper bound\\r\\n\\tvar bitCount = BitStringObj.getSize();\\r\\n\\t//print('Bounds ' + bitCount);\\r\\n\\tfor (var i=bitCount-1;i>=0;i--) {\\r\\n\\t\\tvar bit = value & 1;\\r\\n\\t\\tif (bit) {\\r\\n\\t\\t\\tBitStringObj.setBit(i);\\r\\n\\t\\t}\\r\\n\\t\\telse { \\r\\n\\t\\t\\tBitStringObj.clearBit(i);\\r\\n\\t\\t}\\r\\n\\t\\tvalue = value >>> 1;\\r\\n\\t}\\r\\n}\",\n \"function convertToInteger(str) {\\n return parseInt(str,10);/*radix is considered as the base d*/\\n}\",\n \"function parseBigInt(str,r) {\\n return new BigInteger(str,r);\\n}\",\n \"function parseBigInt(str,r) {\\n return new BigInteger(str,r);\\n}\",\n \"function parseBigInt(str,r) {\\n return new BigInteger(str,r);\\n}\",\n \"function setValue(number){\\n // change the int to string, split into array, reverse the order, join it back into a single string \\n let s = number.toString().split('').reverse().join('');\\n console.log(\\\"my S: \\\", s)\\n // length of s, to know when to produce a 0\\n let l = s.length;\\n console.log(\\\"my L: \\\", l)\\n console.log(\\\"digits.length: \\\", digits.length)\\n // if length of the number is greater than digits array length, invoke generateDigits passing l minus length of digits array. i.e. 7-6. Unlikely to hit given the value within data-value attribute. if you reduce that starting value to something less, you can see this code run.\\n if(l > digits.length){\\n console.log('TEST! TEST!!')\\n generateDigits(l - digits.length);\\n }\\n\\n // for each i while i is less than the length of digits array, invoke setDigit(declared below)\\n for(let i=0; i<digits.length; i++){\\n // pass setDigit i as the digitIndex, and the i index of the s array as the number or 0\\n setDigit(i, s[i] || 0)\\n }\\n }\",\n \"SetValue(str)\\n\\t{\\n\\t\\tthis.value = str;\\n\\t}\",\n \"function parseBigInt(str,r) {\\n return new jsbn.BigInteger(str,r);\\n}\",\n \"function sc_symbol2number(s, radix) {\\n return sc_jsstring2number(s.slice(1), radix);\\n}\",\n \"function parseInteger(str, uopts) {\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing, 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise, 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace, 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal, 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride, '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' + 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn new Error('invalid number: ' + JSON.stringify(str));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn new Error('trailing characters after number: ' + JSON.stringify(str.slice(idx)));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n * If the string represents a value that cannot be precisely represented\\n * by JavaScript, then we want to check that:\\n *\\n * - We never increased the value past MAX_SAFE_INTEGER\\n * - We don't make the result negative and below MIN_SAFE_INTEGER\\n *\\n * Because we only ever increment the value during parsing, there's no\\n * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n * again, losing precision in the process. This means that we only need\\n * to do our checks here, at the end.\\n */\\n\\tif (!options.allowImprecise && (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn new Error('number is outside of the supported range: ' + JSON.stringify(str.slice(start, idx)));\\n\\t}\\n\\n\\treturn result;\\n}\",\n \"function TrieSetConstructor () {\\n if (!(this instanceof TrieSetConstructor)) {\\n return new TrieSetConstructor(word);\\n }\\n this.root = new TrieNodeConstructor(\\\"\\\");\\n this.trieSize = 0;\\n this.radixTable = {};\\n this.radixLength = 26;\\n for (var i = 0; i < this.radixLength; i+=1) {\\n var letter = String.fromCharCode(97 + i);\\n this.radixTable[letter] = i;\\n }\\n}\",\n \"function convertToBase10(string) {\\n if (parseInt(string, 10)) {\\n return parseInt(string, 10);\\n } else if (string === '0' || string === '1') {\\n return NaN;\\n } else if (string.startsWith('0b') && parseInt(string.substr(2), 2)) {\\n return parseInt(string.substr(2), 2);\\n } else if (roman.parseRoman(string)) {\\n return roman.parseRoman(string);\\n } else if (string.startsWith('0x') && parseInt(string, 16)) {\\n return parseInt(string, 16);\\n }\\n return NaN;\\n\\n}\",\n \"function parseTriple(str, base) {\\n var n = parseInt(str, base);\\n return (n << 8) >> 8;\\n}\",\n \"function set(d, s) {\\n d[0] = s;\\n for (var i = 1; i < UNPACKED_SIZE; ++i)\\n d[i] = 0;\\n }\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"function parseInteger(str, uopts)\\n{\\n\\tmod_assert.string(str, 'str');\\n\\tmod_assert.optionalObject(uopts, 'options');\\n\\n\\tvar baseOverride = false;\\n\\tvar options = PI_DEFAULTS;\\n\\n\\tif (uopts) {\\n\\t\\tbaseOverride = hasKey(uopts, 'base');\\n\\t\\toptions = mergeObjects(options, uopts);\\n\\t\\tmod_assert.number(options.base, 'options.base');\\n\\t\\tmod_assert.ok(options.base >= 2, 'options.base >= 2');\\n\\t\\tmod_assert.ok(options.base <= 36, 'options.base <= 36');\\n\\t\\tmod_assert.bool(options.allowSign, 'options.allowSign');\\n\\t\\tmod_assert.bool(options.allowPrefix, 'options.allowPrefix');\\n\\t\\tmod_assert.bool(options.allowTrailing,\\n\\t\\t 'options.allowTrailing');\\n\\t\\tmod_assert.bool(options.allowImprecise,\\n\\t\\t 'options.allowImprecise');\\n\\t\\tmod_assert.bool(options.trimWhitespace,\\n\\t\\t 'options.trimWhitespace');\\n\\t\\tmod_assert.bool(options.leadingZeroIsOctal,\\n\\t\\t 'options.leadingZeroIsOctal');\\n\\n\\t\\tif (options.leadingZeroIsOctal) {\\n\\t\\t\\tmod_assert.ok(!baseOverride,\\n\\t\\t\\t '\\\"base\\\" and \\\"leadingZeroIsOctal\\\" are ' +\\n\\t\\t\\t 'mutually exclusive');\\n\\t\\t}\\n\\t}\\n\\n\\tvar c;\\n\\tvar pbase = -1;\\n\\tvar base = options.base;\\n\\tvar start;\\n\\tvar mult = 1;\\n\\tvar value = 0;\\n\\tvar idx = 0;\\n\\tvar len = str.length;\\n\\n\\t/* Trim any whitespace on the left side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check the number for a leading sign. */\\n\\tif (options.allowSign) {\\n\\t\\tif (str[idx] === '-') {\\n\\t\\t\\tidx += 1;\\n\\t\\t\\tmult = -1;\\n\\t\\t} else if (str[idx] === '+') {\\n\\t\\t\\tidx += 1;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the base-indicating prefix if there is one. */\\n\\tif (str[idx] === '0') {\\n\\t\\tif (options.allowPrefix) {\\n\\t\\t\\tpbase = prefixToBase(str.charCodeAt(idx + 1));\\n\\t\\t\\tif (pbase !== -1 && (!baseOverride || pbase === base)) {\\n\\t\\t\\t\\tbase = pbase;\\n\\t\\t\\t\\tidx += 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (pbase === -1 && options.leadingZeroIsOctal) {\\n\\t\\t\\tbase = 8;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Parse the actual digits. */\\n\\tfor (start = idx; idx < len; ++idx) {\\n\\t\\tc = translateDigit(str.charCodeAt(idx));\\n\\t\\tif (c !== -1 && c < base) {\\n\\t\\t\\tvalue *= base;\\n\\t\\t\\tvalue += c;\\n\\t\\t} else {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\t/* If we didn't parse any digits, we have an invalid number. */\\n\\tif (start === idx) {\\n\\t\\treturn (new Error('invalid number: ' + JSON.stringify(str)));\\n\\t}\\n\\n\\t/* Trim any whitespace on the right side. */\\n\\tif (options.trimWhitespace) {\\n\\t\\twhile (idx < len && isSpace(str.charCodeAt(idx))) {\\n\\t\\t\\t++idx;\\n\\t\\t}\\n\\t}\\n\\n\\t/* Check for trailing characters. */\\n\\tif (idx < len && !options.allowTrailing) {\\n\\t\\treturn (new Error('trailing characters after number: ' +\\n\\t\\t JSON.stringify(str.slice(idx))));\\n\\t}\\n\\n\\t/* If our value is 0, we return now, to avoid returning -0. */\\n\\tif (value === 0) {\\n\\t\\treturn (0);\\n\\t}\\n\\n\\t/* Calculate our final value. */\\n\\tvar result = value * mult;\\n\\n\\t/*\\n\\t * If the string represents a value that cannot be precisely represented\\n\\t * by JavaScript, then we want to check that:\\n\\t *\\n\\t * - We never increased the value past MAX_SAFE_INTEGER\\n\\t * - We don't make the result negative and below MIN_SAFE_INTEGER\\n\\t *\\n\\t * Because we only ever increment the value during parsing, there's no\\n\\t * chance of moving past MAX_SAFE_INTEGER and then dropping below it\\n\\t * again, losing precision in the process. This means that we only need\\n\\t * to do our checks here, at the end.\\n\\t */\\n\\tif (!options.allowImprecise &&\\n\\t (value > MAX_SAFE_INTEGER || result < MIN_SAFE_INTEGER)) {\\n\\t\\treturn (new Error('number is outside of the supported range: ' +\\n\\t\\t JSON.stringify(str.slice(start, idx))));\\n\\t}\\n\\n\\treturn (result);\\n}\",\n \"static numberSetFromStrings(value) {\\n return new DynamoAttributeValue({ NS: value });\\n }\",\n \"function setZ(zString) {\\n z = Number(zString);\\n}\",\n \"set stringValue(value) {}\",\n \"function setNumber(number)\\n{\\n return phoneUtil.parseAndKeepRawInput(number, 'BR').values_[2];\\n}\",\n \"static fromString(str, optRadix) {\\n return new Timestamp(long_1.Long.fromString(str, true, optRadix));\\n }\",\n \"constructor(digits) {\\n this.digits = digits;\\n }\",\n \"constructor(digits) {\\n this.digits = digits;\\n }\",\n \"function parseBigInt(str, r) {\\n if(r == 64)\\n return bigInt(b64tob8(str), 8);\\n\\n if(str.length === 0)\\n str = \\\"0\\\";\\n\\n return bigInt(str, r);\\n}\",\n \"function Numeral(number){this._value=number;}\",\n \"set this[string](value) {}\",\n \"function setTwoDigit(num) {\\n return (\\\"0\\\" + num).slice(-2);\\n}\",\n \"function str2bigInt(s, base, minSize) {\\n var d, i, j, x, y, kk;\\n var k = s.length;\\n if (base == -1) { //comma-separated list of array elements in decimal\\n x = new Array(0);\\n for (; ; ) {\\n y = new Array(x.length + 1);\\n for (i = 0; i < x.length; i++)\\n y[i + 1] = x[i];\\n y[0] = parseInt(s, 10);\\n x = y;\\n d = s.indexOf(',', 0);\\n if (d < 1)\\n break;\\n s = s.substring(d + 1);\\n if (s.length == 0)\\n break;\\n }\\n if (x.length < minSize) {\\n y = new Array(minSize);\\n copy_(y, x);\\n return y;\\n }\\n return x;\\n }\\n\\n x = int2bigInt(0, base * k, 0);\\n for (i = 0; i < k; i++) {\\n d = digitsStr.indexOf(s.substring(i, i + 1), 0);\\n if (base <= 36 && d >= 36) //convert lowercase to uppercase if base<=36\\n d -= 26;\\n if (d >= base || d < 0) { //stop at first illegal character\\n break;\\n }\\n multInt_(x, base);\\n addInt_(x, d);\\n }\\n\\n for (k = x.length; k > 0 && !x[k - 1]; k--); //strip off leading zeros\\n k = minSize > k + 1 ? minSize : k + 1;\\n y = new Array(k);\\n kk = k < x.length ? k : x.length;\\n for (i = 0; i < kk; i++)\\n y[i] = x[i];\\n for (; i < k; i++)\\n y[i] = 0;\\n return y;\\n }\",\n \"function str2bigInt(s,base,minSize) {\\n var d, i, j, x, y, kk;\\n var k=s.length;\\n if (base==-1) { //comma-separated list of array elements in decimal\\n x=new Array(0);\\n for (;;) {\\n y=new Array(x.length+1);\\n for (i=0;i<x.length;i++)\\n y[i+1]=x[i];\\n y[0]=parseInt(s,10);\\n x=y;\\n d=s.indexOf(',',0);\\n if (d<1) \\n break;\\n s=s.substring(d+1);\\n if (s.length==0)\\n break;\\n }\\n if (x.length<minSize) {\\n y=new Array(minSize);\\n copy_(y,x);\\n return y;\\n }\\n return x;\\n }\\n\\n // log2(base)*k\\n var bb = base, p = 0;\\n var b = base == 1 ? k : 0;\\n while (bb > 1) {\\n if (bb & 1) p = 1;\\n b += k;\\n bb >>= 1;\\n }\\n b += p*k;\\n\\n x=int2bigInt(0,b,0);\\n for (i=0;i<k;i++) {\\n d=digitsStr.indexOf(s.substring(i,i+1),0);\\n if (base<=36 && d>=36) //convert lowercase to uppercase if base<=36\\n d-=26;\\n if (d>=base || d<0) { //stop at first illegal character\\n break;\\n }\\n multInt_(x,base);\\n addInt_(x,d);\\n }\\n\\n for (k=x.length;k>0 && !x[k-1];k--); //strip off leading zeros\\n k=minSize>k+1 ? minSize : k+1;\\n y=new Array(k);\\n kk=k<x.length ? k : x.length;\\n for (i=0;i<kk;i++)\\n y[i]=x[i];\\n for (;i<k;i++)\\n y[i]=0;\\n return y;\\n }\",\n \"function bnpFromString(data, radix, unsigned) {\\r\\n\\t var k;\\r\\n\\t switch (radix) {\\r\\n\\t case 2:\\r\\n\\t k = 1;\\r\\n\\t break;\\r\\n\\t case 4:\\r\\n\\t k = 2;\\r\\n\\t break;\\r\\n\\t case 8:\\r\\n\\t k = 3;\\r\\n\\t break;\\r\\n\\t case 16:\\r\\n\\t k = 4;\\r\\n\\t break;\\r\\n\\t case 32:\\r\\n\\t k = 5;\\r\\n\\t break;\\r\\n\\t case 256:\\r\\n\\t k = 8;\\r\\n\\t break;\\r\\n\\t default:\\r\\n\\t this.fromRadix(data, radix);\\r\\n\\t return;\\r\\n\\t }\\r\\n\\r\\n\\t this.t = 0;\\r\\n\\t this.s = 0;\\r\\n\\r\\n\\t var i = data.length;\\r\\n\\t var mi = false;\\r\\n\\t var sh = 0;\\r\\n\\r\\n\\t while (--i >= 0) {\\r\\n\\t var x = (k == 8) ? data[i] & 0xff : intAt(data, i);\\r\\n\\t if (x < 0) {\\r\\n\\t if (data.charAt(i) == \\\"-\\\") mi = true;\\r\\n\\t continue;\\r\\n\\t }\\r\\n\\t mi = false;\\r\\n\\t if (sh === 0)\\r\\n\\t this[this.t++] = x;\\r\\n\\t else if (sh + k > this.DB) {\\r\\n\\t this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\r\\n\\t this[this.t++] = (x >> (this.DB - sh));\\r\\n\\t }\\r\\n\\t else\\r\\n\\t this[this.t - 1] |= x << sh;\\r\\n\\t sh += k;\\r\\n\\t if (sh >= this.DB) sh -= this.DB;\\r\\n\\t }\\r\\n\\t if ((!unsigned) && k == 8 && (data[0] & 0x80) != 0) {\\r\\n\\t this.s = -1;\\r\\n\\t if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\r\\n\\t }\\r\\n\\t this.clamp();\\r\\n\\t if (mi) BigInteger.ZERO.subTo(this, this);\\r\\n\\t}\",\n \"function bnpFromString(data, radix, unsigned) {\\n var k;\\n switch (radix) {\\n case 2:\\n k = 1;\\n break;\\n case 4:\\n k = 2;\\n break;\\n case 8:\\n k = 3;\\n break;\\n case 16:\\n k = 4;\\n break;\\n case 32:\\n k = 5;\\n break;\\n case 256:\\n k = 8;\\n break;\\n default:\\n this.fromRadix(data, radix);\\n return;\\n }\\n\\n this.t = 0;\\n this.s = 0;\\n\\n var i = data.length;\\n var mi = false;\\n var sh = 0;\\n\\n while (--i >= 0) {\\n var x = (k == 8) ? data[i] & 0xff : intAt(data, i);\\n if (x < 0) {\\n if (data.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh === 0)\\n this[this.t++] = x;\\n else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n this[this.t++] = (x >> (this.DB - sh));\\n }\\n else\\n this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if ((!unsigned) && k == 8 && (data[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n}\",\n \"function bnpFromString(data, radix, unsigned) {\\r\\n\\t var k;\\r\\n\\t switch (radix) {\\r\\n\\t case 2:\\r\\n\\t k = 1;\\r\\n\\t break;\\r\\n\\t case 4:\\r\\n\\t k = 2;\\r\\n\\t break;\\r\\n\\t case 8:\\r\\n\\t k = 3;\\r\\n\\t break;\\r\\n\\t case 16:\\r\\n\\t k = 4;\\r\\n\\t break;\\r\\n\\t case 32:\\r\\n\\t k = 5;\\r\\n\\t break;\\r\\n\\t case 256:\\r\\n\\t k = 8;\\r\\n\\t break;\\r\\n\\t default:\\r\\n\\t this.fromRadix(data, radix);\\r\\n\\t return;\\r\\n\\t }\\r\\n\\r\\n\\t this.t = 0;\\r\\n\\t this.s = 0;\\r\\n\\r\\n\\t var i = data.length;\\r\\n\\t var mi = false;\\r\\n\\t var sh = 0;\\r\\n\\r\\n\\t while (--i >= 0) {\\r\\n\\t var x = (k == 8) ? data[i] & 0xff : intAt(data, i);\\r\\n\\t if (x < 0) {\\r\\n\\t if (data.charAt(i) == \\\"-\\\") mi = true;\\r\\n\\t continue;\\r\\n\\t }\\r\\n\\t mi = false;\\r\\n\\t if (sh === 0)\\r\\n\\t this[this.t++] = x;\\r\\n\\t else if (sh + k > this.DB) {\\r\\n\\t this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\r\\n\\t this[this.t++] = (x >> (this.DB - sh));\\r\\n\\t }\\r\\n\\t else\\r\\n\\t this[this.t - 1] |= x << sh;\\r\\n\\t sh += k;\\r\\n\\t if (sh >= this.DB) sh -= this.DB;\\r\\n\\t }\\r\\n\\t if ((!unsigned) && k == 8 && (data[0] & 0x80) != 0) {\\r\\n\\t this.s = -1;\\r\\n\\t if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\r\\n\\t }\\r\\n\\t this.clamp();\\r\\n\\t if (mi) BigInteger$4.ZERO.subTo(this, this);\\r\\n\\t}\",\n \"readNumber_int(radix, len) {\\n let start = this.state.pos;\\n let total = 0;\\n for (let i = 0, end = len == null ? Infinity : len; i < end; ++i) {\\n let code = this.input.charCodeAt(this.state.pos);\\n let val;\\n if (code >= 97) {\\n val = code - 97 + 10; // a-z\\n } else if (code >= 65) {\\n val = code - 65 + 10; // A-Z\\n } else if (code >= 48 && code <= 57) {\\n val = code - 48; // 0-9\\n } else {\\n val = Infinity;\\n }\\n if (val >= radix) break;\\n ++this.state.pos;\\n total = total * radix + val;\\n }\\n if (this.state.pos === start || len != null && this.state.pos - start !== len) return null;\\n\\n return total;\\n }\",\n \"function convertStringToInt(string) {\\n\\tif(!isNaN(parseInt(string, 10))) {\\n\\t\\t/* https://stackoverflow.com/questions/10398834/using-javascript-parseint-and-a-radix-parameter */\\n\\t\\treturn parseInt(string, 10)\\n\\t} else {\\n\\t\\treturn string;\\n\\t}\\n}\",\n \"function setNumber(id, value) {\\n let text = padLeft(value.toString(), 2, '0');\\n let digits = digitsElements[id];\\n\\n // remove extra elements if needed\\n for (let i = digits.childElementCount; i > text.length; i--) {\\n digits.removeChild(digits.lastElementChild);\\n }\\n\\n // add missing elements if needed\\n for (let i = digits.childElementCount; i < text.length; i++) {\\n let digit = document.createElement('div');\\n digit.className = 'digit';\\n digits.appendChild(digit);\\n }\\n\\n for (let i = 0; i < digits.childElementCount; i++) {\\n let digit = digits.children[i];\\n // only update this digit if needed\\n if (text[i] !== digit.textContent) digit.textContent = text[i];\\n }\\n }\",\n \"static fromString(representation) {\\n // Parse state tracking\\n let isNegative = false;\\n let sawRadix = false;\\n let foundNonZero = false;\\n // Total number of significant digits (no leading or trailing zero)\\n let significantDigits = 0;\\n // Total number of significand digits read\\n let nDigitsRead = 0;\\n // Total number of digits (no leading zeros)\\n let nDigits = 0;\\n // The number of the digits after radix\\n let radixPosition = 0;\\n // The index of the first non-zero in *str*\\n let firstNonZero = 0;\\n // Digits Array\\n const digits = [0];\\n // The number of digits in digits\\n let nDigitsStored = 0;\\n // Insertion pointer for digits\\n let digitsInsert = 0;\\n // The index of the first non-zero digit\\n let firstDigit = 0;\\n // The index of the last digit\\n let lastDigit = 0;\\n // Exponent\\n let exponent = 0;\\n // loop index over array\\n let i = 0;\\n // The high 17 digits of the significand\\n let significandHigh = new long_1.Long(0, 0);\\n // The low 17 digits of the significand\\n let significandLow = new long_1.Long(0, 0);\\n // The biased exponent\\n let biasedExponent = 0;\\n // Read index\\n let index = 0;\\n // Naively prevent against REDOS attacks.\\n // TODO: implementing a custom parsing for this, or refactoring the regex would yield\\n // further gains.\\n if (representation.length >= 7000) {\\n throw new TypeError('' + representation + ' not a valid Decimal128 string');\\n }\\n // Results\\n const stringMatch = representation.match(PARSE_STRING_REGEXP);\\n const infMatch = representation.match(PARSE_INF_REGEXP);\\n const nanMatch = representation.match(PARSE_NAN_REGEXP);\\n // Validate the string\\n if ((!stringMatch && !infMatch && !nanMatch) || representation.length === 0) {\\n throw new TypeError('' + representation + ' not a valid Decimal128 string');\\n }\\n if (stringMatch) {\\n // full_match = stringMatch[0]\\n // sign = stringMatch[1]\\n const unsignedNumber = stringMatch[2];\\n // stringMatch[3] is undefined if a whole number (ex \\\"1\\\", 12\\\")\\n // but defined if a number w/ decimal in it (ex \\\"1.0, 12.2\\\")\\n const e = stringMatch[4];\\n const expSign = stringMatch[5];\\n const expNumber = stringMatch[6];\\n // they provided e, but didn't give an exponent number. for ex \\\"1e\\\"\\n if (e && expNumber === undefined)\\n invalidErr(representation, 'missing exponent power');\\n // they provided e, but didn't give a number before it. for ex \\\"e1\\\"\\n if (e && unsignedNumber === undefined)\\n invalidErr(representation, 'missing exponent base');\\n if (e === undefined && (expSign || expNumber)) {\\n invalidErr(representation, 'missing e before exponent');\\n }\\n }\\n // Get the negative or positive sign\\n if (representation[index] === '+' || representation[index] === '-') {\\n isNegative = representation[index++] === '-';\\n }\\n // Check if user passed Infinity or NaN\\n if (!isDigit(representation[index]) && representation[index] !== '.') {\\n if (representation[index] === 'i' || representation[index] === 'I') {\\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER));\\n }\\n else if (representation[index] === 'N') {\\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(NAN_BUFFER));\\n }\\n }\\n // Read all the digits\\n while (isDigit(representation[index]) || representation[index] === '.') {\\n if (representation[index] === '.') {\\n if (sawRadix)\\n invalidErr(representation, 'contains multiple periods');\\n sawRadix = true;\\n index = index + 1;\\n continue;\\n }\\n if (nDigitsStored < 34) {\\n if (representation[index] !== '0' || foundNonZero) {\\n if (!foundNonZero) {\\n firstNonZero = nDigitsRead;\\n }\\n foundNonZero = true;\\n // Only store 34 digits\\n digits[digitsInsert++] = parseInt(representation[index], 10);\\n nDigitsStored = nDigitsStored + 1;\\n }\\n }\\n if (foundNonZero)\\n nDigits = nDigits + 1;\\n if (sawRadix)\\n radixPosition = radixPosition + 1;\\n nDigitsRead = nDigitsRead + 1;\\n index = index + 1;\\n }\\n if (sawRadix && !nDigitsRead)\\n throw new TypeError('' + representation + ' not a valid Decimal128 string');\\n // Read exponent if exists\\n if (representation[index] === 'e' || representation[index] === 'E') {\\n // Read exponent digits\\n const match = representation.substr(++index).match(EXPONENT_REGEX);\\n // No digits read\\n if (!match || !match[2])\\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(NAN_BUFFER));\\n // Get exponent\\n exponent = parseInt(match[0], 10);\\n // Adjust the index\\n index = index + match[0].length;\\n }\\n // Return not a number\\n if (representation[index])\\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(NAN_BUFFER));\\n // Done reading input\\n // Find first non-zero digit in digits\\n firstDigit = 0;\\n if (!nDigitsStored) {\\n firstDigit = 0;\\n lastDigit = 0;\\n digits[0] = 0;\\n nDigits = 1;\\n nDigitsStored = 1;\\n significantDigits = 0;\\n }\\n else {\\n lastDigit = nDigitsStored - 1;\\n significantDigits = nDigits;\\n if (significantDigits !== 1) {\\n while (representation[firstNonZero + significantDigits - 1] === '0') {\\n significantDigits = significantDigits - 1;\\n }\\n }\\n }\\n // Normalization of exponent\\n // Correct exponent based on radix position, and shift significand as needed\\n // to represent user input\\n // Overflow prevention\\n if (exponent <= radixPosition && radixPosition - exponent > 1 << 14) {\\n exponent = EXPONENT_MIN;\\n }\\n else {\\n exponent = exponent - radixPosition;\\n }\\n // Attempt to normalize the exponent\\n while (exponent > EXPONENT_MAX) {\\n // Shift exponent to significand and decrease\\n lastDigit = lastDigit + 1;\\n if (lastDigit - firstDigit > MAX_DIGITS) {\\n // Check if we have a zero then just hard clamp, otherwise fail\\n const digitsString = digits.join('');\\n if (digitsString.match(/^0+$/)) {\\n exponent = EXPONENT_MAX;\\n break;\\n }\\n invalidErr(representation, 'overflow');\\n }\\n exponent = exponent - 1;\\n }\\n while (exponent < EXPONENT_MIN || nDigitsStored < nDigits) {\\n // Shift last digit. can only do this if < significant digits than # stored.\\n if (lastDigit === 0 && significantDigits < nDigitsStored) {\\n exponent = EXPONENT_MIN;\\n significantDigits = 0;\\n break;\\n }\\n if (nDigitsStored < nDigits) {\\n // adjust to match digits not stored\\n nDigits = nDigits - 1;\\n }\\n else {\\n // adjust to round\\n lastDigit = lastDigit - 1;\\n }\\n if (exponent < EXPONENT_MAX) {\\n exponent = exponent + 1;\\n }\\n else {\\n // Check if we have a zero then just hard clamp, otherwise fail\\n const digitsString = digits.join('');\\n if (digitsString.match(/^0+$/)) {\\n exponent = EXPONENT_MAX;\\n break;\\n }\\n invalidErr(representation, 'overflow');\\n }\\n }\\n // Round\\n // We've normalized the exponent, but might still need to round.\\n if (lastDigit - firstDigit + 1 < significantDigits) {\\n let endOfString = nDigitsRead;\\n // If we have seen a radix point, 'string' is 1 longer than we have\\n // documented with ndigits_read, so inc the position of the first nonzero\\n // digit and the position that digits are read to.\\n if (sawRadix) {\\n firstNonZero = firstNonZero + 1;\\n endOfString = endOfString + 1;\\n }\\n // if negative, we need to increment again to account for - sign at start.\\n if (isNegative) {\\n firstNonZero = firstNonZero + 1;\\n endOfString = endOfString + 1;\\n }\\n const roundDigit = parseInt(representation[firstNonZero + lastDigit + 1], 10);\\n let roundBit = 0;\\n if (roundDigit >= 5) {\\n roundBit = 1;\\n if (roundDigit === 5) {\\n roundBit = digits[lastDigit] % 2 === 1 ? 1 : 0;\\n for (i = firstNonZero + lastDigit + 2; i < endOfString; i++) {\\n if (parseInt(representation[i], 10)) {\\n roundBit = 1;\\n break;\\n }\\n }\\n }\\n }\\n if (roundBit) {\\n let dIdx = lastDigit;\\n for (; dIdx >= 0; dIdx--) {\\n if (++digits[dIdx] > 9) {\\n digits[dIdx] = 0;\\n // overflowed most significant digit\\n if (dIdx === 0) {\\n if (exponent < EXPONENT_MAX) {\\n exponent = exponent + 1;\\n digits[dIdx] = 1;\\n }\\n else {\\n return new Decimal128(buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.from(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER));\\n }\\n }\\n }\\n }\\n }\\n }\\n // Encode significand\\n // The high 17 digits of the significand\\n significandHigh = long_1.Long.fromNumber(0);\\n // The low 17 digits of the significand\\n significandLow = long_1.Long.fromNumber(0);\\n // read a zero\\n if (significantDigits === 0) {\\n significandHigh = long_1.Long.fromNumber(0);\\n significandLow = long_1.Long.fromNumber(0);\\n }\\n else if (lastDigit - firstDigit < 17) {\\n let dIdx = firstDigit;\\n significandLow = long_1.Long.fromNumber(digits[dIdx++]);\\n significandHigh = new long_1.Long(0, 0);\\n for (; dIdx <= lastDigit; dIdx++) {\\n significandLow = significandLow.multiply(long_1.Long.fromNumber(10));\\n significandLow = significandLow.add(long_1.Long.fromNumber(digits[dIdx]));\\n }\\n }\\n else {\\n let dIdx = firstDigit;\\n significandHigh = long_1.Long.fromNumber(digits[dIdx++]);\\n for (; dIdx <= lastDigit - 17; dIdx++) {\\n significandHigh = significandHigh.multiply(long_1.Long.fromNumber(10));\\n significandHigh = significandHigh.add(long_1.Long.fromNumber(digits[dIdx]));\\n }\\n significandLow = long_1.Long.fromNumber(digits[dIdx++]);\\n for (; dIdx <= lastDigit; dIdx++) {\\n significandLow = significandLow.multiply(long_1.Long.fromNumber(10));\\n significandLow = significandLow.add(long_1.Long.fromNumber(digits[dIdx]));\\n }\\n }\\n const significand = multiply64x2(significandHigh, long_1.Long.fromString('100000000000000000'));\\n significand.low = significand.low.add(significandLow);\\n if (lessThan(significand.low, significandLow)) {\\n significand.high = significand.high.add(long_1.Long.fromNumber(1));\\n }\\n // Biased exponent\\n biasedExponent = exponent + EXPONENT_BIAS;\\n const dec = { low: long_1.Long.fromNumber(0), high: long_1.Long.fromNumber(0) };\\n // Encode combination, exponent, and significand.\\n if (significand.high.shiftRightUnsigned(49).and(long_1.Long.fromNumber(1)).equals(long_1.Long.fromNumber(1))) {\\n // Encode '11' into bits 1 to 3\\n dec.high = dec.high.or(long_1.Long.fromNumber(0x3).shiftLeft(61));\\n dec.high = dec.high.or(long_1.Long.fromNumber(biasedExponent).and(long_1.Long.fromNumber(0x3fff).shiftLeft(47)));\\n dec.high = dec.high.or(significand.high.and(long_1.Long.fromNumber(0x7fffffffffff)));\\n }\\n else {\\n dec.high = dec.high.or(long_1.Long.fromNumber(biasedExponent & 0x3fff).shiftLeft(49));\\n dec.high = dec.high.or(significand.high.and(long_1.Long.fromNumber(0x1ffffffffffff)));\\n }\\n dec.low = significand.low;\\n // Encode sign\\n if (isNegative) {\\n dec.high = dec.high.or(long_1.Long.fromString('9223372036854775808'));\\n }\\n // Encode into a buffer\\n const buffer$1 = buffer__WEBPACK_IMPORTED_MODULE_0___default.a.Buffer.alloc(16);\\n index = 0;\\n // Encode the low 64 bits of the decimal\\n // Encode low bits\\n buffer$1[index++] = dec.low.low & 0xff;\\n buffer$1[index++] = (dec.low.low >> 8) & 0xff;\\n buffer$1[index++] = (dec.low.low >> 16) & 0xff;\\n buffer$1[index++] = (dec.low.low >> 24) & 0xff;\\n // Encode high bits\\n buffer$1[index++] = dec.low.high & 0xff;\\n buffer$1[index++] = (dec.low.high >> 8) & 0xff;\\n buffer$1[index++] = (dec.low.high >> 16) & 0xff;\\n buffer$1[index++] = (dec.low.high >> 24) & 0xff;\\n // Encode the high 64 bits of the decimal\\n // Encode low bits\\n buffer$1[index++] = dec.high.low & 0xff;\\n buffer$1[index++] = (dec.high.low >> 8) & 0xff;\\n buffer$1[index++] = (dec.high.low >> 16) & 0xff;\\n buffer$1[index++] = (dec.high.low >> 24) & 0xff;\\n // Encode high bits\\n buffer$1[index++] = dec.high.high & 0xff;\\n buffer$1[index++] = (dec.high.high >> 8) & 0xff;\\n buffer$1[index++] = (dec.high.high >> 16) & 0xff;\\n buffer$1[index++] = (dec.high.high >> 24) & 0xff;\\n // Return the new Decimal128\\n return new Decimal128(buffer$1);\\n }\",\n \"constructor(str) {\\n super(str.length * 2);\\n\\n const view = new Uint16Array(this.buffer);\\n\\n for (let i = 0; i < str.length; i++) {\\n view[i] = str.charCodeAt(i);\\n }\\n }\",\n \"function convertToInteger(str) {\\n\\n\\n return parseInt(str, 2); // radix 2 -> binary base 2\\n}\",\n \"function bnpFromString(s, b) {\\n\\t var self = this\\n\\n\\t var k\\n\\t if (b == 16) k = 4\\n\\t else if (b == 8) k = 3\\n\\t else if (b == 256) k = 8; // byte array\\n\\t else if (b == 2) k = 1\\n\\t else if (b == 32) k = 5\\n\\t else if (b == 4) k = 2\\n\\t else {\\n\\t self.fromRadix(s, b)\\n\\t return\\n\\t }\\n\\t self.t = 0\\n\\t self.s = 0\\n\\t var i = s.length,\\n\\t mi = false,\\n\\t sh = 0\\n\\t while (--i >= 0) {\\n\\t var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n\\t if (x < 0) {\\n\\t if (s.charAt(i) == \\\"-\\\") mi = true\\n\\t continue\\n\\t }\\n\\t mi = false\\n\\t if (sh == 0)\\n\\t self[self.t++] = x\\n\\t else if (sh + k > self.DB) {\\n\\t self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n\\t self[self.t++] = (x >> (self.DB - sh))\\n\\t } else\\n\\t self[self.t - 1] |= x << sh\\n\\t sh += k\\n\\t if (sh >= self.DB) sh -= self.DB\\n\\t }\\n\\t if (k == 8 && (s[0] & 0x80) != 0) {\\n\\t self.s = -1\\n\\t if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n\\t }\\n\\t self.clamp()\\n\\t if (mi) BigInteger.ZERO.subTo(self, self)\\n\\t}\",\n \"function bnpFromString(s, b) {\\n\\t var self = this\\n\\n\\t var k\\n\\t if (b == 16) k = 4\\n\\t else if (b == 8) k = 3\\n\\t else if (b == 256) k = 8; // byte array\\n\\t else if (b == 2) k = 1\\n\\t else if (b == 32) k = 5\\n\\t else if (b == 4) k = 2\\n\\t else {\\n\\t self.fromRadix(s, b)\\n\\t return\\n\\t }\\n\\t self.t = 0\\n\\t self.s = 0\\n\\t var i = s.length,\\n\\t mi = false,\\n\\t sh = 0\\n\\t while (--i >= 0) {\\n\\t var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n\\t if (x < 0) {\\n\\t if (s.charAt(i) == \\\"-\\\") mi = true\\n\\t continue\\n\\t }\\n\\t mi = false\\n\\t if (sh == 0)\\n\\t self[self.t++] = x\\n\\t else if (sh + k > self.DB) {\\n\\t self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n\\t self[self.t++] = (x >> (self.DB - sh))\\n\\t } else\\n\\t self[self.t - 1] |= x << sh\\n\\t sh += k\\n\\t if (sh >= self.DB) sh -= self.DB\\n\\t }\\n\\t if (k == 8 && (s[0] & 0x80) != 0) {\\n\\t self.s = -1\\n\\t if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n\\t }\\n\\t self.clamp()\\n\\t if (mi) BigInteger.ZERO.subTo(self, self)\\n\\t}\",\n \"function bnpFromString(s, b) {\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else {\\n this.fromRadix(s, b);\\n return;\\n }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0)\\n this[this.t++] = x;\\n else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n this[this.t++] = (x >> (this.DB - sh));\\n } else\\n this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n }\",\n \"function bnpFromString(s, b) {\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else {\\n this.fromRadix(s, b);\\n return;\\n }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0)\\n this[this.t++] = x;\\n else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n this[this.t++] = (x >> (this.DB - sh));\\n } else\\n this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n }\",\n \"function Integer(v, radix, alphabet, caseSensitive) {\\r\\n if (typeof v === \\\"undefined\\\") return Integer[0];\\r\\n if (typeof radix !== \\\"undefined\\\") return +radix === 10 && !alphabet ? parseValue(v) : parseBase(v, radix, alphabet, caseSensitive);\\r\\n return parseValue(v);\\r\\n }\",\n \"set normalized(value) {}\",\n \"function bnpFromString(s, b) {\\n var self = this\\n\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else {\\n self.fromRadix(s, b)\\n return\\n }\\n self.t = 0\\n self.s = 0\\n var i = s.length,\\n mi = false,\\n sh = 0\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true\\n continue\\n }\\n mi = false\\n if (sh == 0)\\n self[self.t++] = x\\n else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n self[self.t++] = (x >> (self.DB - sh))\\n } else\\n self[self.t - 1] |= x << sh\\n sh += k\\n if (sh >= self.DB) sh -= self.DB\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1\\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n }\\n self.clamp()\\n if (mi) BigInteger.ZERO.subTo(self, self)\\n}\",\n \"function bnpFromString(s, b) {\\n var self = this\\n\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else {\\n self.fromRadix(s, b)\\n return\\n }\\n self.t = 0\\n self.s = 0\\n var i = s.length,\\n mi = false,\\n sh = 0\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true\\n continue\\n }\\n mi = false\\n if (sh == 0)\\n self[self.t++] = x\\n else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n self[self.t++] = (x >> (self.DB - sh))\\n } else\\n self[self.t - 1] |= x << sh\\n sh += k\\n if (sh >= self.DB) sh -= self.DB\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1\\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n }\\n self.clamp()\\n if (mi) BigInteger.ZERO.subTo(self, self)\\n}\",\n \"function bnpFromString(s, b) {\\n var self = this\\n\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else {\\n self.fromRadix(s, b)\\n return\\n }\\n self.t = 0\\n self.s = 0\\n var i = s.length,\\n mi = false,\\n sh = 0\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true\\n continue\\n }\\n mi = false\\n if (sh == 0)\\n self[self.t++] = x\\n else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n self[self.t++] = (x >> (self.DB - sh))\\n } else\\n self[self.t - 1] |= x << sh\\n sh += k\\n if (sh >= self.DB) sh -= self.DB\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1\\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n }\\n self.clamp()\\n if (mi) BigInteger.ZERO.subTo(self, self)\\n}\",\n \"function bnpFromString(s, b) {\\n var self = this\\n\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else {\\n self.fromRadix(s, b)\\n return\\n }\\n self.t = 0\\n self.s = 0\\n var i = s.length,\\n mi = false,\\n sh = 0\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true\\n continue\\n }\\n mi = false\\n if (sh == 0)\\n self[self.t++] = x\\n else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n self[self.t++] = (x >> (self.DB - sh))\\n } else\\n self[self.t - 1] |= x << sh\\n sh += k\\n if (sh >= self.DB) sh -= self.DB\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1\\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n }\\n self.clamp()\\n if (mi) BigInteger.ZERO.subTo(self, self)\\n}\",\n \"function bnpFromString(s, b) {\\n var self = this\\n\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else {\\n self.fromRadix(s, b)\\n return\\n }\\n self.t = 0\\n self.s = 0\\n var i = s.length,\\n mi = false,\\n sh = 0\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true\\n continue\\n }\\n mi = false\\n if (sh == 0)\\n self[self.t++] = x\\n else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n self[self.t++] = (x >> (self.DB - sh))\\n } else\\n self[self.t - 1] |= x << sh\\n sh += k\\n if (sh >= self.DB) sh -= self.DB\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1\\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n }\\n self.clamp()\\n if (mi) BigInteger.ZERO.subTo(self, self)\\n}\",\n \"function bnpFromString(s, b) {\\n var self = this\\n\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else {\\n self.fromRadix(s, b)\\n return\\n }\\n self.t = 0\\n self.s = 0\\n var i = s.length,\\n mi = false,\\n sh = 0\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true\\n continue\\n }\\n mi = false\\n if (sh == 0)\\n self[self.t++] = x\\n else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n self[self.t++] = (x >> (self.DB - sh))\\n } else\\n self[self.t - 1] |= x << sh\\n sh += k\\n if (sh >= self.DB) sh -= self.DB\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1\\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n }\\n self.clamp()\\n if (mi) BigInteger.ZERO.subTo(self, self)\\n}\",\n \"function bnpFromString(s, b) {\\n var self = this\\n\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else {\\n self.fromRadix(s, b)\\n return\\n }\\n self.t = 0\\n self.s = 0\\n var i = s.length,\\n mi = false,\\n sh = 0\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i)\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true\\n continue\\n }\\n mi = false\\n if (sh == 0)\\n self[self.t++] = x\\n else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh\\n self[self.t++] = (x >> (self.DB - sh))\\n } else\\n self[self.t - 1] |= x << sh\\n sh += k\\n if (sh >= self.DB) sh -= self.DB\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1\\n if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh\\n }\\n self.clamp()\\n if (mi) BigInteger.ZERO.subTo(self, self)\\n}\",\n \"function bnpFromString(s, b) {\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else {\\n this.fromRadix(s, b);\\n return;\\n }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0)\\n this[this.t++] = x;\\n else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n this[this.t++] = (x >> (this.DB - sh));\\n } else\\n this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n }\",\n \"readInt(radix: number, len?: number): number | null {\\n const start = this.state.pos;\\n const forbiddenSiblings =\\n radix === 16\\n ? forbiddenNumericSeparatorSiblings.hex\\n : forbiddenNumericSeparatorSiblings.decBinOct;\\n const allowedSiblings =\\n radix === 16\\n ? allowedNumericSeparatorSiblings.hex\\n : radix === 10\\n ? allowedNumericSeparatorSiblings.dec\\n : radix === 8\\n ? allowedNumericSeparatorSiblings.oct\\n : allowedNumericSeparatorSiblings.bin;\\n\\n let total = 0;\\n\\n for (let i = 0, e = len == null ? Infinity : len; i < e; ++i) {\\n const code = this.input.charCodeAt(this.state.pos);\\n let val;\\n\\n if (this.hasPlugin(\\\"numericSeparator\\\")) {\\n const prev = this.input.charCodeAt(this.state.pos - 1);\\n const next = this.input.charCodeAt(this.state.pos + 1);\\n if (code === charCodes.underscore) {\\n if (allowedSiblings.indexOf(next) === -1) {\\n this.raise(this.state.pos, \\\"Invalid or unexpected token\\\");\\n }\\n\\n if (\\n forbiddenSiblings.indexOf(prev) > -1 ||\\n forbiddenSiblings.indexOf(next) > -1 ||\\n Number.isNaN(next)\\n ) {\\n this.raise(this.state.pos, \\\"Invalid or unexpected token\\\");\\n }\\n\\n // Ignore this _ character\\n ++this.state.pos;\\n continue;\\n }\\n }\\n\\n if (code >= charCodes.lowercaseA) {\\n val = code - charCodes.lowercaseA + charCodes.lineFeed;\\n } else if (code >= charCodes.uppercaseA) {\\n val = code - charCodes.uppercaseA + charCodes.lineFeed;\\n }\",\n \"function setLen(len) \\n{\\n\\t// Create the len array.\\n\\tif (len.length == 0 || len == null)\\n\\t\\tlen = \\\"13,14,15,16,19\\\";\\n\\tvar tmplen = len;\\n\\tn = 1;\\n\\twhile (tmplen.indexOf(\\\",\\\") != -1) \\n\\t{\\n\\t\\ttmplen = tmplen.substring(tmplen.indexOf(\\\",\\\") + 1, tmplen.length);\\n\\t\\tn++;\\n\\t}\\n\\tthis.len = new makeArray(n);\\n\\tn = 0;\\n\\twhile (len.indexOf(\\\",\\\") != -1) \\n\\t{\\n\\t\\tvar tmpstr = len.substring(0, len.indexOf(\\\",\\\"));\\n\\t\\tthis.len[n] = tmpstr;\\n\\t\\tlen = len.substring(len.indexOf(\\\",\\\") + 1, len.length);\\n\\t\\tn++;\\n\\t}\\n\\tthis.len[n] = len;\\n\\treturn this;\\n}\",\n \"function stringToNumber(str, base) {\\n var sanitized, isDecimal;\\n sanitized = str.replace(NumberNormalizeReg, function(chr) {\\n var replacement = NumberNormalizeMap[chr];\\n if(replacement === HalfWidthPeriod) {\\n isDecimal = true;\\n }\\n return replacement;\\n });\\n return isDecimal ? parseFloat(sanitized) : parseInt(sanitized, base || 10);\\n }\",\n \"set intValue(value) {}\",\n \"function readInt(radix, len) {\\n var start = tokPos, total = 0;\\n for (var i = 0, e = len == null ? Infinity : len; i < e; ++i) {\\n var code = input.charCodeAt(tokPos), val;\\n if (code >= 97) val = code - 97 + 10; // a\\n else if (code >= 65) val = code - 65 + 10; // A\\n else if (code >= 48 && code <= 57) val = code - 48; // 0-9\\n else val = Infinity;\\n if (val >= radix) break;\\n ++tokPos;\\n total = total * radix + val;\\n }\\n if (tokPos === start || len != null && tokPos - start !== len) return null;\\n\\n return total;\\n }\",\n \"function toBaseOut(str,baseIn,baseOut,alphabet){var j,arr=[0],arrL,i=0,len=str.length;for(;i<len;){for(arrL=arr.length;arrL--;arr[arrL]*=baseIn){;}arr[0]+=alphabet.indexOf(str.charAt(i++));for(j=0;j<arr.length;j++){if(arr[j]>baseOut-1){if(arr[j+1]==null)arr[j+1]=0;arr[j+1]+=arr[j]/baseOut|0;arr[j]%=baseOut}}}return arr.reverse()}// Convert a numeric string of baseIn to a numeric string of baseOut.\",\n \"function jsoo_z_of_js_string_base(base, s) {\\n if (base == 0) { // https://github.com/ocaml/Zarith/blob/b8dbaf48a7927061df699ad7ce642bb4f1fe5308/caml_z.c#L598\\n base = 10;\\n var p = 0;\\n var sign = 1;\\n if(s[p] == '-') { sign = -1; p++ }\\n else if (s[p] == '+') { p++ }\\n if (s[p] == '0') {\\n p ++;\\n if (s.length == p) {\\n return 0;\\n } else {\\n var bc = s[p];\\n if (bc == 'o' || bc == 'O') {\\n base = 8;\\n } else if (bc == 'x' || bc == 'X') {\\n base = 16;\\n } else if (bc == 'b' || bc == 'B') {\\n base = 2;\\n }\\n if(base != 10) {\\n s = s.substring(p+1);\\n if(sign == -1) s = \\\"-\\\" + s;\\n }\\n }\\n }\\n }\\n //remove leading '+'\\n if (s[0] == '+') s = s.substring(1);\\n //remove leading '0's\\n s = s.replace(/^0+/, '');\\n //normalize \\\"empty\\\" numbers\\n if(s == '-' || s == '') s = '0';\\n\\n function digit(code){\\n if(code >= 48 && code <= 57) return code - 48;\\n if(code >= 97 && code <= 102) return code - 97 + 10;\\n if(code >= 65 && code <= 70) return code - 65 + 10;\\n }\\n var i = 0;\\n if(s[i] == '-') i++;\\n for( ; i < s.length ; i++){\\n var c = digit(s.charCodeAt(i));\\n if(c == undefined || c >= base)\\n caml_invalid_argument(\\\"Z.of_substring_base: invalid digit\\\");\\n }\\n return ml_z_normalize(bigInt(s, base));\\n \\n}\",\n \"function bnpFromString(s, b) {\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\\n this.fromRadix(s, b);return;\\n }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0) this[this.t++] = x;else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;\\n this[this.t++] = x >> this.DB - sh;\\n } else this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n }\",\n \"function bnpFromString(s, b) {\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\\n this.fromRadix(s, b);return;\\n }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0) this[this.t++] = x;else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;\\n this[this.t++] = x >> this.DB - sh;\\n } else this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n }\",\n \"function bnpFromString(s, b) {\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\\n this.fromRadix(s, b);return;\\n }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0) this[this.t++] = x;else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh;\\n this[this.t++] = x >> this.DB - sh;\\n } else this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= (1 << this.DB - sh) - 1 << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n }\",\n \"function get_int(str, index) {\\n var orig = index;\\n while (str[index] >= '0' && str[index] <= '9') {\\n index++;\\n }\\n return { value: parseInt(str.slice(orig)), len: index - orig };\\n}\",\n \"function bnpFromString(s, b) {\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else { this.fromRadix(s, b); return; }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0)\\n this[this.t++] = x;\\n else if (sh + k > this.DB) {\\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n this[this.t++] = (x >> (this.DB - sh));\\n } else\\n this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n }\",\n \"function convertOctal(string) {\\n let num = parseInt(string,10);\\n return num;\\n}\",\n \"function RangeFromStr(str) {\\n\\tvals = str.split('-');\\n\\t\\n\\tthis.low = vals[0];\\n\\tthis.high = vals[1];\\n}\",\n \"toBase10(value, b = 62) {\\n const limit = value.length;\\n let result = base.indexOf(value[0]);\\n for (let i = 1; i < limit; i++) {\\n result = b * result + base.indexOf(value[i]);\\n }\\n return result;\\n }\",\n \"function caml_parse_sign_and_base (s) {\\n var i = 0, base = 10, sign = s.get(0) == 45?(i++,-1):1;\\n if (s.get(i) == 48)\\n switch (s.get(i + 1)) {\\n case 120: case 88: base = 16; i += 2; break;\\n case 111: case 79: base = 8; i += 2; break;\\n case 98: case 66: base = 2; i += 2; break;\\n }\\n return [i, sign, base];\\n}\",\n \"function bnpFromString(s,b,unsigned) {\\n\\t var k;\\n\\t if(b == 16) k = 4;\\n\\t else if(b == 8) k = 3;\\n\\t else if(b == 256) k = 8; // byte array\\n\\t else if(b == 2) k = 1;\\n\\t else if(b == 32) k = 5;\\n\\t else if(b == 4) k = 2;\\n\\t else { this.fromRadix(s,b); return this; }\\n\\t this.t = 0;\\n\\t this.s = 0;\\n\\t var i = s.length, mi = false, sh = 0;\\n\\t while(--i >= 0) {\\n\\t var x = (k==8)?s[i]&0xff:intAt(s,i);\\n\\t if(x < 0) {\\n\\t if(s.charAt(i) == \\\"-\\\") mi = true;\\n\\t continue;\\n\\t }\\n\\t mi = false;\\n\\t if(sh == 0)\\n\\t this[this.t++] = x;\\n\\t else if(sh+k > this.DB) {\\n\\t this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\\n\\t this[this.t++] = (x>>(this.DB-sh));\\n\\t }\\n\\t else\\n\\t this[this.t-1] |= x<<sh;\\n\\t sh += k;\\n\\t if(sh >= this.DB) sh -= this.DB;\\n\\t }\\n\\t if(!unsigned && k == 8 && (s[0]&0x80) != 0) {\\n\\t this.s = -1;\\n\\t if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\\n\\t }\\n\\t this.clamp();\\n\\t if(mi) BigInteger.ZERO.subTo(this,this);\\n\\t return this;\\n\\t }\",\n \"function caml_string_unsafe_set (s, i, c) {\\n // The OCaml compiler uses Char.unsafe_chr on integers larger than 255!\\n c &= 0xff;\\n if (s.t != 4 /* ARRAY */) {\\n if (i == s.c.length) {\\n s.c += String.fromCharCode (c);\\n if (i + 1 == s.l) s.t = 0; /*BYTES | UNKOWN*/\\n return 0;\\n }\\n caml_convert_string_to_array (s);\\n }\\n s.c[i] = c;\\n return 0;\\n}\",\n \"function bnpFromString(s, b) {\\n var self = this;\\n\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else {\\n self.fromRadix(s, b);\\n return;\\n }\\n self.t = 0;\\n self.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0) {\\n var x = k == 8 ? s[i] & 0xff : intAt(s, i);\\n if (x < 0) {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0) self[self.t++] = x;else if (sh + k > self.DB) {\\n self[self.t - 1] |= (x & (1 << self.DB - sh) - 1) << sh;\\n self[self.t++] = x >> self.DB - sh;\\n } else self[self.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= self.DB) sh -= self.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0) {\\n self.s = -1;\\n if (sh > 0) self[self.t - 1] |= (1 << self.DB - sh) - 1 << sh;\\n }\\n self.clamp();\\n if (mi) BigInteger.ZERO.subTo(self, self);\\n}\",\n \"function bnpFromString(s,b) {\\n\\tvar k;\\n\\tif(b == 16) k = 4;\\n\\telse if(b == 8) k = 3;\\n\\telse if(b == 256) k = 8; // byte array\\n\\telse if(b == 2) k = 1;\\n\\telse if(b == 32) k = 5;\\n\\telse if(b == 4) k = 2;\\n\\telse { this.fromRadix(s,b); return; }\\n\\tthis.t = 0;\\n\\tthis.s = 0;\\n\\tvar i = s.length, mi = false, sh = 0;\\n\\twhile(--i >= 0) {\\n\\t var x = (k==8)?s[i]&0xff:intAt(s,i);\\n\\t if(x < 0) {\\n\\t\\tif(s.charAt(i) == \\\"-\\\") mi = true;\\n\\t\\tcontinue;\\n\\t }\\n\\t mi = false;\\n\\t if(sh == 0)\\n\\t\\tthis[this.t++] = x;\\n\\t else if(sh+k > this.DB) {\\n\\t\\tthis[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\\n\\t\\tthis[this.t++] = (x>>(this.DB-sh));\\n\\t }\\n\\t else\\n\\t\\tthis[this.t-1] |= x<<sh;\\n\\t sh += k;\\n\\t if(sh >= this.DB) sh -= this.DB;\\n\\t}\\n\\tif(k == 8 && (s[0]&0x80) != 0) {\\n\\t this.s = -1;\\n\\t if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\\n\\t}\\n\\tthis.clamp();\\n\\tif(mi) BigInteger.ZERO.subTo(this,this);\\n }\",\n \"function bnpFromString(s,b) {\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 256) k = 8; // byte array\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else { this.fromRadix(s,b); return; }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length, mi = false, sh = 0;\\n while(--i >= 0) {\\n var x = (k==8)?s.charCodeAt(i)&0xff:intAt(s,i); /** MODIFIED **/\\n if(x < 0) {\\n if(s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if(sh == 0)\\n this[this.t++] = x;\\n else if(sh+k > this.DB) {\\n this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\\n this[this.t++] = (x>>(this.DB-sh));\\n }\\n else\\n this[this.t-1] |= x<<sh;\\n sh += k;\\n if(sh >= this.DB) sh -= this.DB;\\n }\\n if(k == 8 && (s[0]&0x80) != 0) {\\n this.s = -1;\\n if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\\n }\\n this.clamp();\\n if(mi) BigInteger.ZERO.subTo(this,this);\\n}\",\n \"function digitize(val) {\\n return Array.from('' + val, Number);\\n}\",\n \"function stringToNumber(str, base) {\\n var sanitized, isDecimal;\\n sanitized = str.replace(fullWidthNumberReg, function(chr) {\\n var replacement = getOwn(fullWidthNumberMap, chr);\\n if (replacement === HALF_WIDTH_PERIOD) {\\n isDecimal = true;\\n }\\n return replacement;\\n });\\n return isDecimal ? parseFloat(sanitized) : parseInt(sanitized, base || 10);\\n }\",\n \"set Alpha9(value) {}\",\n \"function bnpFromString(s, b)\\n{\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 256) k = 8; // byte array\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else\\n {\\n this.fromRadix(s, b);\\n return;\\n }\\n this.t = 0;\\n this.s = 0;\\n var i = s.length,\\n mi = false,\\n sh = 0;\\n while (--i >= 0)\\n {\\n var x = (k == 8) ? s[i] & 0xff : intAt(s, i);\\n if (x < 0)\\n {\\n if (s.charAt(i) == \\\"-\\\") mi = true;\\n continue;\\n }\\n mi = false;\\n if (sh == 0)\\n this[this.t++] = x;\\n else if (sh + k > this.DB)\\n {\\n this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;\\n this[this.t++] = (x >> (this.DB - sh));\\n }\\n else\\n this[this.t - 1] |= x << sh;\\n sh += k;\\n if (sh >= this.DB) sh -= this.DB;\\n }\\n if (k == 8 && (s[0] & 0x80) != 0)\\n {\\n this.s = -1;\\n if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;\\n }\\n this.clamp();\\n if (mi) BigInteger.ZERO.subTo(this, this);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.59506947","0.5796183","0.5756244","0.571688","0.5703274","0.56444424","0.56098574","0.54871666","0.5446435","0.54307956","0.54285616","0.5418904","0.54126376","0.536724","0.53525347","0.53468573","0.5345744","0.53238094","0.53238094","0.53238094","0.53088397","0.5282324","0.52666676","0.52117795","0.5201448","0.51965094","0.5159465","0.51175696","0.5097301","0.50766504","0.50766504","0.50766504","0.50766504","0.50766504","0.50766504","0.50766504","0.50766504","0.50766504","0.50766504","0.50766504","0.5069099","0.50622267","0.50477886","0.50327945","0.5002631","0.4993228","0.4993228","0.49560422","0.49551806","0.49473175","0.494611","0.491833","0.49123245","0.49084008","0.48966268","0.48758718","0.48758525","0.48601606","0.4852135","0.4846979","0.484621","0.48361936","0.48327276","0.48327276","0.48312256","0.48312256","0.48216364","0.4821459","0.48203668","0.48203668","0.48203668","0.48203668","0.48203668","0.48203668","0.48203668","0.48185635","0.48104876","0.48093522","0.48077366","0.48062932","0.480429","0.4777981","0.4770371","0.4766932","0.4766932","0.4766932","0.47648513","0.47627774","0.4761021","0.4747122","0.47416058","0.47303355","0.47270754","0.47265428","0.47263297","0.4725859","0.47230956","0.4720493","0.4719421","0.47006944","0.47001147"],"string":"[\n \"0.59506947\",\n \"0.5796183\",\n \"0.5756244\",\n \"0.571688\",\n \"0.5703274\",\n \"0.56444424\",\n \"0.56098574\",\n \"0.54871666\",\n \"0.5446435\",\n \"0.54307956\",\n \"0.54285616\",\n \"0.5418904\",\n \"0.54126376\",\n \"0.536724\",\n \"0.53525347\",\n \"0.53468573\",\n \"0.5345744\",\n \"0.53238094\",\n \"0.53238094\",\n \"0.53238094\",\n \"0.53088397\",\n \"0.5282324\",\n \"0.52666676\",\n \"0.52117795\",\n \"0.5201448\",\n \"0.51965094\",\n \"0.5159465\",\n \"0.51175696\",\n \"0.5097301\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.50766504\",\n \"0.5069099\",\n \"0.50622267\",\n \"0.50477886\",\n \"0.50327945\",\n \"0.5002631\",\n \"0.4993228\",\n \"0.4993228\",\n \"0.49560422\",\n \"0.49551806\",\n \"0.49473175\",\n \"0.494611\",\n \"0.491833\",\n \"0.49123245\",\n \"0.49084008\",\n \"0.48966268\",\n \"0.48758718\",\n \"0.48758525\",\n \"0.48601606\",\n \"0.4852135\",\n \"0.4846979\",\n \"0.484621\",\n \"0.48361936\",\n \"0.48327276\",\n \"0.48327276\",\n \"0.48312256\",\n \"0.48312256\",\n \"0.48216364\",\n \"0.4821459\",\n \"0.48203668\",\n \"0.48203668\",\n \"0.48203668\",\n \"0.48203668\",\n \"0.48203668\",\n \"0.48203668\",\n \"0.48203668\",\n \"0.48185635\",\n \"0.48104876\",\n \"0.48093522\",\n \"0.48077366\",\n \"0.48062932\",\n \"0.480429\",\n \"0.4777981\",\n \"0.4770371\",\n \"0.4766932\",\n \"0.4766932\",\n \"0.4766932\",\n \"0.47648513\",\n \"0.47627774\",\n \"0.4761021\",\n \"0.4747122\",\n \"0.47416058\",\n \"0.47303355\",\n \"0.47270754\",\n \"0.47265428\",\n \"0.47263297\",\n \"0.4725859\",\n \"0.47230956\",\n \"0.4720493\",\n \"0.4719421\",\n \"0.47006944\",\n \"0.47001147\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4694,"cells":{"query":{"kind":"string","value":"(protected) clamp off excess high words"},"document":{"kind":"string","value":"function bnpClamp() {\n var c = this.s&this.DM;\n while(this.t > 0 && this[this.t-1] == c) --this.t;\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 truncateWords(longText, wordLimit) {\n // longText (a String with several words in it)\n // wordLimit (an Integer that sets the number of words you want in the returned text)\n\n // declaration, assignments\n var splitWords = [];\n var numWords = 0;\n var numWords_Short = 0;\n // var numWords2Remove = 0; not used\n var arrTruncWords = [];\n var strEllipses = \"...\";\n var shortText_local = \"\";\n var wordLimitIn = wordLimit;\n\n\n\n\n\n // ** split longText into an Array\n longText = longText.replace(/\\s\\s+/g, ' '); /* rm spc tab nl */\n splitWords = longText.split(' ');\n numWords = splitWords.length; // ** length = number of words Array\n\n\n // ** case when no numWords function argument, or if it is\n if (wordLimit === undefined) { // if not entered as argument\n wordLimit = 6;\n } else if (wordLimit < 1) { // if less than 1 (0 or negative)\n wordLimit = 7;\n }\n\n if (wordLimit > numWords) { // if > words in string\n wordLimit = numWords;\n }\n\n // NOTE: this is not used (not necessary for current requirements)\n //numWords2Remove = numWords - wordLimit; // ** # of words 2be removed\n\n\n arrTruncWords = splitWords.splice(0, wordLimit); // remove extra words\n numWords_Short = arrTruncWords.length;\n if (numWords_Short !== numWords) {\n arrTruncWords.push(strEllipses); // add ellipses \"...\"\n }\n shortText_local = arrTruncWords.join(' '); // recreate string wo extra words\n\n\n var ellipseText_local = { // create object\n textIn: longText,\n textOut: shortText_local,\n wordCountIn: numWords,\n wordCountOut: numWords_Short,\n wordLimitIn: wordLimitIn,\n wordLimitOut: wordLimit\n };\n\n return ellipseText_local; // rtn string\n}","function filterLongWords (array,num){\n newWord = [];\n for (var i = 0; i < array.length; i++){\n if(array[i].length > num){\n newWord.push(array[i]);\n }\n }\n return newWord;\n}","function filterLongWords(words, i) {\n\n}","function trimByWord(sentence) {\r\n\tvar numberOfWords = 100;\r\n var result = sentence;\r\n var resultArray = result.split(\" \");\r\n if(resultArray.length > numberOfWords){\r\n\t\tresultArray = resultArray.slice(0, numberOfWords);\r\n\t\tresult = resultArray.join(\" \");\r\n\t\tvar n = result.lastIndexOf(\".\")\r\n\t\tresult = \"truncated for brevity. \" + result.substring(0, n)+ \".\";\r\n }\r\n return result;\r\n}","function filterLongWords(words, i){\n //...\n}","function filterLongWords(words, i){\n \"use strict\";\n\n}","function beyond(s) {\n if (s.length === 0) {\n return exports.MAX_WORD;\n }\n var code = s.charCodeAt(s.length - 1);\n return s.slice(0, -1) + String.fromCharCode(code + 1);\n}","function filterLongWord (array, int) {\n var longWord = []\n for (var i = 0; i < array.length; i++) {\n if (array[i].length > int) {\n longWord.push(array[i])\n }\n }\n return longWord\n}","shortenText(text){\n return text.substr(0, 270) + \"...\";\n }","function reduceTextContent(text,limit){\n\tlet index = text.indexOf(' ',limit);\n\treturn (index != -1)?text.substring(0,index):\n\t\t\t\t\t\t\t\t\t\t\ttext;\n}","function filterLongWords(words, a) {\n return words.filter(word => word.length >= a);\n}","function filterLongWords(wordArray, i) {\r\n return wordArray.filter(word => word.length > i);\r\n}","function truncateWords(longText, numWords) {\n var truncatedText = longText\n // Split string by space to get array of words.\n var words = longText.split(\" \");\n // Calculate how many words need to be removed.\n var countWordsInText = words.length;\n var countWordsToRemove = countWordsInText - numWords;\n // Truncate text only if it needs to.\n if(countWordsToRemove > 0) {\n var removeStartIndex = (countWordsInText - countWordsToRemove);\n words.splice (removeStartIndex, countWordsToRemove);\n words.push (\"...\")\n \n truncatedText = words.join(\" \")\n }\n\n return truncatedText;\n}","getClippedText() {\n if (this.text.length >= 500) {\n return clip(this.text, 300, { html: true, indicator: \"\", maxLines: 5 });\n }\n\n return null;\n }","function filterLongWords(array, i ) {\n var newArray = [];\n array.forEach(function (word) {\n if( word.length > i ) { newArray.push(word)};\n });\n return newArray;\n}","function BOT_englishWordCutPlural(word) {\r\n\tif( BOT_member(BOT_pluralExceptionList, word) || word.length <= 3 ) return word;\r\n\telse return(word.replace(/(\\w+)s$/, \"$1\"));\r\n}","function filterLongWords(arr,i) {\n let word = \"\";\n for (let i = 0; i < arr.length; i++) {\n if (word.length < arr[i].length) {\n word = arr[i];}\n }\n return word;\n // finds the length of the longest word \n }","function filterLongWords(words, size){\n \"use strict\";\n var newWordList = [];\n\n for(var i=0; i<words.length; i++){\n var word = words[i];\n if(word.length < size){\n newWordList.push(word);\n }\n }\n\n return newWordList;\n}","function filterWords(word){\n return word.length > 5; \n}","function longTextFilter() {\n var postfix = \"...\";\n return function (input, maxLength) {\n var ret;\n if (input.length > (maxLength + postfix.length)) {\n ret = input.substr(0, maxLength) + postfix;\n }\n else {\n ret = input;\n }\n return ret;\n };\n }","function filterLongWords (words, i) {\n var newArray = [];\n\tfor (var x = 0; x < words.length; x++){\n\t\tif(words[x].length >= i){\n newArray.push(words[x]);\n\t\t}\n\t}\n return newArray;\n}","function filterLongWords(words, i){\n var longWords = words.filter(function(word){\n if (word.length > i) {\n return word};\n });\n return longWords\n }","function filterLongWords(words, i) {\n \"use strict\";\n //...\n}","truncDesc() {\n let description = this.props.data.description;\n if (description == null) {\n return \"\";\n }\n else if (description.length <= 105) {\n return description;\n }\n else if (description.split(\" \").length === 1) {\n return description.slice(0, 105) + \"...\";\n }\n let words = description.split(\" \");\n let letters = 0;\n let index = 0;\n while (letters <= 105 && index < words.length) {\n letters += words[index].length;\n index++;\n }\n return words.slice(0, index).join(\" \") + \"...\";\n }","function longestWord(sen) {}","function high(s){\n let as = s.split(' ').map(s=>[...s].reduce((a,b)=>a+b.charCodeAt(0)-96,0));\n return s.split(' ')[as.indexOf(Math.max(...as))];\n }","_adjustLengthText(stText, limit) {\n if (stText.length > limit)\n return stText.slice(0, limit) + \"...\";\n else\n return stText;\n }","_adjustLengthText(stText, limit) {\n if (stText.length > limit)\n return stText.slice(0, limit) + \"...\";\n else\n return stText;\n }","function high(x){\nlet result = '';\nlet bestScore = 0;\nlet arrayWord = x.split(' ');\n for (let p = 0 ; p < arrayWord.length ; p++ ){\n let wordScore = 0;\n for (let k = 0; k < arrayWord[p].length; k++){\n let code = arrayWord[p].toUpperCase().charCodeAt(k)\n if (code > 64 && code < 91 ) wordScore += (code - 64);\n }\n bestScore < wordScore ? ( bestScore = wordScore, result = arrayWord[p]) : null;\n }\n return result;\n}","function megaFriend(bigword) {\n var word = \"\";\n for (var i = 0; i < bigword.length; i++) {\n if (word.length < bigword[i].length) {\n word = bigword[i];\n }\n }\n return word;\n}","function filterLongWords(words, i)\n{\n\n\n\n\nvar x = words.filter(function(word){\n\n\treturn word.length > i;\n}); \nreturn x;\n}","function filterLongWords(strings, i){\n return strings.filter(strings=>strings.length>=i);\n}","function cut(texto) {\n if (texto.length >= 50) {\n var newText = texto.slice(0,50) + \"...\";\n return newText;\n }else {\n return texto;\n }\n \n}","function truncate( n, useWordBoundary ){\n var isTooLong = this.length > n,\n s_ = isTooLong ? this.substr(0,n-1) : this;\n s_ = (useWordBoundary && isTooLong) ? s_.substr(0,s_.lastIndexOf(' ')) : s_;\n return isTooLong ? s_ + '...' : s_;\n}","function filterLongWords(words, i){\n \"use strict\";\n\n var strings = words;\n var number = i;\n var longWords = [];\n\n for(var i = 0; i < strings.length; i++){\n if (strings[i].length > number){\n longWords.push(strings[i])\n }\n }\n return longWords;\n }","function filterLongWords(arr, i) {\n let longWordArray = [];\n for (let test = 0; test < arr.length; test++) {\n if (arr[test].length > i) {\n longWordArray += arr[test];\n }\n }\n return longWordArray;\n}","function cliping() {\n\t\t\t\t// calculate length of word;\n\t\t\t\tvar width = $next.getBoundingClientRect().width;\n\t\t\t\telm[0].style.width = '0px';\n\t\t\t\tsetTimeout(function () {\n\t\t\t\t\telm[0].style.width = width + 15 + 'px';\n\t\t\t\t}, 1000);\n\t\t\t}","maxAdjacentWordsToUse() {\n const selectedWordCount = this.selectedWordCount()\n if (selectedWordCount < 4) {\n return 4\n }\n if (selectedWordCount < 6) {\n return 2\n }\n return 1\n }","function filterLongWord(arr, n){\n let arr1=[];\n for(i=0; i<arr.length; i++){\n if(arr[i].length>n)\n arr1.push(arr[i]);\n }\n return arr1;\n }","function spinWords(w){\n let wordArray = w.split(' ')\n let spunWord = []\n wordArray.map((word) => { \n word.length < 5 ? spunWord.push(word) : spunWord.push(word.split('').reverse().join(''))\n })\n return spunWord.join(' ')\n }","function filterLongWords(array,i) {\n array.filter(function(words,i){\n return words.length > i\n}); \n}","function truncate(str, maxChars, append, onlyFullWords){\n\t str = toString(str);\n\t append = append || '...';\n\t maxChars = onlyFullWords? maxChars + 1 : maxChars;\n\n\t str = trim(str);\n\t if(str.length <= maxChars){\n\t return str;\n\t }\n\t str = str.substr(0, maxChars - append.length);\n\t //crop at last space or remove trailing whitespace\n\t str = onlyFullWords? str.substr(0, str.lastIndexOf(' ')) : trim(str);\n\t return str + append;\n\t }","function trimSentence(text, maxLength) {\nreturn text.slice(0, maxLength) + \"...\";\n }","function offbeatLimit(w) {\n return stdLimit(w > 1 ? (1 - 2 * (w - 1)) : w);\n }","remainingWords() {\n return this._wordList.length - this._usedWords.length\n }","function hitungHuruf(kata) {\n\tvar max_word = [\"\",0];\n\tvar theWordOccurence = 0;;\n\tkata = kata.match(/[^\\s]+[a-zA-z]/gm);\n\tfor (var word of kata){\n\t\tif(word.split(\"\").sort().join(\"\").match(/(.)\\1+/g)){\n\t\t\ttheWordOccurence = word.split(\"\").sort().join(\"\").match(/(.)\\1+/g).length;\n\t\t\tif(theWordOccurence>max_word[1]){\n\t\t\t\tmax_word = [word, theWordOccurence];\n\t\t\t}\n\t\t}\n\t}\n\treturn max_word[0];\n}","function filterLongWords(words, i){\n \"use strict\";\n var longWords = []\n words.map(function(word){\n if (word.length > i) {\n longWords.push(word)\n }\n })\n return longWords;\n\n // for (var x=0; x<words.length; x++){\n \n // }\n}","function shortenText (longText, maxCharLength) {\n const charLength = longText.length\n\n if (charLength > maxCharLength) {\n // If text is too long, then return the amount\n const splitArray = longText.split(' ')\n let charCounter = 0\n let i = 0\n for (i = 0; i < splitArray.length; i++) {\n if (charCounter + splitArray[i].length + 1 > maxCharLength) {\n break\n }\n charCounter += splitArray[i].length + 1\n }\n const shortenedText = splitArray.slice(0, i).join(' ') + ' ...'\n return shortenedText\n }\n // If text is right\n return longText\n}","function filterLongWords(array,iVal){\n\n return array.filter(arr=>arr.length > iVal).join(',');\n\n}","function filterLongWords(arr, len){\n\treturn arr.filter((word) => word.length > len);\n}","function filterLongWords(words, n){\n var array = words.split(',')\n\n var finalArray = []\n for (var i = 0; i < array.length; i++) {\n if (array[i].length > n) {\n finalArray.push(array[i])\n }\n }\n return finalArray\n}","function findLongestWordNonReduceVersion(words) {\n \"use strict\";\n var longestWord = \"\";\n words.forEach(function(w) {\n if (longestWord.length > w.length) longestWord = w;\n });\n return longestWord;\n }","function high(x) {\n let arrOfSum = [];\n let arrOfWords = x.split(' ');\n for (let i = 0; i < arrOfWords.length; i++) {\n arrOfSum.push(arrOfWords[i].split('')\n .map(item => item.charCodeAt() - 96)\n .reduce((current, sum) => sum + current, 0));\n }\n let position = arrOfSum.indexOf(Math.max(...arrOfSum));\n return arrOfWords[position];\n}","function truncateWithEllipsis(text, maxChars, ellipsis, fullWords, rtl) {\n if (text.length <= maxChars) {\n return text;\n }\n // Calc max chars\n maxChars -= ellipsis.length;\n if (maxChars < 1) {\n maxChars = 1;\n //ellipsis = \"\";\n }\n // Get lines\n var lines = splitTextByCharCount(text, maxChars, fullWords, rtl);\n // Use first line\n return (lines[0] || \"\") + ellipsis;\n}","function shortenTitle(text) {\n\tif (text.length > 40)\n\t\treturn text.substring(0, 40) + \"... [+\" + (text.length - 40) + \"chars]\";\n\telse\n\t\treturn text;\n}","function findShort(s){\nvar split = s.split(' ')\ncounter = 100\n\nfor (var i=0; i<split.length; i++){\n if (split[i].length < counter){\n \tcounter = split[i].length\n word = split[i]\n \t}\n }\n return counter;\n}","function trimSentence(text, maxLength) {\n // Add your code here.\n return text;\n}","function truncate(target, maxHeight) {\n if (!target || !maxHeight) {return;}\n\n var original = target.nodeValue.replace(opt.truncationChar, '');\n\n var words = original.split(' ');\n\n var start=0, end = words.length-1, mid=-1, m;\n\n while (start <= end && end > 0) {\n m = Math.floor((start+end)/2);\n if (m == mid) {\n break;\n }\n mid= m;\n\n applyEllipsis(target, words.slice(0, mid+1).join(' '));\n\n height = getElemHeight(element);\n\n\n if (height <= maxHeight) {\n start = mid;\n } else {\n end = mid;\n }\n }\n\n if (height > maxHeight) {\n target.parentNode.removeChild(target);\n truncate(getLastTextNode(element), maxHeight);\n }\n }","function filterLongWords (arr, i) {\n var ret = [];\n arr.forEach(function(s){\n if (s.length > i) {\n ret += [s];\n }\n });\n debugger;\n return ret;\n}","function filterLongWords (words, i) {\r\n let arr = words.filter(elem=>elem.length>i);\r\n return arr;\r\n}","function _usfTruncateWords (str, size = 10, description_words = '...') {\r\n if (!str)\r\n return \"\";\r\n if (str.split(' ').length && str.split(' ').length <= size)\r\n return str;\r\n return str.split(' ').slice(0, size - 1).join(' ') + description_words\r\n}","function restrictRange(transdelta){\n var mCtx = metricsContext,\n mtextW = mCtx.curr_mtext_width,\n width = mCtx.canvasT.width;\n // console.log('Scrolling lastX: %s; delta: %s; translated: %s; width: %s', \n // mCtx.lastX, transdelta-mCtx.translated, mCtx.translated, mtextW);\n \n var pm = 0; // 0.15; // panning margin factor, normalized\n // if text fits within canvas width completely\n if (mtextW < width)\n return transdelta > width-mtextW*(1-pm) ? width-mtextW*(1-pm) :\n transdelta < -mtextW*pm ? -mtextW*pm : transdelta;\n // if text is wider then the canvas width\n else {\n return transdelta > width*(pm) ? width*(pm) :\n transdelta < -mtextW+width*(1-pm) ? -mtextW+width*(1-pm) : \n transdelta;\n }\n}","function truncate(n) {\n let string = this.toString();\n if (n > string.length) {\n return string;\n }\n\n if (n < 4) {\n return '.'.repeat(n);\n }\n\n if (!string.contains(' ')) {\n return string.slice(0, n - 3) + '...';\n }\n\n const truncatedString = string.slice(0, string.length - n);\n\n const wordsInOriginalString = string.split(' ');\n const wordsInTruncatedString = truncatedString.split(' ');\n\n /*\n let's say the string is \"I am legend\"\n 012345678910\n and the truncate n = 8 --> I a\n wordsInOriginalString = [I, am, legend]\n wordsInTruncatedString = [I, a]\n\n if part of the word is missing, then get rid of the word\n */\n\n const wordIndexCompare = wordsInTruncatedString.length - 1;\n if (wordsInOriginalString[wordIndexCompare] !== wordsInTruncatedString[wordIndexCompare]) {\n wordsInTruncatedString.pop();\n }\n\n return wordsInTruncatedString.join(' ') + '...';\n }","function wrapText(ctx, text, x, y, max_width, line_height) {\n var words = text.split(' ');\n var line = '';\n\n for (var n = 0; n < words.length; n++) {\n var new_line = line + words[n] + ' ';\n var new_width = ctx.measureText(new_line).width;\n\n if (new_width > max_width && n > 0) {\n ctx.fillText(line.trim(), x, y);\n line = words[n] + ' ';\n y += line_height;\n } else line = new_line;\n } //for n\n\n\n ctx.fillText(line.trim(), x, y);\n } //function wrapText","function shave(target, maxHeight) {\n var opts = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n if (typeof maxHeight === 'undefined' || isNaN(maxHeight)) throw Error('maxHeight is required');\n var els = typeof target === 'string' ? document.querySelectorAll(target) : target;\n if (!els) return;\n var character = opts.character || '…';\n var classname = opts.classname || 'js-shave';\n var spaces = typeof opts.spaces === 'boolean' ? opts.spaces : true;\n var charHtml = \"<span class=\\\"js-shave-char\\\">\".concat(character, \"</span>\");\n if (!('length' in els)) els = [els];\n\n for (var i = 0; i < els.length; i += 1) {\n var el = els[i];\n var styles = el.style;\n var span = el.querySelector(\".\".concat(classname));\n var textProp = el.textContent === undefined ? 'innerText' : 'textContent'; // If element text has already been shaved\n\n if (span) {\n // Remove the ellipsis to recapture the original text\n el.removeChild(el.querySelector('.js-shave-char'));\n el[textProp] = el[textProp]; // eslint-disable-line\n // nuke span, recombine text\n }\n\n var fullText = el[textProp];\n var words = spaces ? fullText.split(' ') : fullText; // If 0 or 1 words, we're done\n\n if (words.length < 2) continue; // Temporarily remove any CSS height for text height calculation\n\n var heightStyle = styles.height;\n styles.height = 'auto';\n var maxHeightStyle = styles.maxHeight;\n styles.maxHeight = 'none'; // If already short enough, we're done\n\n if (el.offsetHeight <= maxHeight) {\n styles.height = heightStyle;\n styles.maxHeight = maxHeightStyle;\n continue;\n } // Binary search for number of words which can fit in allotted height\n\n\n var max = words.length - 1;\n var min = 0;\n var pivot = void 0;\n\n while (min < max) {\n pivot = min + max + 1 >> 1; // eslint-disable-line no-bitwise\n\n el[textProp] = spaces ? words.slice(0, pivot).join(' ') : words.slice(0, pivot);\n el.insertAdjacentHTML('beforeend', charHtml);\n if (el.offsetHeight > maxHeight) max = pivot - 1;else min = pivot;\n }\n\n el[textProp] = spaces ? words.slice(0, max).join(' ') : words.slice(0, max);\n el.insertAdjacentHTML('beforeend', charHtml);\n var diff = spaces ? \" \".concat(words.slice(max).join(' ')) : words.slice(max);\n var shavedText = document.createTextNode(diff);\n var elWithShavedText = document.createElement('span');\n elWithShavedText.classList.add(classname);\n elWithShavedText.style.display = 'none';\n elWithShavedText.appendChild(shavedText);\n el.insertAdjacentElement('beforeend', elWithShavedText);\n styles.height = heightStyle;\n styles.maxHeight = maxHeightStyle;\n }\n}","function shortWords(array) {\n return array.filter(word => word.length < 5);\n}","function constrain(unsplit_str, front_half, back_half, ideal_width, className, element_width)\n{\n\tvar text = unsplit_str;\n var temp_item = ('<span class=\"'+className+'_hide\" style=\"display:none;\">'+ text +'</span>');\n $(temp_item).appendTo('body');\n var item_width = $('span.'+className+'_hide').width();\n var ideal = parseInt(ideal_width);\n var smaller_text = text;\n var front_half1 = front_half;\n var back_half1 = back_half;\n\n if (item_width>ideal_width)\n {\n while (item_width > ideal)\n {\n \tfront_half1 = front_half1.substr(0, (front_half1.length-1));\n \tback_half1 = back_half1.substr(1);\n smaller_text = front_half1 + \"..\" + back_half1;\n $('.'+className+'_hide').html(smaller_text);\n item_width = $('span.'+className+'_hide').width();\n }\n smaller_text = smaller_text;\n return_text = smaller_text;\n }\n\t$('span.'+className+'_hide').remove();\n\treturn(smaller_text);\n}","function retrieveWord(length, index) {\n \tif ((length >= minw) && (length <= maxw) &&\n\t (index >= 0) && (index < nwords[length])) {\n\t return cwords[length].substring(length * index, length * (index + 1));\n\t}\n\treturn \"\";\n }","function wordHax(str) {\n \n \n \n for (i = 0; i < strArray.length; i++) {\n var strArray = str.split(\" \");\n }\n if (strArray[i].length > 3)\n {\n \n strArray[i] = strArray[i](/a|e|i|o|u/gi, \"\");\n \n }\n else\n {\n \n x.toUpperCase();\n \n }\n \n }","function wrapText(caption,maxChars){\n\tif (!maxChars) maxChars = 20;\n\n\tvar words = caption.split(\" \");\n\tvar line = \"\";\n\n\tvar wrap = new Array();\n\n\tfor (var n = 0; n < words.length; n++) {\n\t\tvar testLine = line + words[n] + \" \";\n\t\tif (testLine.length > maxChars || words[n]==\"|\")\n\t\t{\n\t\t\twrap.push(line);\n\n\t\t\tif (words[n]==\"|\") words[n]=\"\";\n\n\t\t\tline = words[n] + \" \";\n\t\t}\n\t\telse {\n\t\t\tline = testLine;\n\t\t}\n\t}\n\twrap.push(line);\n\treturn wrap;\n}","function getOffensiveMaterialDeduction(text) {\r\n\tvar maximumDeduction = commentMaxOffensiveWordDeduction; \r\n\tvar offensiveWordCount = wordFilter.countOffensiveWords(text); \r\n\treturn (offensiveWordCount > maximumDeduction) ? -maximumDeduction : -offensiveWordCount; \r\n}","function filterLongWord(arr, i){\n var q=[];\n var k =0;\n arr.map(function(p,c){\n if(p.split('').length>i) q[k++]=p;\n });\n return q;\n }","function truncate(str, maxChars, append, onlyFullWords) {\n append = append || \"...\";\n maxChars = onlyFullWords ? maxChars + 1 : maxChars;\n\n str = trim(str);\n if (str.length <= maxChars) {\n return str;\n }\n str = str.substr(0, maxChars - append.length);\n //crop at last space or remove trailing whitespace\n str = onlyFullWords ? str.substr(0, str.lastIndexOf(\" \")) : trim(str);\n return str + append;\n}","function wordsLongerThanThree(string) {\n var words = string.split(\" \");\n return filter(words, function(x) {\n return (x.length > 3);\n });\n }","function indexWord(index) {\n \tif ((index >= 0) && (index < twords)) {\n\t var j;\n\n\t for (j = minw; j <= maxw; j++) {\n\t\tif (index < nwords[j]) {\n\t\t break;\n\t\t}\n\t\tindex -= nwords[j];\n\t }\n\t return retrieveWord(j, index);\n\t}\n\treturn \"\";\n }","function wordsLongerThanThree(str) {\n var arr = str.split(\" \")\n return filter(arr ,function(element, i){\n return element.length > 3;\n })\n }","async getWords(startWord='', maxLength=30) {}","function wordsLongerThanThree (string) {\n \tvar words = string.split(\" \");\n\treturn filter (words, function (str) {\n\t\treturn str.length > 3;\n\t})\n}","function big_word(array) {\n var longest_words = '';\n var current_words = '';\n for (var i=0; i<array.length; i++) {\n current_words = array[i];\n if (current_words.length > longest_words.length) {\n longest_words = current_words;\n }\n }\n return longest_words;\n}","function createGoodness() {\n\n var numPhrases = 100\n\n //get starting word\n var newShit = getNewWord()\n \n\n //Save last word for key \n var lastWord = newShit\n \n\n for(var i = 0; i < numPhrases - 1; i++) {\n\n var newWord = \"\"\n\n if(words.has(lastWord)) {\n newWord = words.get(lastWord).getWord()\n }\n else {\n var newWord = getNewWord()\n }\n\n newShit += \" \"\n newShit += newWord\n lastWord = newWord\n \n }\n\n //console.log(newShit)\n document.getElementById(\"MarkovText\").innerHTML = newShit\n\n var longest = 0\n words.forEach(item => {\n if(item.getNumFollowers() > longest) {\n longest = item.getNumFollowers() \n }\n })\n\n console.log(longest)\n}","function allowedCharLength(words){\n\n var base = 8 + 40*smoothstep(1, 100, words.length);\n\n var rando = random(0.8, 1.2);\n\n return abs(round(base*rando)) + 1; // absolute value of 80-120% of the baseline value (+1 so that it's never 0)\n}","function maxWord2(s) {\n l=s.split(\" \");\n return maxWord(l);\n }","function designerPdfViewer(h, word) {\n return Math.max(...word.split('').map((e) => h[e.charCodeAt(0) - 97] * word.length));\n}","function LongestWord2(sen) { \n\n let result= sen\n .replace(/[^a-z A-Z]/g, ' ')\n .split(' ')\n .reduce((a,b)=> b.length > a.length ? b : a, '');\n return result;\n \n}","function abbrevIfTextOverflow(id, index){\n // need to replace this with text width funct\n // if ( $('#'+id)[0].scrollWidth > $('#'+id).innerWidth()) {\n // var file_text_elem = document.getElementById(id);\n // text=file_text_elem.value;\n // abbrevText(file_text_elem, text);\n // // originalFileNames.values[index] = \"\\n\" + originalFileNames.values[index]; //mark that abbreviation was made with an illegal newline character in array of original names \n // }\n }","function maxWordLength(previousWord, currentWord) {\n if (currentWord.length > previousWord.length) {\n return currentWord;\n }\n else {\n return currentWord = previousWord;\n }\n}","function longestWord(text) {\n let wordArray = text.split(\" \");\n let maxLength = 0;\n let result = \"\";\n\n for (let i = 0; i < wordArray.length; i++) {\n if (wordArray[i].length > maxLength) {\n //We Check for length of wordArray[i] to see if its greater than maxLength\n maxLength = wordWarray[i].length;\n //If it is, we replace maxLength with this new value.\n result = wordArray[i];\n //Now result holds the longest word in the sentence\n }\n }\n\n return result;\n //The is returned as such.\n}","function truncate(str, n, useWordBoundary) {\n if (str.length <= n) {\n return str;\n }\n\n var subString = str.substr(0, n - 1);\n return (useWordBoundary ? subString.substr(0, subString.lastIndexOf(\" \")) : subString) + \" ...\";\n}","function LongestWord(sen) {\n var output;\n var words = sen.split(' ');\n var longWord = '';\n for (var i = 0; i < words.length; i++) {\n if (longWord.length < words[i].length) {\n longWord = words[i];\n }\n }\n return longWord\n}","function high(x){\n var biggest = {\n points: 0,\n word: \"\",\n };\n x.split(\" \").forEach(currentWord => {\n var totalPoints = 0;\n currentWord.split(\"\").forEach((letter) => {\n var points = letter.charCodeAt(0) - 96;\n totalPoints += points;\n });\n if (totalPoints > biggest.points) {\n biggest.points = totalPoints;\n biggest.word = currentWord;\n }\n });\n return biggest.word;\n}","function filterLongWords(arr, WrodLength) {\n\n // let arrOfLongWords = [];\n // arr.forEach(function (item) {\n // if (item.length > WrodLength) {\n // arrOfLongWords.push(item);\n // }\n // });\n // return arrOfLongWords;\n \n return arr.filter(str => str.length > WrodLength);\n}","function isNoLongerThan(word, length = 32) {\n return word.length <= length;\n}","function BOT_extractWords() {\r\n\tvar word, matchlist;\r\n\tvar lemstring = BOT_lemString;\r\n\tvar worldlist = [];\r\n\tvar rex = new RegExp(\"< (\\\\w+) (.*)\");\r\n\tfor(var i=0; i<BOT_maxExtractedWords; i++) { // Words extracted is limited\r\n\t\tif(lemstring.search(rex) != -1) {\r\n\t\t\trex.lastIndex = 0;\r\n\t\t\tmatchlist = rex.exec(lemstring);\r\n\t\t\tword = BOT_englishWordCutPlural(matchlist[1]);\r\n\t\t\tworldlist = worldlist.concat(word);\r\n\t\t\tlemstring = \"< \"+matchlist[2];\r\n\t\t}\r\n\t}\r\n\treturn worldlist;\r\n}","function find_longest_word(str)\n {\n var array1 = str.match(/\\w[a-z]{0,}/gi);\n var result = array1[0];\n\n for(var x = 1 ; x < array1.length ; x++)\n {\n if(result.length < array1[x].length)\n {\n result = array1[x];\n }\n }\n return result;\n }","function findShort(s) {\n let words = s.split(\" \");\n let min = words[0].length;\n for (i = 1; i < words.length; i++) {\n if (words[i].length < min) {\n min = words[i].length;\n }\n }\n return min;\n}","function SmartTruncate(field,limit,width,nohover,ellipsis){\n\tif(!width)width=0;\n\tif(!ellipsis)ellipsis = \"...\";\n\t$('body').append('<div id=\"truncation\"></div>');\n\tvar truncBox = $('#truncation');\n\tvar truncStyles = [\"font-family\",\"font-weight\",\"font-size\",\"line-height\"];\n\t$(field).each(function(){\n\t\tfor(var i in truncStyles){\n\t\t\ttruncBox.css(truncStyles[i],$(this).css(truncStyles[i]));\n\t\t}\n\t\ttruncBox.css(\"width\",(width==0) ? $(this).css(\"width\") : width+\"px\");\n\t\tvar originalstring = $(this).html();\n\t\tif(!nohover)$(this).attr(\"title\",originalstring.replace(\"&\",\"&\"));\n\t\ttruncBox.html(originalstring);\n\t\tif(truncBox.height() > limit){\n\t\t\tvar upperbound = originalstring.length;\n\t\t\tvar lowerbound = 0;\n\t\t\tvar checkpoint = Math.floor((upperbound+lowerbound)/2);\n\t\t\twhile((upperbound - lowerbound) > 1){\n\t\t\t\ttruncBox.html(originalstring.substring(0,checkpoint)+ellipsis);\n\t\t\t\tif(truncBox.height() > limit)\n\t\t\t\t\tupperbound = checkpoint;\n\t\t\t\telse\n\t\t\t\t\tlowerbound = checkpoint;\n\t\t\t\tcheckpoint = Math.floor((upperbound+lowerbound)/2);\n\t\t\t}\n\t\t\t$(this).html(originalstring.substring(0,lowerbound)+ellipsis);\n\t\t}\n\t});\n\ttruncBox.remove();\n}","function shorten( $text, $length ) {\n\n // Skip if max length defined zero\n if ( $length == '0' ) return $text;\n\n // Do the magic\n var length = $length || 10;\n if ( $text.length > length ) {\n $text = $text.substring( 0, length ) + '…';\n }\n\n return $text;\n}","function nonsenseWord() {\n var word = chance.word({syllables: 3});\n return word;\n}","function longText(ctx, text, x, y, maxWidth, lineHeight){\n for(var p = 0; p < text.length; p++){\n var words = text[p].split(' ');\n var line = '';\n for(var n = 0; n < words.length; n++) {\n var testLine = line + words[n] + ' ';\n var metrics = ctx.measureText(testLine);\n var testWidth = metrics.width;\n if (testWidth > maxWidth && n > 0) {\n ctx.fillText(line, x, y);\n line = words[n] + ' ';\n y += lineHeight;\n }\n else {\n line = testLine;\n }\n }\n ctx.fillText(line, x, y);\n y += (lineHeight*1.5);\n }\n }","function designerPdfViewer(h, word) {\r\n const letterA = 97;\r\n\r\n function myArrayMax(arr) {\r\n var len = arr.length;\r\n var max = -Infinity;\r\n while (len--) {\r\n if (arr[len] > max) {\r\n max = arr[len];\r\n }\r\n }\r\n return max;\r\n }\r\n \r\n var letterHeights = [];\r\n var idx = 0;\r\n for (var i = 0; i < word.length; i++) {\r\n idx = word.charCodeAt(i) - letterA;\r\n letterHeights.push(h[idx]);\r\n }\r\n // console.log(`letterHeights: ${letterHeights}`);\r\n\r\n var maxHeight = myArrayMax(letterHeights);\r\n\r\n return maxHeight * word.length;\r\n}","function LongestWord(sen) {\n return sen.replace(/[^a-zA-Z ]/g;, '')\n .split(' ')\n .filter(String)\n .reduce(function(longest, word) {\n if (word.length > longest.length)\n return word;\n return longest;\n }, '');\n}"],"string":"[\n \"function truncateWords(longText, wordLimit) {\\n // longText (a String with several words in it)\\n // wordLimit (an Integer that sets the number of words you want in the returned text)\\n\\n // declaration, assignments\\n var splitWords = [];\\n var numWords = 0;\\n var numWords_Short = 0;\\n // var numWords2Remove = 0; not used\\n var arrTruncWords = [];\\n var strEllipses = \\\"...\\\";\\n var shortText_local = \\\"\\\";\\n var wordLimitIn = wordLimit;\\n\\n\\n\\n\\n\\n // ** split longText into an Array\\n longText = longText.replace(/\\\\s\\\\s+/g, ' '); /* rm spc tab nl */\\n splitWords = longText.split(' ');\\n numWords = splitWords.length; // ** length = number of words Array\\n\\n\\n // ** case when no numWords function argument, or if it is\\n if (wordLimit === undefined) { // if not entered as argument\\n wordLimit = 6;\\n } else if (wordLimit < 1) { // if less than 1 (0 or negative)\\n wordLimit = 7;\\n }\\n\\n if (wordLimit > numWords) { // if > words in string\\n wordLimit = numWords;\\n }\\n\\n // NOTE: this is not used (not necessary for current requirements)\\n //numWords2Remove = numWords - wordLimit; // ** # of words 2be removed\\n\\n\\n arrTruncWords = splitWords.splice(0, wordLimit); // remove extra words\\n numWords_Short = arrTruncWords.length;\\n if (numWords_Short !== numWords) {\\n arrTruncWords.push(strEllipses); // add ellipses \\\"...\\\"\\n }\\n shortText_local = arrTruncWords.join(' '); // recreate string wo extra words\\n\\n\\n var ellipseText_local = { // create object\\n textIn: longText,\\n textOut: shortText_local,\\n wordCountIn: numWords,\\n wordCountOut: numWords_Short,\\n wordLimitIn: wordLimitIn,\\n wordLimitOut: wordLimit\\n };\\n\\n return ellipseText_local; // rtn string\\n}\",\n \"function filterLongWords (array,num){\\n newWord = [];\\n for (var i = 0; i < array.length; i++){\\n if(array[i].length > num){\\n newWord.push(array[i]);\\n }\\n }\\n return newWord;\\n}\",\n \"function filterLongWords(words, i) {\\n\\n}\",\n \"function trimByWord(sentence) {\\r\\n\\tvar numberOfWords = 100;\\r\\n var result = sentence;\\r\\n var resultArray = result.split(\\\" \\\");\\r\\n if(resultArray.length > numberOfWords){\\r\\n\\t\\tresultArray = resultArray.slice(0, numberOfWords);\\r\\n\\t\\tresult = resultArray.join(\\\" \\\");\\r\\n\\t\\tvar n = result.lastIndexOf(\\\".\\\")\\r\\n\\t\\tresult = \\\"truncated for brevity. \\\" + result.substring(0, n)+ \\\".\\\";\\r\\n }\\r\\n return result;\\r\\n}\",\n \"function filterLongWords(words, i){\\n //...\\n}\",\n \"function filterLongWords(words, i){\\n \\\"use strict\\\";\\n\\n}\",\n \"function beyond(s) {\\n if (s.length === 0) {\\n return exports.MAX_WORD;\\n }\\n var code = s.charCodeAt(s.length - 1);\\n return s.slice(0, -1) + String.fromCharCode(code + 1);\\n}\",\n \"function filterLongWord (array, int) {\\n var longWord = []\\n for (var i = 0; i < array.length; i++) {\\n if (array[i].length > int) {\\n longWord.push(array[i])\\n }\\n }\\n return longWord\\n}\",\n \"shortenText(text){\\n return text.substr(0, 270) + \\\"...\\\";\\n }\",\n \"function reduceTextContent(text,limit){\\n\\tlet index = text.indexOf(' ',limit);\\n\\treturn (index != -1)?text.substring(0,index):\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttext;\\n}\",\n \"function filterLongWords(words, a) {\\n return words.filter(word => word.length >= a);\\n}\",\n \"function filterLongWords(wordArray, i) {\\r\\n return wordArray.filter(word => word.length > i);\\r\\n}\",\n \"function truncateWords(longText, numWords) {\\n var truncatedText = longText\\n // Split string by space to get array of words.\\n var words = longText.split(\\\" \\\");\\n // Calculate how many words need to be removed.\\n var countWordsInText = words.length;\\n var countWordsToRemove = countWordsInText - numWords;\\n // Truncate text only if it needs to.\\n if(countWordsToRemove > 0) {\\n var removeStartIndex = (countWordsInText - countWordsToRemove);\\n words.splice (removeStartIndex, countWordsToRemove);\\n words.push (\\\"...\\\")\\n \\n truncatedText = words.join(\\\" \\\")\\n }\\n\\n return truncatedText;\\n}\",\n \"getClippedText() {\\n if (this.text.length >= 500) {\\n return clip(this.text, 300, { html: true, indicator: \\\"\\\", maxLines: 5 });\\n }\\n\\n return null;\\n }\",\n \"function filterLongWords(array, i ) {\\n var newArray = [];\\n array.forEach(function (word) {\\n if( word.length > i ) { newArray.push(word)};\\n });\\n return newArray;\\n}\",\n \"function BOT_englishWordCutPlural(word) {\\r\\n\\tif( BOT_member(BOT_pluralExceptionList, word) || word.length <= 3 ) return word;\\r\\n\\telse return(word.replace(/(\\\\w+)s$/, \\\"$1\\\"));\\r\\n}\",\n \"function filterLongWords(arr,i) {\\n let word = \\\"\\\";\\n for (let i = 0; i < arr.length; i++) {\\n if (word.length < arr[i].length) {\\n word = arr[i];}\\n }\\n return word;\\n // finds the length of the longest word \\n }\",\n \"function filterLongWords(words, size){\\n \\\"use strict\\\";\\n var newWordList = [];\\n\\n for(var i=0; i<words.length; i++){\\n var word = words[i];\\n if(word.length < size){\\n newWordList.push(word);\\n }\\n }\\n\\n return newWordList;\\n}\",\n \"function filterWords(word){\\n return word.length > 5; \\n}\",\n \"function longTextFilter() {\\n var postfix = \\\"...\\\";\\n return function (input, maxLength) {\\n var ret;\\n if (input.length > (maxLength + postfix.length)) {\\n ret = input.substr(0, maxLength) + postfix;\\n }\\n else {\\n ret = input;\\n }\\n return ret;\\n };\\n }\",\n \"function filterLongWords (words, i) {\\n var newArray = [];\\n\\tfor (var x = 0; x < words.length; x++){\\n\\t\\tif(words[x].length >= i){\\n newArray.push(words[x]);\\n\\t\\t}\\n\\t}\\n return newArray;\\n}\",\n \"function filterLongWords(words, i){\\n var longWords = words.filter(function(word){\\n if (word.length > i) {\\n return word};\\n });\\n return longWords\\n }\",\n \"function filterLongWords(words, i) {\\n \\\"use strict\\\";\\n //...\\n}\",\n \"truncDesc() {\\n let description = this.props.data.description;\\n if (description == null) {\\n return \\\"\\\";\\n }\\n else if (description.length <= 105) {\\n return description;\\n }\\n else if (description.split(\\\" \\\").length === 1) {\\n return description.slice(0, 105) + \\\"...\\\";\\n }\\n let words = description.split(\\\" \\\");\\n let letters = 0;\\n let index = 0;\\n while (letters <= 105 && index < words.length) {\\n letters += words[index].length;\\n index++;\\n }\\n return words.slice(0, index).join(\\\" \\\") + \\\"...\\\";\\n }\",\n \"function longestWord(sen) {}\",\n \"function high(s){\\n let as = s.split(' ').map(s=>[...s].reduce((a,b)=>a+b.charCodeAt(0)-96,0));\\n return s.split(' ')[as.indexOf(Math.max(...as))];\\n }\",\n \"_adjustLengthText(stText, limit) {\\n if (stText.length > limit)\\n return stText.slice(0, limit) + \\\"...\\\";\\n else\\n return stText;\\n }\",\n \"_adjustLengthText(stText, limit) {\\n if (stText.length > limit)\\n return stText.slice(0, limit) + \\\"...\\\";\\n else\\n return stText;\\n }\",\n \"function high(x){\\nlet result = '';\\nlet bestScore = 0;\\nlet arrayWord = x.split(' ');\\n for (let p = 0 ; p < arrayWord.length ; p++ ){\\n let wordScore = 0;\\n for (let k = 0; k < arrayWord[p].length; k++){\\n let code = arrayWord[p].toUpperCase().charCodeAt(k)\\n if (code > 64 && code < 91 ) wordScore += (code - 64);\\n }\\n bestScore < wordScore ? ( bestScore = wordScore, result = arrayWord[p]) : null;\\n }\\n return result;\\n}\",\n \"function megaFriend(bigword) {\\n var word = \\\"\\\";\\n for (var i = 0; i < bigword.length; i++) {\\n if (word.length < bigword[i].length) {\\n word = bigword[i];\\n }\\n }\\n return word;\\n}\",\n \"function filterLongWords(words, i)\\n{\\n\\n\\n\\n\\nvar x = words.filter(function(word){\\n\\n\\treturn word.length > i;\\n}); \\nreturn x;\\n}\",\n \"function filterLongWords(strings, i){\\n return strings.filter(strings=>strings.length>=i);\\n}\",\n \"function cut(texto) {\\n if (texto.length >= 50) {\\n var newText = texto.slice(0,50) + \\\"...\\\";\\n return newText;\\n }else {\\n return texto;\\n }\\n \\n}\",\n \"function truncate( n, useWordBoundary ){\\n var isTooLong = this.length > n,\\n s_ = isTooLong ? this.substr(0,n-1) : this;\\n s_ = (useWordBoundary && isTooLong) ? s_.substr(0,s_.lastIndexOf(' ')) : s_;\\n return isTooLong ? s_ + '...' : s_;\\n}\",\n \"function filterLongWords(words, i){\\n \\\"use strict\\\";\\n\\n var strings = words;\\n var number = i;\\n var longWords = [];\\n\\n for(var i = 0; i < strings.length; i++){\\n if (strings[i].length > number){\\n longWords.push(strings[i])\\n }\\n }\\n return longWords;\\n }\",\n \"function filterLongWords(arr, i) {\\n let longWordArray = [];\\n for (let test = 0; test < arr.length; test++) {\\n if (arr[test].length > i) {\\n longWordArray += arr[test];\\n }\\n }\\n return longWordArray;\\n}\",\n \"function cliping() {\\n\\t\\t\\t\\t// calculate length of word;\\n\\t\\t\\t\\tvar width = $next.getBoundingClientRect().width;\\n\\t\\t\\t\\telm[0].style.width = '0px';\\n\\t\\t\\t\\tsetTimeout(function () {\\n\\t\\t\\t\\t\\telm[0].style.width = width + 15 + 'px';\\n\\t\\t\\t\\t}, 1000);\\n\\t\\t\\t}\",\n \"maxAdjacentWordsToUse() {\\n const selectedWordCount = this.selectedWordCount()\\n if (selectedWordCount < 4) {\\n return 4\\n }\\n if (selectedWordCount < 6) {\\n return 2\\n }\\n return 1\\n }\",\n \"function filterLongWord(arr, n){\\n let arr1=[];\\n for(i=0; i<arr.length; i++){\\n if(arr[i].length>n)\\n arr1.push(arr[i]);\\n }\\n return arr1;\\n }\",\n \"function spinWords(w){\\n let wordArray = w.split(' ')\\n let spunWord = []\\n wordArray.map((word) => { \\n word.length < 5 ? spunWord.push(word) : spunWord.push(word.split('').reverse().join(''))\\n })\\n return spunWord.join(' ')\\n }\",\n \"function filterLongWords(array,i) {\\n array.filter(function(words,i){\\n return words.length > i\\n}); \\n}\",\n \"function truncate(str, maxChars, append, onlyFullWords){\\n\\t str = toString(str);\\n\\t append = append || '...';\\n\\t maxChars = onlyFullWords? maxChars + 1 : maxChars;\\n\\n\\t str = trim(str);\\n\\t if(str.length <= maxChars){\\n\\t return str;\\n\\t }\\n\\t str = str.substr(0, maxChars - append.length);\\n\\t //crop at last space or remove trailing whitespace\\n\\t str = onlyFullWords? str.substr(0, str.lastIndexOf(' ')) : trim(str);\\n\\t return str + append;\\n\\t }\",\n \"function trimSentence(text, maxLength) {\\nreturn text.slice(0, maxLength) + \\\"...\\\";\\n }\",\n \"function offbeatLimit(w) {\\n return stdLimit(w > 1 ? (1 - 2 * (w - 1)) : w);\\n }\",\n \"remainingWords() {\\n return this._wordList.length - this._usedWords.length\\n }\",\n \"function hitungHuruf(kata) {\\n\\tvar max_word = [\\\"\\\",0];\\n\\tvar theWordOccurence = 0;;\\n\\tkata = kata.match(/[^\\\\s]+[a-zA-z]/gm);\\n\\tfor (var word of kata){\\n\\t\\tif(word.split(\\\"\\\").sort().join(\\\"\\\").match(/(.)\\\\1+/g)){\\n\\t\\t\\ttheWordOccurence = word.split(\\\"\\\").sort().join(\\\"\\\").match(/(.)\\\\1+/g).length;\\n\\t\\t\\tif(theWordOccurence>max_word[1]){\\n\\t\\t\\t\\tmax_word = [word, theWordOccurence];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn max_word[0];\\n}\",\n \"function filterLongWords(words, i){\\n \\\"use strict\\\";\\n var longWords = []\\n words.map(function(word){\\n if (word.length > i) {\\n longWords.push(word)\\n }\\n })\\n return longWords;\\n\\n // for (var x=0; x<words.length; x++){\\n \\n // }\\n}\",\n \"function shortenText (longText, maxCharLength) {\\n const charLength = longText.length\\n\\n if (charLength > maxCharLength) {\\n // If text is too long, then return the amount\\n const splitArray = longText.split(' ')\\n let charCounter = 0\\n let i = 0\\n for (i = 0; i < splitArray.length; i++) {\\n if (charCounter + splitArray[i].length + 1 > maxCharLength) {\\n break\\n }\\n charCounter += splitArray[i].length + 1\\n }\\n const shortenedText = splitArray.slice(0, i).join(' ') + ' ...'\\n return shortenedText\\n }\\n // If text is right\\n return longText\\n}\",\n \"function filterLongWords(array,iVal){\\n\\n return array.filter(arr=>arr.length > iVal).join(',');\\n\\n}\",\n \"function filterLongWords(arr, len){\\n\\treturn arr.filter((word) => word.length > len);\\n}\",\n \"function filterLongWords(words, n){\\n var array = words.split(',')\\n\\n var finalArray = []\\n for (var i = 0; i < array.length; i++) {\\n if (array[i].length > n) {\\n finalArray.push(array[i])\\n }\\n }\\n return finalArray\\n}\",\n \"function findLongestWordNonReduceVersion(words) {\\n \\\"use strict\\\";\\n var longestWord = \\\"\\\";\\n words.forEach(function(w) {\\n if (longestWord.length > w.length) longestWord = w;\\n });\\n return longestWord;\\n }\",\n \"function high(x) {\\n let arrOfSum = [];\\n let arrOfWords = x.split(' ');\\n for (let i = 0; i < arrOfWords.length; i++) {\\n arrOfSum.push(arrOfWords[i].split('')\\n .map(item => item.charCodeAt() - 96)\\n .reduce((current, sum) => sum + current, 0));\\n }\\n let position = arrOfSum.indexOf(Math.max(...arrOfSum));\\n return arrOfWords[position];\\n}\",\n \"function truncateWithEllipsis(text, maxChars, ellipsis, fullWords, rtl) {\\n if (text.length <= maxChars) {\\n return text;\\n }\\n // Calc max chars\\n maxChars -= ellipsis.length;\\n if (maxChars < 1) {\\n maxChars = 1;\\n //ellipsis = \\\"\\\";\\n }\\n // Get lines\\n var lines = splitTextByCharCount(text, maxChars, fullWords, rtl);\\n // Use first line\\n return (lines[0] || \\\"\\\") + ellipsis;\\n}\",\n \"function shortenTitle(text) {\\n\\tif (text.length > 40)\\n\\t\\treturn text.substring(0, 40) + \\\"... [+\\\" + (text.length - 40) + \\\"chars]\\\";\\n\\telse\\n\\t\\treturn text;\\n}\",\n \"function findShort(s){\\nvar split = s.split(' ')\\ncounter = 100\\n\\nfor (var i=0; i<split.length; i++){\\n if (split[i].length < counter){\\n \\tcounter = split[i].length\\n word = split[i]\\n \\t}\\n }\\n return counter;\\n}\",\n \"function trimSentence(text, maxLength) {\\n // Add your code here.\\n return text;\\n}\",\n \"function truncate(target, maxHeight) {\\n if (!target || !maxHeight) {return;}\\n\\n var original = target.nodeValue.replace(opt.truncationChar, '');\\n\\n var words = original.split(' ');\\n\\n var start=0, end = words.length-1, mid=-1, m;\\n\\n while (start <= end && end > 0) {\\n m = Math.floor((start+end)/2);\\n if (m == mid) {\\n break;\\n }\\n mid= m;\\n\\n applyEllipsis(target, words.slice(0, mid+1).join(' '));\\n\\n height = getElemHeight(element);\\n\\n\\n if (height <= maxHeight) {\\n start = mid;\\n } else {\\n end = mid;\\n }\\n }\\n\\n if (height > maxHeight) {\\n target.parentNode.removeChild(target);\\n truncate(getLastTextNode(element), maxHeight);\\n }\\n }\",\n \"function filterLongWords (arr, i) {\\n var ret = [];\\n arr.forEach(function(s){\\n if (s.length > i) {\\n ret += [s];\\n }\\n });\\n debugger;\\n return ret;\\n}\",\n \"function filterLongWords (words, i) {\\r\\n let arr = words.filter(elem=>elem.length>i);\\r\\n return arr;\\r\\n}\",\n \"function _usfTruncateWords (str, size = 10, description_words = '...') {\\r\\n if (!str)\\r\\n return \\\"\\\";\\r\\n if (str.split(' ').length && str.split(' ').length <= size)\\r\\n return str;\\r\\n return str.split(' ').slice(0, size - 1).join(' ') + description_words\\r\\n}\",\n \"function restrictRange(transdelta){\\n var mCtx = metricsContext,\\n mtextW = mCtx.curr_mtext_width,\\n width = mCtx.canvasT.width;\\n // console.log('Scrolling lastX: %s; delta: %s; translated: %s; width: %s', \\n // mCtx.lastX, transdelta-mCtx.translated, mCtx.translated, mtextW);\\n \\n var pm = 0; // 0.15; // panning margin factor, normalized\\n // if text fits within canvas width completely\\n if (mtextW < width)\\n return transdelta > width-mtextW*(1-pm) ? width-mtextW*(1-pm) :\\n transdelta < -mtextW*pm ? -mtextW*pm : transdelta;\\n // if text is wider then the canvas width\\n else {\\n return transdelta > width*(pm) ? width*(pm) :\\n transdelta < -mtextW+width*(1-pm) ? -mtextW+width*(1-pm) : \\n transdelta;\\n }\\n}\",\n \"function truncate(n) {\\n let string = this.toString();\\n if (n > string.length) {\\n return string;\\n }\\n\\n if (n < 4) {\\n return '.'.repeat(n);\\n }\\n\\n if (!string.contains(' ')) {\\n return string.slice(0, n - 3) + '...';\\n }\\n\\n const truncatedString = string.slice(0, string.length - n);\\n\\n const wordsInOriginalString = string.split(' ');\\n const wordsInTruncatedString = truncatedString.split(' ');\\n\\n /*\\n let's say the string is \\\"I am legend\\\"\\n 012345678910\\n and the truncate n = 8 --> I a\\n wordsInOriginalString = [I, am, legend]\\n wordsInTruncatedString = [I, a]\\n\\n if part of the word is missing, then get rid of the word\\n */\\n\\n const wordIndexCompare = wordsInTruncatedString.length - 1;\\n if (wordsInOriginalString[wordIndexCompare] !== wordsInTruncatedString[wordIndexCompare]) {\\n wordsInTruncatedString.pop();\\n }\\n\\n return wordsInTruncatedString.join(' ') + '...';\\n }\",\n \"function wrapText(ctx, text, x, y, max_width, line_height) {\\n var words = text.split(' ');\\n var line = '';\\n\\n for (var n = 0; n < words.length; n++) {\\n var new_line = line + words[n] + ' ';\\n var new_width = ctx.measureText(new_line).width;\\n\\n if (new_width > max_width && n > 0) {\\n ctx.fillText(line.trim(), x, y);\\n line = words[n] + ' ';\\n y += line_height;\\n } else line = new_line;\\n } //for n\\n\\n\\n ctx.fillText(line.trim(), x, y);\\n } //function wrapText\",\n \"function shave(target, maxHeight) {\\n var opts = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\\n if (typeof maxHeight === 'undefined' || isNaN(maxHeight)) throw Error('maxHeight is required');\\n var els = typeof target === 'string' ? document.querySelectorAll(target) : target;\\n if (!els) return;\\n var character = opts.character || '…';\\n var classname = opts.classname || 'js-shave';\\n var spaces = typeof opts.spaces === 'boolean' ? opts.spaces : true;\\n var charHtml = \\\"<span class=\\\\\\\"js-shave-char\\\\\\\">\\\".concat(character, \\\"</span>\\\");\\n if (!('length' in els)) els = [els];\\n\\n for (var i = 0; i < els.length; i += 1) {\\n var el = els[i];\\n var styles = el.style;\\n var span = el.querySelector(\\\".\\\".concat(classname));\\n var textProp = el.textContent === undefined ? 'innerText' : 'textContent'; // If element text has already been shaved\\n\\n if (span) {\\n // Remove the ellipsis to recapture the original text\\n el.removeChild(el.querySelector('.js-shave-char'));\\n el[textProp] = el[textProp]; // eslint-disable-line\\n // nuke span, recombine text\\n }\\n\\n var fullText = el[textProp];\\n var words = spaces ? fullText.split(' ') : fullText; // If 0 or 1 words, we're done\\n\\n if (words.length < 2) continue; // Temporarily remove any CSS height for text height calculation\\n\\n var heightStyle = styles.height;\\n styles.height = 'auto';\\n var maxHeightStyle = styles.maxHeight;\\n styles.maxHeight = 'none'; // If already short enough, we're done\\n\\n if (el.offsetHeight <= maxHeight) {\\n styles.height = heightStyle;\\n styles.maxHeight = maxHeightStyle;\\n continue;\\n } // Binary search for number of words which can fit in allotted height\\n\\n\\n var max = words.length - 1;\\n var min = 0;\\n var pivot = void 0;\\n\\n while (min < max) {\\n pivot = min + max + 1 >> 1; // eslint-disable-line no-bitwise\\n\\n el[textProp] = spaces ? words.slice(0, pivot).join(' ') : words.slice(0, pivot);\\n el.insertAdjacentHTML('beforeend', charHtml);\\n if (el.offsetHeight > maxHeight) max = pivot - 1;else min = pivot;\\n }\\n\\n el[textProp] = spaces ? words.slice(0, max).join(' ') : words.slice(0, max);\\n el.insertAdjacentHTML('beforeend', charHtml);\\n var diff = spaces ? \\\" \\\".concat(words.slice(max).join(' ')) : words.slice(max);\\n var shavedText = document.createTextNode(diff);\\n var elWithShavedText = document.createElement('span');\\n elWithShavedText.classList.add(classname);\\n elWithShavedText.style.display = 'none';\\n elWithShavedText.appendChild(shavedText);\\n el.insertAdjacentElement('beforeend', elWithShavedText);\\n styles.height = heightStyle;\\n styles.maxHeight = maxHeightStyle;\\n }\\n}\",\n \"function shortWords(array) {\\n return array.filter(word => word.length < 5);\\n}\",\n \"function constrain(unsplit_str, front_half, back_half, ideal_width, className, element_width)\\n{\\n\\tvar text = unsplit_str;\\n var temp_item = ('<span class=\\\"'+className+'_hide\\\" style=\\\"display:none;\\\">'+ text +'</span>');\\n $(temp_item).appendTo('body');\\n var item_width = $('span.'+className+'_hide').width();\\n var ideal = parseInt(ideal_width);\\n var smaller_text = text;\\n var front_half1 = front_half;\\n var back_half1 = back_half;\\n\\n if (item_width>ideal_width)\\n {\\n while (item_width > ideal)\\n {\\n \\tfront_half1 = front_half1.substr(0, (front_half1.length-1));\\n \\tback_half1 = back_half1.substr(1);\\n smaller_text = front_half1 + \\\"..\\\" + back_half1;\\n $('.'+className+'_hide').html(smaller_text);\\n item_width = $('span.'+className+'_hide').width();\\n }\\n smaller_text = smaller_text;\\n return_text = smaller_text;\\n }\\n\\t$('span.'+className+'_hide').remove();\\n\\treturn(smaller_text);\\n}\",\n \"function retrieveWord(length, index) {\\n \\tif ((length >= minw) && (length <= maxw) &&\\n\\t (index >= 0) && (index < nwords[length])) {\\n\\t return cwords[length].substring(length * index, length * (index + 1));\\n\\t}\\n\\treturn \\\"\\\";\\n }\",\n \"function wordHax(str) {\\n \\n \\n \\n for (i = 0; i < strArray.length; i++) {\\n var strArray = str.split(\\\" \\\");\\n }\\n if (strArray[i].length > 3)\\n {\\n \\n strArray[i] = strArray[i](/a|e|i|o|u/gi, \\\"\\\");\\n \\n }\\n else\\n {\\n \\n x.toUpperCase();\\n \\n }\\n \\n }\",\n \"function wrapText(caption,maxChars){\\n\\tif (!maxChars) maxChars = 20;\\n\\n\\tvar words = caption.split(\\\" \\\");\\n\\tvar line = \\\"\\\";\\n\\n\\tvar wrap = new Array();\\n\\n\\tfor (var n = 0; n < words.length; n++) {\\n\\t\\tvar testLine = line + words[n] + \\\" \\\";\\n\\t\\tif (testLine.length > maxChars || words[n]==\\\"|\\\")\\n\\t\\t{\\n\\t\\t\\twrap.push(line);\\n\\n\\t\\t\\tif (words[n]==\\\"|\\\") words[n]=\\\"\\\";\\n\\n\\t\\t\\tline = words[n] + \\\" \\\";\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tline = testLine;\\n\\t\\t}\\n\\t}\\n\\twrap.push(line);\\n\\treturn wrap;\\n}\",\n \"function getOffensiveMaterialDeduction(text) {\\r\\n\\tvar maximumDeduction = commentMaxOffensiveWordDeduction; \\r\\n\\tvar offensiveWordCount = wordFilter.countOffensiveWords(text); \\r\\n\\treturn (offensiveWordCount > maximumDeduction) ? -maximumDeduction : -offensiveWordCount; \\r\\n}\",\n \"function filterLongWord(arr, i){\\n var q=[];\\n var k =0;\\n arr.map(function(p,c){\\n if(p.split('').length>i) q[k++]=p;\\n });\\n return q;\\n }\",\n \"function truncate(str, maxChars, append, onlyFullWords) {\\n append = append || \\\"...\\\";\\n maxChars = onlyFullWords ? maxChars + 1 : maxChars;\\n\\n str = trim(str);\\n if (str.length <= maxChars) {\\n return str;\\n }\\n str = str.substr(0, maxChars - append.length);\\n //crop at last space or remove trailing whitespace\\n str = onlyFullWords ? str.substr(0, str.lastIndexOf(\\\" \\\")) : trim(str);\\n return str + append;\\n}\",\n \"function wordsLongerThanThree(string) {\\n var words = string.split(\\\" \\\");\\n return filter(words, function(x) {\\n return (x.length > 3);\\n });\\n }\",\n \"function indexWord(index) {\\n \\tif ((index >= 0) && (index < twords)) {\\n\\t var j;\\n\\n\\t for (j = minw; j <= maxw; j++) {\\n\\t\\tif (index < nwords[j]) {\\n\\t\\t break;\\n\\t\\t}\\n\\t\\tindex -= nwords[j];\\n\\t }\\n\\t return retrieveWord(j, index);\\n\\t}\\n\\treturn \\\"\\\";\\n }\",\n \"function wordsLongerThanThree(str) {\\n var arr = str.split(\\\" \\\")\\n return filter(arr ,function(element, i){\\n return element.length > 3;\\n })\\n }\",\n \"async getWords(startWord='', maxLength=30) {}\",\n \"function wordsLongerThanThree (string) {\\n \\tvar words = string.split(\\\" \\\");\\n\\treturn filter (words, function (str) {\\n\\t\\treturn str.length > 3;\\n\\t})\\n}\",\n \"function big_word(array) {\\n var longest_words = '';\\n var current_words = '';\\n for (var i=0; i<array.length; i++) {\\n current_words = array[i];\\n if (current_words.length > longest_words.length) {\\n longest_words = current_words;\\n }\\n }\\n return longest_words;\\n}\",\n \"function createGoodness() {\\n\\n var numPhrases = 100\\n\\n //get starting word\\n var newShit = getNewWord()\\n \\n\\n //Save last word for key \\n var lastWord = newShit\\n \\n\\n for(var i = 0; i < numPhrases - 1; i++) {\\n\\n var newWord = \\\"\\\"\\n\\n if(words.has(lastWord)) {\\n newWord = words.get(lastWord).getWord()\\n }\\n else {\\n var newWord = getNewWord()\\n }\\n\\n newShit += \\\" \\\"\\n newShit += newWord\\n lastWord = newWord\\n \\n }\\n\\n //console.log(newShit)\\n document.getElementById(\\\"MarkovText\\\").innerHTML = newShit\\n\\n var longest = 0\\n words.forEach(item => {\\n if(item.getNumFollowers() > longest) {\\n longest = item.getNumFollowers() \\n }\\n })\\n\\n console.log(longest)\\n}\",\n \"function allowedCharLength(words){\\n\\n var base = 8 + 40*smoothstep(1, 100, words.length);\\n\\n var rando = random(0.8, 1.2);\\n\\n return abs(round(base*rando)) + 1; // absolute value of 80-120% of the baseline value (+1 so that it's never 0)\\n}\",\n \"function maxWord2(s) {\\n l=s.split(\\\" \\\");\\n return maxWord(l);\\n }\",\n \"function designerPdfViewer(h, word) {\\n return Math.max(...word.split('').map((e) => h[e.charCodeAt(0) - 97] * word.length));\\n}\",\n \"function LongestWord2(sen) { \\n\\n let result= sen\\n .replace(/[^a-z A-Z]/g, ' ')\\n .split(' ')\\n .reduce((a,b)=> b.length > a.length ? b : a, '');\\n return result;\\n \\n}\",\n \"function abbrevIfTextOverflow(id, index){\\n // need to replace this with text width funct\\n // if ( $('#'+id)[0].scrollWidth > $('#'+id).innerWidth()) {\\n // var file_text_elem = document.getElementById(id);\\n // text=file_text_elem.value;\\n // abbrevText(file_text_elem, text);\\n // // originalFileNames.values[index] = \\\"\\\\n\\\" + originalFileNames.values[index]; //mark that abbreviation was made with an illegal newline character in array of original names \\n // }\\n }\",\n \"function maxWordLength(previousWord, currentWord) {\\n if (currentWord.length > previousWord.length) {\\n return currentWord;\\n }\\n else {\\n return currentWord = previousWord;\\n }\\n}\",\n \"function longestWord(text) {\\n let wordArray = text.split(\\\" \\\");\\n let maxLength = 0;\\n let result = \\\"\\\";\\n\\n for (let i = 0; i < wordArray.length; i++) {\\n if (wordArray[i].length > maxLength) {\\n //We Check for length of wordArray[i] to see if its greater than maxLength\\n maxLength = wordWarray[i].length;\\n //If it is, we replace maxLength with this new value.\\n result = wordArray[i];\\n //Now result holds the longest word in the sentence\\n }\\n }\\n\\n return result;\\n //The is returned as such.\\n}\",\n \"function truncate(str, n, useWordBoundary) {\\n if (str.length <= n) {\\n return str;\\n }\\n\\n var subString = str.substr(0, n - 1);\\n return (useWordBoundary ? subString.substr(0, subString.lastIndexOf(\\\" \\\")) : subString) + \\\" ...\\\";\\n}\",\n \"function LongestWord(sen) {\\n var output;\\n var words = sen.split(' ');\\n var longWord = '';\\n for (var i = 0; i < words.length; i++) {\\n if (longWord.length < words[i].length) {\\n longWord = words[i];\\n }\\n }\\n return longWord\\n}\",\n \"function high(x){\\n var biggest = {\\n points: 0,\\n word: \\\"\\\",\\n };\\n x.split(\\\" \\\").forEach(currentWord => {\\n var totalPoints = 0;\\n currentWord.split(\\\"\\\").forEach((letter) => {\\n var points = letter.charCodeAt(0) - 96;\\n totalPoints += points;\\n });\\n if (totalPoints > biggest.points) {\\n biggest.points = totalPoints;\\n biggest.word = currentWord;\\n }\\n });\\n return biggest.word;\\n}\",\n \"function filterLongWords(arr, WrodLength) {\\n\\n // let arrOfLongWords = [];\\n // arr.forEach(function (item) {\\n // if (item.length > WrodLength) {\\n // arrOfLongWords.push(item);\\n // }\\n // });\\n // return arrOfLongWords;\\n \\n return arr.filter(str => str.length > WrodLength);\\n}\",\n \"function isNoLongerThan(word, length = 32) {\\n return word.length <= length;\\n}\",\n \"function BOT_extractWords() {\\r\\n\\tvar word, matchlist;\\r\\n\\tvar lemstring = BOT_lemString;\\r\\n\\tvar worldlist = [];\\r\\n\\tvar rex = new RegExp(\\\"< (\\\\\\\\w+) (.*)\\\");\\r\\n\\tfor(var i=0; i<BOT_maxExtractedWords; i++) { // Words extracted is limited\\r\\n\\t\\tif(lemstring.search(rex) != -1) {\\r\\n\\t\\t\\trex.lastIndex = 0;\\r\\n\\t\\t\\tmatchlist = rex.exec(lemstring);\\r\\n\\t\\t\\tword = BOT_englishWordCutPlural(matchlist[1]);\\r\\n\\t\\t\\tworldlist = worldlist.concat(word);\\r\\n\\t\\t\\tlemstring = \\\"< \\\"+matchlist[2];\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn worldlist;\\r\\n}\",\n \"function find_longest_word(str)\\n {\\n var array1 = str.match(/\\\\w[a-z]{0,}/gi);\\n var result = array1[0];\\n\\n for(var x = 1 ; x < array1.length ; x++)\\n {\\n if(result.length < array1[x].length)\\n {\\n result = array1[x];\\n }\\n }\\n return result;\\n }\",\n \"function findShort(s) {\\n let words = s.split(\\\" \\\");\\n let min = words[0].length;\\n for (i = 1; i < words.length; i++) {\\n if (words[i].length < min) {\\n min = words[i].length;\\n }\\n }\\n return min;\\n}\",\n \"function SmartTruncate(field,limit,width,nohover,ellipsis){\\n\\tif(!width)width=0;\\n\\tif(!ellipsis)ellipsis = \\\"...\\\";\\n\\t$('body').append('<div id=\\\"truncation\\\"></div>');\\n\\tvar truncBox = $('#truncation');\\n\\tvar truncStyles = [\\\"font-family\\\",\\\"font-weight\\\",\\\"font-size\\\",\\\"line-height\\\"];\\n\\t$(field).each(function(){\\n\\t\\tfor(var i in truncStyles){\\n\\t\\t\\ttruncBox.css(truncStyles[i],$(this).css(truncStyles[i]));\\n\\t\\t}\\n\\t\\ttruncBox.css(\\\"width\\\",(width==0) ? $(this).css(\\\"width\\\") : width+\\\"px\\\");\\n\\t\\tvar originalstring = $(this).html();\\n\\t\\tif(!nohover)$(this).attr(\\\"title\\\",originalstring.replace(\\\"&\\\",\\\"&\\\"));\\n\\t\\ttruncBox.html(originalstring);\\n\\t\\tif(truncBox.height() > limit){\\n\\t\\t\\tvar upperbound = originalstring.length;\\n\\t\\t\\tvar lowerbound = 0;\\n\\t\\t\\tvar checkpoint = Math.floor((upperbound+lowerbound)/2);\\n\\t\\t\\twhile((upperbound - lowerbound) > 1){\\n\\t\\t\\t\\ttruncBox.html(originalstring.substring(0,checkpoint)+ellipsis);\\n\\t\\t\\t\\tif(truncBox.height() > limit)\\n\\t\\t\\t\\t\\tupperbound = checkpoint;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tlowerbound = checkpoint;\\n\\t\\t\\t\\tcheckpoint = Math.floor((upperbound+lowerbound)/2);\\n\\t\\t\\t}\\n\\t\\t\\t$(this).html(originalstring.substring(0,lowerbound)+ellipsis);\\n\\t\\t}\\n\\t});\\n\\ttruncBox.remove();\\n}\",\n \"function shorten( $text, $length ) {\\n\\n // Skip if max length defined zero\\n if ( $length == '0' ) return $text;\\n\\n // Do the magic\\n var length = $length || 10;\\n if ( $text.length > length ) {\\n $text = $text.substring( 0, length ) + '…';\\n }\\n\\n return $text;\\n}\",\n \"function nonsenseWord() {\\n var word = chance.word({syllables: 3});\\n return word;\\n}\",\n \"function longText(ctx, text, x, y, maxWidth, lineHeight){\\n for(var p = 0; p < text.length; p++){\\n var words = text[p].split(' ');\\n var line = '';\\n for(var n = 0; n < words.length; n++) {\\n var testLine = line + words[n] + ' ';\\n var metrics = ctx.measureText(testLine);\\n var testWidth = metrics.width;\\n if (testWidth > maxWidth && n > 0) {\\n ctx.fillText(line, x, y);\\n line = words[n] + ' ';\\n y += lineHeight;\\n }\\n else {\\n line = testLine;\\n }\\n }\\n ctx.fillText(line, x, y);\\n y += (lineHeight*1.5);\\n }\\n }\",\n \"function designerPdfViewer(h, word) {\\r\\n const letterA = 97;\\r\\n\\r\\n function myArrayMax(arr) {\\r\\n var len = arr.length;\\r\\n var max = -Infinity;\\r\\n while (len--) {\\r\\n if (arr[len] > max) {\\r\\n max = arr[len];\\r\\n }\\r\\n }\\r\\n return max;\\r\\n }\\r\\n \\r\\n var letterHeights = [];\\r\\n var idx = 0;\\r\\n for (var i = 0; i < word.length; i++) {\\r\\n idx = word.charCodeAt(i) - letterA;\\r\\n letterHeights.push(h[idx]);\\r\\n }\\r\\n // console.log(`letterHeights: ${letterHeights}`);\\r\\n\\r\\n var maxHeight = myArrayMax(letterHeights);\\r\\n\\r\\n return maxHeight * word.length;\\r\\n}\",\n \"function LongestWord(sen) {\\n return sen.replace(/[^a-zA-Z ]/g;, '')\\n .split(' ')\\n .filter(String)\\n .reduce(function(longest, word) {\\n if (word.length > longest.length)\\n return word;\\n return longest;\\n }, '');\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6410447","0.62497896","0.6212312","0.61360306","0.6088829","0.602778","0.60098094","0.59800375","0.5962549","0.5930364","0.59274495","0.5911854","0.58764017","0.5866618","0.5858178","0.584635","0.5839283","0.58268946","0.58057034","0.58053905","0.5798745","0.57824147","0.57816875","0.5776916","0.57752526","0.57727414","0.5757305","0.5757305","0.5754111","0.5736226","0.5723161","0.56929266","0.56815463","0.5667277","0.5660588","0.5647895","0.5627645","0.5614753","0.56134605","0.5613009","0.559578","0.55940455","0.5589777","0.5588876","0.5588858","0.5582129","0.55787194","0.55761373","0.55736524","0.5570381","0.5569417","0.5567476","0.55632806","0.5558483","0.5553897","0.55538356","0.55489963","0.5543863","0.5539997","0.5537513","0.5505229","0.5504876","0.5491791","0.5490471","0.54903877","0.5469725","0.5466612","0.54654574","0.5462508","0.5455508","0.5455233","0.5452462","0.5452275","0.5451173","0.54500777","0.5436219","0.5433225","0.54324484","0.5425664","0.54171014","0.54155254","0.5415355","0.54098725","0.540607","0.53895897","0.53790027","0.53691345","0.53682107","0.53568536","0.53503865","0.5349067","0.534503","0.5343303","0.5334882","0.5331889","0.5331158","0.5316583","0.5311857","0.52988124","0.5287433","0.52861625"],"string":"[\n \"0.6410447\",\n \"0.62497896\",\n \"0.6212312\",\n \"0.61360306\",\n \"0.6088829\",\n \"0.602778\",\n \"0.60098094\",\n \"0.59800375\",\n \"0.5962549\",\n \"0.5930364\",\n \"0.59274495\",\n \"0.5911854\",\n \"0.58764017\",\n \"0.5866618\",\n \"0.5858178\",\n \"0.584635\",\n \"0.5839283\",\n \"0.58268946\",\n \"0.58057034\",\n \"0.58053905\",\n \"0.5798745\",\n \"0.57824147\",\n \"0.57816875\",\n \"0.5776916\",\n \"0.57752526\",\n \"0.57727414\",\n \"0.5757305\",\n \"0.5757305\",\n \"0.5754111\",\n \"0.5736226\",\n \"0.5723161\",\n \"0.56929266\",\n \"0.56815463\",\n \"0.5667277\",\n \"0.5660588\",\n \"0.5647895\",\n \"0.5627645\",\n \"0.5614753\",\n \"0.56134605\",\n \"0.5613009\",\n \"0.559578\",\n \"0.55940455\",\n \"0.5589777\",\n \"0.5588876\",\n \"0.5588858\",\n \"0.5582129\",\n \"0.55787194\",\n \"0.55761373\",\n \"0.55736524\",\n \"0.5570381\",\n \"0.5569417\",\n \"0.5567476\",\n \"0.55632806\",\n \"0.5558483\",\n \"0.5553897\",\n \"0.55538356\",\n \"0.55489963\",\n \"0.5543863\",\n \"0.5539997\",\n \"0.5537513\",\n \"0.5505229\",\n \"0.5504876\",\n \"0.5491791\",\n \"0.5490471\",\n \"0.54903877\",\n \"0.5469725\",\n \"0.5466612\",\n \"0.54654574\",\n \"0.5462508\",\n \"0.5455508\",\n \"0.5455233\",\n \"0.5452462\",\n \"0.5452275\",\n \"0.5451173\",\n \"0.54500777\",\n \"0.5436219\",\n \"0.5433225\",\n \"0.54324484\",\n \"0.5425664\",\n \"0.54171014\",\n \"0.54155254\",\n \"0.5415355\",\n \"0.54098725\",\n \"0.540607\",\n \"0.53895897\",\n \"0.53790027\",\n \"0.53691345\",\n \"0.53682107\",\n \"0.53568536\",\n \"0.53503865\",\n \"0.5349067\",\n \"0.534503\",\n \"0.5343303\",\n \"0.5334882\",\n \"0.5331889\",\n \"0.5331158\",\n \"0.5316583\",\n \"0.5311857\",\n \"0.52988124\",\n \"0.5287433\",\n \"0.52861625\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4695,"cells":{"query":{"kind":"string","value":"(public) return string representation in given radix"},"document":{"kind":"string","value":"function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\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 bigInt2StrHelper(bi, r) {\n return bi.toString(r);\n}","function arrayToString(arr,radix) {\n return Array.from(arr).map(c=>(c%radix).toString(radix)).join(\"\")\n}","toString() {\n let res = '';\n for (let i = this.digits.length - 1; i >= 0; i--) {\n res += this.digits[i];\n }\n return res;\n }","toString() {\n let res = '';\n for (let i = this.digits.length - 1; i >= 0; i--) {\n res += this.digits[i];\n }\n return res;\n }","function bnToString(b) {\n var self = this\n if (self.s < 0) return \"-\" + self.negate()\n .toString(b)\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else return self.toRadix(b)\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = self.t\n var p = self.DB - (i * self.DB) % k\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true\n r = int2char(d)\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & ((1 << p) - 1)) << (k - p)\n d |= self[--i] >> (p += self.DB - k)\n } else {\n d = (self[i] >> (p -= k)) & km\n if (p <= 0) {\n p += self.DB\n --i\n }\n }\n if (d > 0) m = true\n if (m) r += int2char(d)\n }\n }\n return m ? r : \"0\"\n}","function bnToString(b) {\n var self = this\n if (self.s < 0) return \"-\" + self.negate()\n .toString(b)\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else return self.toRadix(b)\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = self.t\n var p = self.DB - (i * self.DB) % k\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true\n r = int2char(d)\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & ((1 << p) - 1)) << (k - p)\n d |= self[--i] >> (p += self.DB - k)\n } else {\n d = (self[i] >> (p -= k)) & km\n if (p <= 0) {\n p += self.DB\n --i\n }\n }\n if (d > 0) m = true\n if (m) r += int2char(d)\n }\n }\n return m ? r : \"0\"\n}","function bnToString(b) {\n var self = this\n if (self.s < 0) return \"-\" + self.negate()\n .toString(b)\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else return self.toRadix(b)\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = self.t\n var p = self.DB - (i * self.DB) % k\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true\n r = int2char(d)\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & ((1 << p) - 1)) << (k - p)\n d |= self[--i] >> (p += self.DB - k)\n } else {\n d = (self[i] >> (p -= k)) & km\n if (p <= 0) {\n p += self.DB\n --i\n }\n }\n if (d > 0) m = true\n if (m) r += int2char(d)\n }\n }\n return m ? r : \"0\"\n}","function bnToString(b) {\n var self = this\n if (self.s < 0) return \"-\" + self.negate()\n .toString(b)\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else return self.toRadix(b)\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = self.t\n var p = self.DB - (i * self.DB) % k\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true\n r = int2char(d)\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & ((1 << p) - 1)) << (k - p)\n d |= self[--i] >> (p += self.DB - k)\n } else {\n d = (self[i] >> (p -= k)) & km\n if (p <= 0) {\n p += self.DB\n --i\n }\n }\n if (d > 0) m = true\n if (m) r += int2char(d)\n }\n }\n return m ? r : \"0\"\n}","function bnToString(b) {\n var self = this\n if (self.s < 0) return \"-\" + self.negate()\n .toString(b)\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else return self.toRadix(b)\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = self.t\n var p = self.DB - (i * self.DB) % k\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true\n r = int2char(d)\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & ((1 << p) - 1)) << (k - p)\n d |= self[--i] >> (p += self.DB - k)\n } else {\n d = (self[i] >> (p -= k)) & km\n if (p <= 0) {\n p += self.DB\n --i\n }\n }\n if (d > 0) m = true\n if (m) r += int2char(d)\n }\n }\n return m ? r : \"0\"\n}","function bnToString(b) {\n var self = this\n if (self.s < 0) return \"-\" + self.negate()\n .toString(b)\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else return self.toRadix(b)\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = self.t\n var p = self.DB - (i * self.DB) % k\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true\n r = int2char(d)\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & ((1 << p) - 1)) << (k - p)\n d |= self[--i] >> (p += self.DB - k)\n } else {\n d = (self[i] >> (p -= k)) & km\n if (p <= 0) {\n p += self.DB\n --i\n }\n }\n if (d > 0) m = true\n if (m) r += int2char(d)\n }\n }\n return m ? r : \"0\"\n}","function bnToString(b) {\n var self = this\n if (self.s < 0) return \"-\" + self.negate()\n .toString(b)\n var k\n if (b == 16) k = 4\n else if (b == 8) k = 3\n else if (b == 2) k = 1\n else if (b == 32) k = 5\n else if (b == 4) k = 2\n else return self.toRadix(b)\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = self.t\n var p = self.DB - (i * self.DB) % k\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true\n r = int2char(d)\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & ((1 << p) - 1)) << (k - p)\n d |= self[--i] >> (p += self.DB - k)\n } else {\n d = (self[i] >> (p -= k)) & km\n if (p <= 0) {\n p += self.DB\n --i\n }\n }\n if (d > 0) m = true\n if (m) r += int2char(d)\n }\n }\n return m ? r : \"0\"\n}","_getRadix(radix) {\n switch (radix.toString()) {\n case '10':\n case 'decimal':\n return 10;\n case '2':\n case 'binary':\n return 2;\n case '8':\n case 'octal':\n return 8;\n case '16':\n case 'hexadecimal':\n return 16;\n }\n }","function bnToString(b) {\n\t var self = this\n\t if (self.s < 0) return \"-\" + self.negate()\n\t .toString(b)\n\t var k\n\t if (b == 16) k = 4\n\t else if (b == 8) k = 3\n\t else if (b == 2) k = 1\n\t else if (b == 32) k = 5\n\t else if (b == 4) k = 2\n\t else return self.toRadix(b)\n\t var km = (1 << k) - 1,\n\t d, m = false,\n\t r = \"\",\n\t i = self.t\n\t var p = self.DB - (i * self.DB) % k\n\t if (i-- > 0) {\n\t if (p < self.DB && (d = self[i] >> p) > 0) {\n\t m = true\n\t r = int2char(d)\n\t }\n\t while (i >= 0) {\n\t if (p < k) {\n\t d = (self[i] & ((1 << p) - 1)) << (k - p)\n\t d |= self[--i] >> (p += self.DB - k)\n\t } else {\n\t d = (self[i] >> (p -= k)) & km\n\t if (p <= 0) {\n\t p += self.DB\n\t --i\n\t }\n\t }\n\t if (d > 0) m = true\n\t if (m) r += int2char(d)\n\t }\n\t }\n\t return m ? r : \"0\"\n\t}","function bnToString(b) {\n\t var self = this\n\t if (self.s < 0) return \"-\" + self.negate()\n\t .toString(b)\n\t var k\n\t if (b == 16) k = 4\n\t else if (b == 8) k = 3\n\t else if (b == 2) k = 1\n\t else if (b == 32) k = 5\n\t else if (b == 4) k = 2\n\t else return self.toRadix(b)\n\t var km = (1 << k) - 1,\n\t d, m = false,\n\t r = \"\",\n\t i = self.t\n\t var p = self.DB - (i * self.DB) % k\n\t if (i-- > 0) {\n\t if (p < self.DB && (d = self[i] >> p) > 0) {\n\t m = true\n\t r = int2char(d)\n\t }\n\t while (i >= 0) {\n\t if (p < k) {\n\t d = (self[i] & ((1 << p) - 1)) << (k - p)\n\t d |= self[--i] >> (p += self.DB - k)\n\t } else {\n\t d = (self[i] >> (p -= k)) & km\n\t if (p <= 0) {\n\t p += self.DB\n\t --i\n\t }\n\t }\n\t if (d > 0) m = true\n\t if (m) r += int2char(d)\n\t }\n\t }\n\t return m ? r : \"0\"\n\t}","function bnToString(b) {\n var self = this;\n if (self.s < 0) return \"-\" + self.negate().toString(b);\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return self.toRadix(b);\n var km = (1 << k) - 1,\n d,\n m = false,\n r = \"\",\n i = self.t;\n var p = self.DB - i * self.DB % k;\n if (i-- > 0) {\n if (p < self.DB && (d = self[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (self[i] & (1 << p) - 1) << k - p;\n d |= self[--i] >> (p += self.DB - k);\n } else {\n d = self[i] >> (p -= k) & km;\n if (p <= 0) {\n p += self.DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n}","function bnToString(b) {\n\t if(this.s < 0) return \"-\"+this.negate().toString(b);\n\t var k;\n\t if(b == 16) k = 4;\n\t else if(b == 8) k = 3;\n\t else if(b == 2) k = 1;\n\t else if(b == 32) k = 5;\n\t else if(b == 4) k = 2;\n\t else return this.toRadix(b);\n\t var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n\t var p = this.DB-(i*this.DB)%k;\n\t if(i-- > 0) {\n\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n\t while(i >= 0) {\n\t if(p < k) {\n\t d = (this[i]&((1<<p)-1))<<(k-p);\n\t d |= this[--i]>>(p+=this.DB-k);\n\t }\n\t else {\n\t d = (this[i]>>(p-=k))&km;\n\t if(p <= 0) { p += this.DB; --i; }\n\t }\n\t if(d > 0) m = true;\n\t if(m) r += int2char(d);\n\t }\n\t }\n\t return m?r:\"0\";\n\t }","function bnToString(b) {\n\t if(this.s < 0) return \"-\"+this.negate().toString(b);\n\t var k;\n\t if(b == 16) k = 4;\n\t else if(b == 8) k = 3;\n\t else if(b == 2) k = 1;\n\t else if(b == 32) k = 5;\n\t else if(b == 4) k = 2;\n\t else return this.toRadix(b);\n\t var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n\t var p = this.DB-(i*this.DB)%k;\n\t if(i-- > 0) {\n\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n\t while(i >= 0) {\n\t if(p < k) {\n\t d = (this[i]&((1<<p)-1))<<(k-p);\n\t d |= this[--i]>>(p+=this.DB-k);\n\t }\n\t else {\n\t d = (this[i]>>(p-=k))&km;\n\t if(p <= 0) { p += this.DB; --i; }\n\t }\n\t if(d > 0) m = true;\n\t if(m) r += int2char(d);\n\t }\n\t }\n\t return m?r:\"0\";\n\t }","function bnToString(b) {\n\t if(this.s < 0) return \"-\"+this.negate().toString(b);\n\t var k;\n\t if(b == 16) k = 4;\n\t else if(b == 8) k = 3;\n\t else if(b == 2) k = 1;\n\t else if(b == 32) k = 5;\n\t else if(b == 4) k = 2;\n\t else return this.toRadix(b);\n\t var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n\t var p = this.DB-(i*this.DB)%k;\n\t if(i-- > 0) {\n\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n\t while(i >= 0) {\n\t if(p < k) {\n\t d = (this[i]&((1<<p)-1))<<(k-p);\n\t d |= this[--i]>>(p+=this.DB-k);\n\t }\n\t else {\n\t d = (this[i]>>(p-=k))&km;\n\t if(p <= 0) { p += this.DB; --i; }\n\t }\n\t if(d > 0) m = true;\n\t if(m) r += int2char(d);\n\t }\n\t }\n\t return m?r:\"0\";\n\t }","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0) {\n p += this.DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b);\n var km = (1 << k) - 1,\n d,\n m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - i * this.DB % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & (1 << p) - 1) << k - p;\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = this[i] >> (p -= k) & km;\n if (p <= 0) {\n p += this.DB;--i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b);\n var km = (1 << k) - 1,\n d,\n m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - i * this.DB % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & (1 << p) - 1) << k - p;\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = this[i] >> (p -= k) & km;\n if (p <= 0) {\n p += this.DB;--i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b);\n var km = (1 << k) - 1,\n d,\n m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - i * this.DB % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & (1 << p) - 1) << k - p;\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = this[i] >> (p -= k) & km;\n if (p <= 0) {\n p += this.DB;--i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) { m = true;\n r = int2char(d); }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0) { p += this.DB;--i; }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }","function bnToString(b) {\n\t if(this.s < 0) return \"-\"+this.negate().toString(b);\n\t var k;\n\t if(b == 16) k = 4;\n\t else if(b == 8) k = 3;\n\t else if(b == 2) k = 1;\n\t else if(b == 32) k = 5;\n\t else if(b == 4) k = 2;\n\t else return this._toRadix(b);\n\t var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n\t var p = this._DB-(i*this._DB)%k;\n\t if(i-- > 0) {\n\t\tif(p < this._DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n\t\twhile(i >= 0) {\n\t\t if(p < k) {\n\t\t\td = (this[i]&((1<<p)-1))<<(k-p);\n\t\t\td |= this[--i]>>(p+=this._DB-k);\n\t\t }\n\t\t else {\n\t\t\td = (this[i]>>(p-=k))&km;\n\t\t\tif(p <= 0) { p += this._DB; --i; }\n\t\t }\n\t\t if(d > 0) m = true;\n\t\t if(m) r += int2char(d);\n\t\t}\n\t }\n\t return m?r:\"0\";\n\t}","function bnToString(b) {\n if (this.s < 0) return '-' + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1,\n d,\n m = false,\n r = '',\n i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0) {\n p += this.DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : '0';\n}","function myString (num) {\nreturn num.toString();\n}","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1, d, m = false, r = \"\", i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n }\n else {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0) {\n p += this.DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n}","function bnToString(b) {\r\n\t if (this.s < 0) return \"-\" + this.negate().toString(b);\r\n\t var k;\r\n\t if (b == 16) k = 4;\r\n\t else if (b == 8) k = 3;\r\n\t else if (b == 2) k = 1;\r\n\t else if (b == 32) k = 5;\r\n\t else if (b == 4) k = 2;\r\n\t else return this.toRadix(b);\r\n\t var km = (1 << k) - 1, d, m = false, r = \"\", i = this.t;\r\n\t var p = this.DB - (i * this.DB) % k;\r\n\t if (i-- > 0) {\r\n\t if (p < this.DB && (d = this[i] >> p) > 0) {\r\n\t m = true;\r\n\t r = int2char(d);\r\n\t }\r\n\t while (i >= 0) {\r\n\t if (p < k) {\r\n\t d = (this[i] & ((1 << p) - 1)) << (k - p);\r\n\t d |= this[--i] >> (p += this.DB - k);\r\n\t }\r\n\t else {\r\n\t d = (this[i] >> (p -= k)) & km;\r\n\t if (p <= 0) {\r\n\t p += this.DB;\r\n\t --i;\r\n\t }\r\n\t }\r\n\t if (d > 0) m = true;\r\n\t if (m) r += int2char(d);\r\n\t }\r\n\t }\r\n\t return m ? r : \"0\";\r\n\t}","function bnToString(b) {\r\n\t if (this.s < 0) return \"-\" + this.negate().toString(b);\r\n\t var k;\r\n\t if (b == 16) k = 4;\r\n\t else if (b == 8) k = 3;\r\n\t else if (b == 2) k = 1;\r\n\t else if (b == 32) k = 5;\r\n\t else if (b == 4) k = 2;\r\n\t else return this.toRadix(b);\r\n\t var km = (1 << k) - 1, d, m = false, r = \"\", i = this.t;\r\n\t var p = this.DB - (i * this.DB) % k;\r\n\t if (i-- > 0) {\r\n\t if (p < this.DB && (d = this[i] >> p) > 0) {\r\n\t m = true;\r\n\t r = int2char(d);\r\n\t }\r\n\t while (i >= 0) {\r\n\t if (p < k) {\r\n\t d = (this[i] & ((1 << p) - 1)) << (k - p);\r\n\t d |= this[--i] >> (p += this.DB - k);\r\n\t }\r\n\t else {\r\n\t d = (this[i] >> (p -= k)) & km;\r\n\t if (p <= 0) {\r\n\t p += this.DB;\r\n\t --i;\r\n\t }\r\n\t }\r\n\t if (d > 0) m = true;\r\n\t if (m) r += int2char(d);\r\n\t }\r\n\t }\r\n\t return m ? r : \"0\";\r\n\t}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this[i]&((1<<p)-1))<<(k-p);\n d |= this[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n }","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0) {\n p += this.DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }","function bnToString(b) {\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0) {\n if (p < this.DB && (d = this[i] >> p) > 0) {\n m = true;\n r = int2char(d);\n }\n while (i >= 0) {\n if (p < k) {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n } else {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0) {\n p += this.DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n }","function bnToString(b)\n{\n if (this.s < 0) return \"-\" + this.negate().toString(b);\n var k;\n if (b == 16) k = 4;\n else if (b == 8) k = 3;\n else if (b == 2) k = 1;\n else if (b == 32) k = 5;\n else if (b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1 << k) - 1,\n d, m = false,\n r = \"\",\n i = this.t;\n var p = this.DB - (i * this.DB) % k;\n if (i-- > 0)\n {\n if (p < this.DB && (d = this[i] >> p) > 0)\n {\n m = true;\n r = int2char(d);\n }\n while (i >= 0)\n {\n if (p < k)\n {\n d = (this[i] & ((1 << p) - 1)) << (k - p);\n d |= this[--i] >> (p += this.DB - k);\n }\n else\n {\n d = (this[i] >> (p -= k)) & km;\n if (p <= 0)\n {\n p += this.DB;\n --i;\n }\n }\n if (d > 0) m = true;\n if (m) r += int2char(d);\n }\n }\n return m ? r : \"0\";\n}","function bnToString(b) {\n\t if(this.s < 0) return \"-\"+this.negate().toString(b);\n\t var k;\n\t if(b == 16) k = 4;\n\t else if(b == 8) k = 3;\n\t else if(b == 2) k = 1;\n\t else if(b == 32) k = 5;\n\t else if(b == 4) k = 2;\n\t else return this.toRadix(b);\n\t var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n\t var p = this.DB-(i*this.DB)%k;\n\t if(i-- > 0) {\n\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n\t while(i >= 0) {\n\t if(p < k) {\n\t d = (this[i]&((1<<p)-1))<<(k-p);\n\t d |= this[--i]>>(p+=this.DB-k);\n\t }\n\t else {\n\t d = (this[i]>>(p-=k))&km;\n\t if(p <= 0) { p += this.DB; --i; }\n\t }\n\t if(d > 0) m = true;\n\t if(m) r += int2char(d);\n\t }\n\t }\n\t return m?r:\"0\";\n\t}","function bnToString(b) {\n\tif(this.s < 0) return \"-\"+this.negate().toString(b);\n\tvar k;\n\tif(b == 16) k = 4;\n\telse if(b == 8) k = 3;\n\telse if(b == 2) k = 1;\n\telse if(b == 32) k = 5;\n\telse if(b == 4) k = 2;\n\telse return this.toRadix(b);\n\tvar km = (1<<k)-1, d, m = false, r = [], i = this.t;\n\tvar p = this.DB-(i*this.DB)%k;\n\tif(i-- > 0) {\n\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r.push(int2char(d)); }\n\t while(i >= 0) {\n\t\tif(p < k) {\n\t\t d = (this[i]&((1<<p)-1))<<(k-p);\n\t\t d |= this[--i]>>(p+=this.DB-k);\n\t\t}\n\t\telse {\n\t\t d = (this[i]>>(p-=k))&km;\n\t\t if(p <= 0) { p += this.DB; --i; }\n\t\t}\n\t\tif(d > 0) m = true;\n\t\tif(m) r.push(int2char(d));\n\t }\n\t}\n\treturn m?r.join(\"\"):\"0\";\n }","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n } else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n } else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n } else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n } else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n } else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n } else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n } else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}","function bnToString(b) {\n\t if(this.s < 0) return \"-\"+this.negate().toString(b);\n\t var k;\n\t if(b == 16) k = 4;\n\t else if(b == 8) k = 3;\n\t else if(b == 2) k = 1;\n\t else if(b == 32) k = 5;\n\t else if(b == 4) k = 2;\n\t else return this.toRadix(b);\n\t var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n\t var p = this.DB-(i*this.DB)%k;\n\t if(i-- > 0) {\n\t if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n\t while(i >= 0) {\n\t if(p < k) {\n\t d = (this.data[i]&((1<<p)-1))<<(k-p);\n\t d |= this.data[--i]>>(p+=this.DB-k);\n\t } else {\n\t d = (this.data[i]>>(p-=k))&km;\n\t if(p <= 0) { p += this.DB; --i; }\n\t }\n\t if(d > 0) m = true;\n\t if(m) r += int2char(d);\n\t }\n\t }\n\t return m?r:\"0\";\n\t}","function bnToString(b) {\n if(this.s < 0) return \"-\"+this.negate().toString(b);\n var k;\n if(b == 16) k = 4;\n else if(b == 8) k = 3;\n else if(b == 2) k = 1;\n else if(b == 32) k = 5;\n else if(b == 4) k = 2;\n else return this.toRadix(b);\n var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n var p = this.DB-(i*this.DB)%k;\n if(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n while(i >= 0) {\n if(p < k) {\n d = (this.data[i]&((1<<p)-1))<<(k-p);\n d |= this.data[--i]>>(p+=this.DB-k);\n }\n else {\n d = (this.data[i]>>(p-=k))&km;\n if(p <= 0) { p += this.DB; --i; }\n }\n if(d > 0) m = true;\n if(m) r += int2char(d);\n }\n }\n return m?r:\"0\";\n}"],"string":"[\n \"function bigInt2StrHelper(bi, r) {\\n return bi.toString(r);\\n}\",\n \"function arrayToString(arr,radix) {\\n return Array.from(arr).map(c=>(c%radix).toString(radix)).join(\\\"\\\")\\n}\",\n \"toString() {\\n let res = '';\\n for (let i = this.digits.length - 1; i >= 0; i--) {\\n res += this.digits[i];\\n }\\n return res;\\n }\",\n \"toString() {\\n let res = '';\\n for (let i = this.digits.length - 1; i >= 0; i--) {\\n res += this.digits[i];\\n }\\n return res;\\n }\",\n \"function bnToString(b) {\\n var self = this\\n if (self.s < 0) return \\\"-\\\" + self.negate()\\n .toString(b)\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else return self.toRadix(b)\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = self.t\\n var p = self.DB - (i * self.DB) % k\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true\\n r = int2char(d)\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & ((1 << p) - 1)) << (k - p)\\n d |= self[--i] >> (p += self.DB - k)\\n } else {\\n d = (self[i] >> (p -= k)) & km\\n if (p <= 0) {\\n p += self.DB\\n --i\\n }\\n }\\n if (d > 0) m = true\\n if (m) r += int2char(d)\\n }\\n }\\n return m ? r : \\\"0\\\"\\n}\",\n \"function bnToString(b) {\\n var self = this\\n if (self.s < 0) return \\\"-\\\" + self.negate()\\n .toString(b)\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else return self.toRadix(b)\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = self.t\\n var p = self.DB - (i * self.DB) % k\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true\\n r = int2char(d)\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & ((1 << p) - 1)) << (k - p)\\n d |= self[--i] >> (p += self.DB - k)\\n } else {\\n d = (self[i] >> (p -= k)) & km\\n if (p <= 0) {\\n p += self.DB\\n --i\\n }\\n }\\n if (d > 0) m = true\\n if (m) r += int2char(d)\\n }\\n }\\n return m ? r : \\\"0\\\"\\n}\",\n \"function bnToString(b) {\\n var self = this\\n if (self.s < 0) return \\\"-\\\" + self.negate()\\n .toString(b)\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else return self.toRadix(b)\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = self.t\\n var p = self.DB - (i * self.DB) % k\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true\\n r = int2char(d)\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & ((1 << p) - 1)) << (k - p)\\n d |= self[--i] >> (p += self.DB - k)\\n } else {\\n d = (self[i] >> (p -= k)) & km\\n if (p <= 0) {\\n p += self.DB\\n --i\\n }\\n }\\n if (d > 0) m = true\\n if (m) r += int2char(d)\\n }\\n }\\n return m ? r : \\\"0\\\"\\n}\",\n \"function bnToString(b) {\\n var self = this\\n if (self.s < 0) return \\\"-\\\" + self.negate()\\n .toString(b)\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else return self.toRadix(b)\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = self.t\\n var p = self.DB - (i * self.DB) % k\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true\\n r = int2char(d)\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & ((1 << p) - 1)) << (k - p)\\n d |= self[--i] >> (p += self.DB - k)\\n } else {\\n d = (self[i] >> (p -= k)) & km\\n if (p <= 0) {\\n p += self.DB\\n --i\\n }\\n }\\n if (d > 0) m = true\\n if (m) r += int2char(d)\\n }\\n }\\n return m ? r : \\\"0\\\"\\n}\",\n \"function bnToString(b) {\\n var self = this\\n if (self.s < 0) return \\\"-\\\" + self.negate()\\n .toString(b)\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else return self.toRadix(b)\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = self.t\\n var p = self.DB - (i * self.DB) % k\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true\\n r = int2char(d)\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & ((1 << p) - 1)) << (k - p)\\n d |= self[--i] >> (p += self.DB - k)\\n } else {\\n d = (self[i] >> (p -= k)) & km\\n if (p <= 0) {\\n p += self.DB\\n --i\\n }\\n }\\n if (d > 0) m = true\\n if (m) r += int2char(d)\\n }\\n }\\n return m ? r : \\\"0\\\"\\n}\",\n \"function bnToString(b) {\\n var self = this\\n if (self.s < 0) return \\\"-\\\" + self.negate()\\n .toString(b)\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else return self.toRadix(b)\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = self.t\\n var p = self.DB - (i * self.DB) % k\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true\\n r = int2char(d)\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & ((1 << p) - 1)) << (k - p)\\n d |= self[--i] >> (p += self.DB - k)\\n } else {\\n d = (self[i] >> (p -= k)) & km\\n if (p <= 0) {\\n p += self.DB\\n --i\\n }\\n }\\n if (d > 0) m = true\\n if (m) r += int2char(d)\\n }\\n }\\n return m ? r : \\\"0\\\"\\n}\",\n \"function bnToString(b) {\\n var self = this\\n if (self.s < 0) return \\\"-\\\" + self.negate()\\n .toString(b)\\n var k\\n if (b == 16) k = 4\\n else if (b == 8) k = 3\\n else if (b == 2) k = 1\\n else if (b == 32) k = 5\\n else if (b == 4) k = 2\\n else return self.toRadix(b)\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = self.t\\n var p = self.DB - (i * self.DB) % k\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true\\n r = int2char(d)\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & ((1 << p) - 1)) << (k - p)\\n d |= self[--i] >> (p += self.DB - k)\\n } else {\\n d = (self[i] >> (p -= k)) & km\\n if (p <= 0) {\\n p += self.DB\\n --i\\n }\\n }\\n if (d > 0) m = true\\n if (m) r += int2char(d)\\n }\\n }\\n return m ? r : \\\"0\\\"\\n}\",\n \"_getRadix(radix) {\\n switch (radix.toString()) {\\n case '10':\\n case 'decimal':\\n return 10;\\n case '2':\\n case 'binary':\\n return 2;\\n case '8':\\n case 'octal':\\n return 8;\\n case '16':\\n case 'hexadecimal':\\n return 16;\\n }\\n }\",\n \"function bnToString(b) {\\n\\t var self = this\\n\\t if (self.s < 0) return \\\"-\\\" + self.negate()\\n\\t .toString(b)\\n\\t var k\\n\\t if (b == 16) k = 4\\n\\t else if (b == 8) k = 3\\n\\t else if (b == 2) k = 1\\n\\t else if (b == 32) k = 5\\n\\t else if (b == 4) k = 2\\n\\t else return self.toRadix(b)\\n\\t var km = (1 << k) - 1,\\n\\t d, m = false,\\n\\t r = \\\"\\\",\\n\\t i = self.t\\n\\t var p = self.DB - (i * self.DB) % k\\n\\t if (i-- > 0) {\\n\\t if (p < self.DB && (d = self[i] >> p) > 0) {\\n\\t m = true\\n\\t r = int2char(d)\\n\\t }\\n\\t while (i >= 0) {\\n\\t if (p < k) {\\n\\t d = (self[i] & ((1 << p) - 1)) << (k - p)\\n\\t d |= self[--i] >> (p += self.DB - k)\\n\\t } else {\\n\\t d = (self[i] >> (p -= k)) & km\\n\\t if (p <= 0) {\\n\\t p += self.DB\\n\\t --i\\n\\t }\\n\\t }\\n\\t if (d > 0) m = true\\n\\t if (m) r += int2char(d)\\n\\t }\\n\\t }\\n\\t return m ? r : \\\"0\\\"\\n\\t}\",\n \"function bnToString(b) {\\n\\t var self = this\\n\\t if (self.s < 0) return \\\"-\\\" + self.negate()\\n\\t .toString(b)\\n\\t var k\\n\\t if (b == 16) k = 4\\n\\t else if (b == 8) k = 3\\n\\t else if (b == 2) k = 1\\n\\t else if (b == 32) k = 5\\n\\t else if (b == 4) k = 2\\n\\t else return self.toRadix(b)\\n\\t var km = (1 << k) - 1,\\n\\t d, m = false,\\n\\t r = \\\"\\\",\\n\\t i = self.t\\n\\t var p = self.DB - (i * self.DB) % k\\n\\t if (i-- > 0) {\\n\\t if (p < self.DB && (d = self[i] >> p) > 0) {\\n\\t m = true\\n\\t r = int2char(d)\\n\\t }\\n\\t while (i >= 0) {\\n\\t if (p < k) {\\n\\t d = (self[i] & ((1 << p) - 1)) << (k - p)\\n\\t d |= self[--i] >> (p += self.DB - k)\\n\\t } else {\\n\\t d = (self[i] >> (p -= k)) & km\\n\\t if (p <= 0) {\\n\\t p += self.DB\\n\\t --i\\n\\t }\\n\\t }\\n\\t if (d > 0) m = true\\n\\t if (m) r += int2char(d)\\n\\t }\\n\\t }\\n\\t return m ? r : \\\"0\\\"\\n\\t}\",\n \"function bnToString(b) {\\n var self = this;\\n if (self.s < 0) return \\\"-\\\" + self.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return self.toRadix(b);\\n var km = (1 << k) - 1,\\n d,\\n m = false,\\n r = \\\"\\\",\\n i = self.t;\\n var p = self.DB - i * self.DB % k;\\n if (i-- > 0) {\\n if (p < self.DB && (d = self[i] >> p) > 0) {\\n m = true;\\n r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (self[i] & (1 << p) - 1) << k - p;\\n d |= self[--i] >> (p += self.DB - k);\\n } else {\\n d = self[i] >> (p -= k) & km;\\n if (p <= 0) {\\n p += self.DB;\\n --i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n\\t if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n\\t var k;\\n\\t if(b == 16) k = 4;\\n\\t else if(b == 8) k = 3;\\n\\t else if(b == 2) k = 1;\\n\\t else if(b == 32) k = 5;\\n\\t else if(b == 4) k = 2;\\n\\t else return this.toRadix(b);\\n\\t var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n\\t var p = this.DB-(i*this.DB)%k;\\n\\t if(i-- > 0) {\\n\\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n\\t while(i >= 0) {\\n\\t if(p < k) {\\n\\t d = (this[i]&((1<<p)-1))<<(k-p);\\n\\t d |= this[--i]>>(p+=this.DB-k);\\n\\t }\\n\\t else {\\n\\t d = (this[i]>>(p-=k))&km;\\n\\t if(p <= 0) { p += this.DB; --i; }\\n\\t }\\n\\t if(d > 0) m = true;\\n\\t if(m) r += int2char(d);\\n\\t }\\n\\t }\\n\\t return m?r:\\\"0\\\";\\n\\t }\",\n \"function bnToString(b) {\\n\\t if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n\\t var k;\\n\\t if(b == 16) k = 4;\\n\\t else if(b == 8) k = 3;\\n\\t else if(b == 2) k = 1;\\n\\t else if(b == 32) k = 5;\\n\\t else if(b == 4) k = 2;\\n\\t else return this.toRadix(b);\\n\\t var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n\\t var p = this.DB-(i*this.DB)%k;\\n\\t if(i-- > 0) {\\n\\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n\\t while(i >= 0) {\\n\\t if(p < k) {\\n\\t d = (this[i]&((1<<p)-1))<<(k-p);\\n\\t d |= this[--i]>>(p+=this.DB-k);\\n\\t }\\n\\t else {\\n\\t d = (this[i]>>(p-=k))&km;\\n\\t if(p <= 0) { p += this.DB; --i; }\\n\\t }\\n\\t if(d > 0) m = true;\\n\\t if(m) r += int2char(d);\\n\\t }\\n\\t }\\n\\t return m?r:\\\"0\\\";\\n\\t }\",\n \"function bnToString(b) {\\n\\t if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n\\t var k;\\n\\t if(b == 16) k = 4;\\n\\t else if(b == 8) k = 3;\\n\\t else if(b == 2) k = 1;\\n\\t else if(b == 32) k = 5;\\n\\t else if(b == 4) k = 2;\\n\\t else return this.toRadix(b);\\n\\t var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n\\t var p = this.DB-(i*this.DB)%k;\\n\\t if(i-- > 0) {\\n\\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n\\t while(i >= 0) {\\n\\t if(p < k) {\\n\\t d = (this[i]&((1<<p)-1))<<(k-p);\\n\\t d |= this[--i]>>(p+=this.DB-k);\\n\\t }\\n\\t else {\\n\\t d = (this[i]>>(p-=k))&km;\\n\\t if(p <= 0) { p += this.DB; --i; }\\n\\t }\\n\\t if(d > 0) m = true;\\n\\t if(m) r += int2char(d);\\n\\t }\\n\\t }\\n\\t return m?r:\\\"0\\\";\\n\\t }\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - (i * this.DB) % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;\\n r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & ((1 << p) - 1)) << (k - p);\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = (this[i] >> (p -= k)) & km;\\n if (p <= 0) {\\n p += this.DB;\\n --i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d,\\n m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - i * this.DB % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & (1 << p) - 1) << k - p;\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = this[i] >> (p -= k) & km;\\n if (p <= 0) {\\n p += this.DB;--i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d,\\n m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - i * this.DB % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & (1 << p) - 1) << k - p;\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = this[i] >> (p -= k) & km;\\n if (p <= 0) {\\n p += this.DB;--i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d,\\n m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - i * this.DB % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & (1 << p) - 1) << k - p;\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = this[i] >> (p -= k) & km;\\n if (p <= 0) {\\n p += this.DB;--i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - (i * this.DB) % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) { m = true;\\n r = int2char(d); }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & ((1 << p) - 1)) << (k - p);\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = (this[i] >> (p -= k)) & km;\\n if (p <= 0) { p += this.DB;--i; }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n\\t if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n\\t var k;\\n\\t if(b == 16) k = 4;\\n\\t else if(b == 8) k = 3;\\n\\t else if(b == 2) k = 1;\\n\\t else if(b == 32) k = 5;\\n\\t else if(b == 4) k = 2;\\n\\t else return this._toRadix(b);\\n\\t var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n\\t var p = this._DB-(i*this._DB)%k;\\n\\t if(i-- > 0) {\\n\\t\\tif(p < this._DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n\\t\\twhile(i >= 0) {\\n\\t\\t if(p < k) {\\n\\t\\t\\td = (this[i]&((1<<p)-1))<<(k-p);\\n\\t\\t\\td |= this[--i]>>(p+=this._DB-k);\\n\\t\\t }\\n\\t\\t else {\\n\\t\\t\\td = (this[i]>>(p-=k))&km;\\n\\t\\t\\tif(p <= 0) { p += this._DB; --i; }\\n\\t\\t }\\n\\t\\t if(d > 0) m = true;\\n\\t\\t if(m) r += int2char(d);\\n\\t\\t}\\n\\t }\\n\\t return m?r:\\\"0\\\";\\n\\t}\",\n \"function bnToString(b) {\\n if (this.s < 0) return '-' + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d,\\n m = false,\\n r = '',\\n i = this.t;\\n var p = this.DB - (i * this.DB) % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;\\n r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & ((1 << p) - 1)) << (k - p);\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = (this[i] >> (p -= k)) & km;\\n if (p <= 0) {\\n p += this.DB;\\n --i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : '0';\\n}\",\n \"function myString (num) {\\nreturn num.toString();\\n}\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1 << k) - 1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB - (i * this.DB) % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;\\n r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & ((1 << p) - 1)) << (k - p);\\n d |= this[--i] >> (p += this.DB - k);\\n }\\n else {\\n d = (this[i] >> (p -= k)) & km;\\n if (p <= 0) {\\n p += this.DB;\\n --i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n}\",\n \"function bnToString(b) {\\r\\n\\t if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\r\\n\\t var k;\\r\\n\\t if (b == 16) k = 4;\\r\\n\\t else if (b == 8) k = 3;\\r\\n\\t else if (b == 2) k = 1;\\r\\n\\t else if (b == 32) k = 5;\\r\\n\\t else if (b == 4) k = 2;\\r\\n\\t else return this.toRadix(b);\\r\\n\\t var km = (1 << k) - 1, d, m = false, r = \\\"\\\", i = this.t;\\r\\n\\t var p = this.DB - (i * this.DB) % k;\\r\\n\\t if (i-- > 0) {\\r\\n\\t if (p < this.DB && (d = this[i] >> p) > 0) {\\r\\n\\t m = true;\\r\\n\\t r = int2char(d);\\r\\n\\t }\\r\\n\\t while (i >= 0) {\\r\\n\\t if (p < k) {\\r\\n\\t d = (this[i] & ((1 << p) - 1)) << (k - p);\\r\\n\\t d |= this[--i] >> (p += this.DB - k);\\r\\n\\t }\\r\\n\\t else {\\r\\n\\t d = (this[i] >> (p -= k)) & km;\\r\\n\\t if (p <= 0) {\\r\\n\\t p += this.DB;\\r\\n\\t --i;\\r\\n\\t }\\r\\n\\t }\\r\\n\\t if (d > 0) m = true;\\r\\n\\t if (m) r += int2char(d);\\r\\n\\t }\\r\\n\\t }\\r\\n\\t return m ? r : \\\"0\\\";\\r\\n\\t}\",\n \"function bnToString(b) {\\r\\n\\t if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\r\\n\\t var k;\\r\\n\\t if (b == 16) k = 4;\\r\\n\\t else if (b == 8) k = 3;\\r\\n\\t else if (b == 2) k = 1;\\r\\n\\t else if (b == 32) k = 5;\\r\\n\\t else if (b == 4) k = 2;\\r\\n\\t else return this.toRadix(b);\\r\\n\\t var km = (1 << k) - 1, d, m = false, r = \\\"\\\", i = this.t;\\r\\n\\t var p = this.DB - (i * this.DB) % k;\\r\\n\\t if (i-- > 0) {\\r\\n\\t if (p < this.DB && (d = this[i] >> p) > 0) {\\r\\n\\t m = true;\\r\\n\\t r = int2char(d);\\r\\n\\t }\\r\\n\\t while (i >= 0) {\\r\\n\\t if (p < k) {\\r\\n\\t d = (this[i] & ((1 << p) - 1)) << (k - p);\\r\\n\\t d |= this[--i] >> (p += this.DB - k);\\r\\n\\t }\\r\\n\\t else {\\r\\n\\t d = (this[i] >> (p -= k)) & km;\\r\\n\\t if (p <= 0) {\\r\\n\\t p += this.DB;\\r\\n\\t --i;\\r\\n\\t }\\r\\n\\t }\\r\\n\\t if (d > 0) m = true;\\r\\n\\t if (m) r += int2char(d);\\r\\n\\t }\\r\\n\\t }\\r\\n\\t return m ? r : \\\"0\\\";\\r\\n\\t}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this[i]&((1<<p)-1))<<(k-p);\\n d |= this[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - (i * this.DB) % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;\\n r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & ((1 << p) - 1)) << (k - p);\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = (this[i] >> (p -= k)) & km;\\n if (p <= 0) {\\n p += this.DB;\\n --i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - (i * this.DB) % k;\\n if (i-- > 0) {\\n if (p < this.DB && (d = this[i] >> p) > 0) {\\n m = true;\\n r = int2char(d);\\n }\\n while (i >= 0) {\\n if (p < k) {\\n d = (this[i] & ((1 << p) - 1)) << (k - p);\\n d |= this[--i] >> (p += this.DB - k);\\n } else {\\n d = (this[i] >> (p -= k)) & km;\\n if (p <= 0) {\\n p += this.DB;\\n --i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n }\",\n \"function bnToString(b)\\n{\\n if (this.s < 0) return \\\"-\\\" + this.negate().toString(b);\\n var k;\\n if (b == 16) k = 4;\\n else if (b == 8) k = 3;\\n else if (b == 2) k = 1;\\n else if (b == 32) k = 5;\\n else if (b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1 << k) - 1,\\n d, m = false,\\n r = \\\"\\\",\\n i = this.t;\\n var p = this.DB - (i * this.DB) % k;\\n if (i-- > 0)\\n {\\n if (p < this.DB && (d = this[i] >> p) > 0)\\n {\\n m = true;\\n r = int2char(d);\\n }\\n while (i >= 0)\\n {\\n if (p < k)\\n {\\n d = (this[i] & ((1 << p) - 1)) << (k - p);\\n d |= this[--i] >> (p += this.DB - k);\\n }\\n else\\n {\\n d = (this[i] >> (p -= k)) & km;\\n if (p <= 0)\\n {\\n p += this.DB;\\n --i;\\n }\\n }\\n if (d > 0) m = true;\\n if (m) r += int2char(d);\\n }\\n }\\n return m ? r : \\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n\\t if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n\\t var k;\\n\\t if(b == 16) k = 4;\\n\\t else if(b == 8) k = 3;\\n\\t else if(b == 2) k = 1;\\n\\t else if(b == 32) k = 5;\\n\\t else if(b == 4) k = 2;\\n\\t else return this.toRadix(b);\\n\\t var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n\\t var p = this.DB-(i*this.DB)%k;\\n\\t if(i-- > 0) {\\n\\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\\n\\t while(i >= 0) {\\n\\t if(p < k) {\\n\\t d = (this[i]&((1<<p)-1))<<(k-p);\\n\\t d |= this[--i]>>(p+=this.DB-k);\\n\\t }\\n\\t else {\\n\\t d = (this[i]>>(p-=k))&km;\\n\\t if(p <= 0) { p += this.DB; --i; }\\n\\t }\\n\\t if(d > 0) m = true;\\n\\t if(m) r += int2char(d);\\n\\t }\\n\\t }\\n\\t return m?r:\\\"0\\\";\\n\\t}\",\n \"function bnToString(b) {\\n\\tif(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n\\tvar k;\\n\\tif(b == 16) k = 4;\\n\\telse if(b == 8) k = 3;\\n\\telse if(b == 2) k = 1;\\n\\telse if(b == 32) k = 5;\\n\\telse if(b == 4) k = 2;\\n\\telse return this.toRadix(b);\\n\\tvar km = (1<<k)-1, d, m = false, r = [], i = this.t;\\n\\tvar p = this.DB-(i*this.DB)%k;\\n\\tif(i-- > 0) {\\n\\t if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r.push(int2char(d)); }\\n\\t while(i >= 0) {\\n\\t\\tif(p < k) {\\n\\t\\t d = (this[i]&((1<<p)-1))<<(k-p);\\n\\t\\t d |= this[--i]>>(p+=this.DB-k);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t d = (this[i]>>(p-=k))&km;\\n\\t\\t if(p <= 0) { p += this.DB; --i; }\\n\\t\\t}\\n\\t\\tif(d > 0) m = true;\\n\\t\\tif(m) r.push(int2char(d));\\n\\t }\\n\\t}\\n\\treturn m?r.join(\\\"\\\"):\\\"0\\\";\\n }\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n } else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n } else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n } else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n } else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n } else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n } else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n } else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\",\n \"function bnToString(b) {\\n\\t if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n\\t var k;\\n\\t if(b == 16) k = 4;\\n\\t else if(b == 8) k = 3;\\n\\t else if(b == 2) k = 1;\\n\\t else if(b == 32) k = 5;\\n\\t else if(b == 4) k = 2;\\n\\t else return this.toRadix(b);\\n\\t var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n\\t var p = this.DB-(i*this.DB)%k;\\n\\t if(i-- > 0) {\\n\\t if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n\\t while(i >= 0) {\\n\\t if(p < k) {\\n\\t d = (this.data[i]&((1<<p)-1))<<(k-p);\\n\\t d |= this.data[--i]>>(p+=this.DB-k);\\n\\t } else {\\n\\t d = (this.data[i]>>(p-=k))&km;\\n\\t if(p <= 0) { p += this.DB; --i; }\\n\\t }\\n\\t if(d > 0) m = true;\\n\\t if(m) r += int2char(d);\\n\\t }\\n\\t }\\n\\t return m?r:\\\"0\\\";\\n\\t}\",\n \"function bnToString(b) {\\n if(this.s < 0) return \\\"-\\\"+this.negate().toString(b);\\n var k;\\n if(b == 16) k = 4;\\n else if(b == 8) k = 3;\\n else if(b == 2) k = 1;\\n else if(b == 32) k = 5;\\n else if(b == 4) k = 2;\\n else return this.toRadix(b);\\n var km = (1<<k)-1, d, m = false, r = \\\"\\\", i = this.t;\\n var p = this.DB-(i*this.DB)%k;\\n if(i-- > 0) {\\n if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\\n while(i >= 0) {\\n if(p < k) {\\n d = (this.data[i]&((1<<p)-1))<<(k-p);\\n d |= this.data[--i]>>(p+=this.DB-k);\\n }\\n else {\\n d = (this.data[i]>>(p-=k))&km;\\n if(p <= 0) { p += this.DB; --i; }\\n }\\n if(d > 0) m = true;\\n if(m) r += int2char(d);\\n }\\n }\\n return m?r:\\\"0\\\";\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6569635","0.6452269","0.6398552","0.6398552","0.63979465","0.63979465","0.63979465","0.63979465","0.63979465","0.63979465","0.63979465","0.6391342","0.63456917","0.63456917","0.63392365","0.6335141","0.63327986","0.63327986","0.6324256","0.63225746","0.63225746","0.63225746","0.6317216","0.6309733","0.6301928","0.62946963","0.62939847","0.62882787","0.62882787","0.6287015","0.6287015","0.6287015","0.6287015","0.6287015","0.6287015","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.62852716","0.6279826","0.6279826","0.62792","0.6270703","0.6262682","0.62594825","0.62594825","0.62594825","0.62594825","0.62594825","0.62594825","0.62594825","0.625593","0.6255902"],"string":"[\n \"0.6569635\",\n \"0.6452269\",\n \"0.6398552\",\n \"0.6398552\",\n \"0.63979465\",\n \"0.63979465\",\n \"0.63979465\",\n \"0.63979465\",\n \"0.63979465\",\n \"0.63979465\",\n \"0.63979465\",\n \"0.6391342\",\n \"0.63456917\",\n \"0.63456917\",\n \"0.63392365\",\n \"0.6335141\",\n \"0.63327986\",\n \"0.63327986\",\n \"0.6324256\",\n \"0.63225746\",\n \"0.63225746\",\n \"0.63225746\",\n \"0.6317216\",\n \"0.6309733\",\n \"0.6301928\",\n \"0.62946963\",\n \"0.62939847\",\n \"0.62882787\",\n \"0.62882787\",\n \"0.6287015\",\n \"0.6287015\",\n \"0.6287015\",\n \"0.6287015\",\n \"0.6287015\",\n \"0.6287015\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.62852716\",\n \"0.6279826\",\n \"0.6279826\",\n \"0.62792\",\n \"0.6270703\",\n \"0.6262682\",\n \"0.62594825\",\n \"0.62594825\",\n \"0.62594825\",\n \"0.62594825\",\n \"0.62594825\",\n \"0.62594825\",\n \"0.62594825\",\n \"0.625593\",\n \"0.6255902\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.63123995"},"document_rank":{"kind":"string","value":"45"}}},{"rowIdx":4696,"cells":{"query":{"kind":"string","value":"(public) return + if this > a, if this < a, 0 if equal"},"document":{"kind":"string","value":"function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\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 value(a,b) {\r\na = a[1]+a[0];\r\nb = b[1]+b[0];\r\nreturn a == b ? 0 : (a < b ? -1 : 1)\r\n}","gt(other) { return this.cmp(other) > 0; }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return (this.s < 0) ? -r : r;\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return (this.s < 0) ? -r : r;\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return (this.s < 0) ? -r : r;\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return (this.s < 0) ? -r : r;\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r;\n return 0;\n }","function bnCompareTo(a) {\n\tvar r = this.s-a.s;\n\tif(r != 0) return r;\n\tvar i = this.t;\n\tif ( this.s < 0 ) {\n\t\tr = a.t - i;\n\t}\n\telse {\n\t\tr = i - a.t;\n\t}\n\tif(r != 0) return r;\n\twhile(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n\treturn 0;\n }","function bnCompareTo(a) {\n\t var r = this.s-a.s;\n\t if(r != 0) return r;\n\t var i = this.t;\n\t r = i-a.t;\n\t if(r != 0) return (this.s<0)?-r:r;\n\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n\t return 0;\n\t }","function bnCompareTo(a) {\n\t var r = this.s-a.s;\n\t if(r != 0) return r;\n\t var i = this.t;\n\t r = i-a.t;\n\t if(r != 0) return (this.s<0)?-r:r;\n\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n\t return 0;\n\t }","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return this.s < 0 ? -r : r;\n while (--i >= 0) {\n if ((r = this[i] - a[i]) != 0) return r;\n }return 0;\n }","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return this.s < 0 ? -r : r;\n while (--i >= 0) {\n if ((r = this[i] - a[i]) != 0) return r;\n }return 0;\n }","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return this.s < 0 ? -r : r;\n while (--i >= 0) {\n if ((r = this[i] - a[i]) != 0) return r;\n }return 0;\n }","lte(other) { return this.cmp(other) <= 0; }","function bnCompareTo(a) {\n\t var r = this.s-a.s;\n\t if(r != 0) return r;\n\t var i = this.t;\n\t r = i-a.t;\n\t if(r != 0) return r;\n\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n\t return 0;\n\t }","function compare (a, b) {\n if (a > b) {\n return 1\n }\n else if (a < b) {\n return -1\n }\n return 0\n \n }","function bnCompareTo(a) {\r\n\t var r = this.s - a.s;\r\n\t if (r != 0) return r;\r\n\t var i = this.t;\r\n\t r = i - a.t;\r\n\t if (r != 0) return (this.s < 0) ? -r : r;\r\n\t while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;\r\n\t return 0;\r\n\t}","function bnCompareTo(a) {\r\n\t var r = this.s - a.s;\r\n\t if (r != 0) return r;\r\n\t var i = this.t;\r\n\t r = i - a.t;\r\n\t if (r != 0) return (this.s < 0) ? -r : r;\r\n\t while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;\r\n\t return 0;\r\n\t}","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return (this.s < 0) ? -r : r;\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r;\n return 0;\n}","function bnCompareTo(a) {\n\t var r = this.s-a.s;\n\t if(r != 0) return r;\n\t var i = this.t;\n\t r = i-a.t;\n\t if(r != 0) return (this.s<0)?-r:r;\n\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n\t return 0;\n\t}","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return (this.s < 0) ? -r : r;\n while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;\n return 0;\n}","function bnCompareTo(a) {\n var r = this.s - a.s\n if (r != 0) return r\n var i = this.t\n r = i - a.t\n if (r != 0) return (this.s < 0) ? -r : r\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r\n return 0\n}","function bnCompareTo(a) {\n var r = this.s - a.s\n if (r != 0) return r\n var i = this.t\n r = i - a.t\n if (r != 0) return (this.s < 0) ? -r : r\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r\n return 0\n}","function bnCompareTo(a) {\n var r = this.s - a.s\n if (r != 0) return r\n var i = this.t\n r = i - a.t\n if (r != 0) return (this.s < 0) ? -r : r\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r\n return 0\n}","function bnCompareTo(a) {\n var r = this.s - a.s\n if (r != 0) return r\n var i = this.t\n r = i - a.t\n if (r != 0) return (this.s < 0) ? -r : r\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r\n return 0\n}","function bnCompareTo(a) {\n var r = this.s - a.s\n if (r != 0) return r\n var i = this.t\n r = i - a.t\n if (r != 0) return (this.s < 0) ? -r : r\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r\n return 0\n}","function bnCompareTo(a) {\n var r = this.s - a.s\n if (r != 0) return r\n var i = this.t\n r = i - a.t\n if (r != 0) return (this.s < 0) ? -r : r\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r\n return 0\n}","function bnCompareTo(a) {\n var r = this.s - a.s\n if (r != 0) return r\n var i = this.t\n r = i - a.t\n if (r != 0) return (this.s < 0) ? -r : r\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r\n return 0\n}","function bnCompareTo(a)\n{\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return (this.s < 0) ? -r : r;\n while (--i >= 0)\n if ((r = this[i] - a[i]) != 0) return r;\n return 0;\n}","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n}","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n}","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n}","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n return 0;\n}","function bnCompareTo(a) {\n\t var r = this.s-a.s;\n\t if(r != 0) return r;\n\t var i = this.t;\n\t r = i-a.t;\n\t if(r != 0) return (this.s<0)?-r:r;\n\t while(--i >= 0) if((r=this.data[i]-a.data[i]) != 0) return r;\n\t return 0;\n\t}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function compare (a, b) {\n return a > b ? 1 : a < b ? -1 : 0\n}","function bnCompareTo(a) {\n var r = this.s - a.s;\n if (r != 0) return r;\n var i = this.t;\n r = i - a.t;\n if (r != 0) return this.s < 0 ? -r : r;\n while (--i >= 0) {\n if ((r = this[i] - a[i]) != 0) return r;\n }return 0;\n}","function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r:r;\n while(--i >= 0) if((r=this.data[i]-a.data[i]) != 0) return r;\n return 0;\n}"],"string":"[\n \"function value(a,b) {\\r\\na = a[1]+a[0];\\r\\nb = b[1]+b[0];\\r\\nreturn a == b ? 0 : (a < b ? -1 : 1)\\r\\n}\",\n \"gt(other) { return this.cmp(other) > 0; }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return (this.s < 0) ? -r : r;\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return (this.s < 0) ? -r : r;\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return (this.s < 0) ? -r : r;\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return (this.s < 0) ? -r : r;\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r;\\n return 0;\\n }\",\n \"function bnCompareTo(a) {\\n\\tvar r = this.s-a.s;\\n\\tif(r != 0) return r;\\n\\tvar i = this.t;\\n\\tif ( this.s < 0 ) {\\n\\t\\tr = a.t - i;\\n\\t}\\n\\telse {\\n\\t\\tr = i - a.t;\\n\\t}\\n\\tif(r != 0) return r;\\n\\twhile(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n\\treturn 0;\\n }\",\n \"function bnCompareTo(a) {\\n\\t var r = this.s-a.s;\\n\\t if(r != 0) return r;\\n\\t var i = this.t;\\n\\t r = i-a.t;\\n\\t if(r != 0) return (this.s<0)?-r:r;\\n\\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n\\t return 0;\\n\\t }\",\n \"function bnCompareTo(a) {\\n\\t var r = this.s-a.s;\\n\\t if(r != 0) return r;\\n\\t var i = this.t;\\n\\t r = i-a.t;\\n\\t if(r != 0) return (this.s<0)?-r:r;\\n\\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n\\t return 0;\\n\\t }\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return this.s < 0 ? -r : r;\\n while (--i >= 0) {\\n if ((r = this[i] - a[i]) != 0) return r;\\n }return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return this.s < 0 ? -r : r;\\n while (--i >= 0) {\\n if ((r = this[i] - a[i]) != 0) return r;\\n }return 0;\\n }\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return this.s < 0 ? -r : r;\\n while (--i >= 0) {\\n if ((r = this[i] - a[i]) != 0) return r;\\n }return 0;\\n }\",\n \"lte(other) { return this.cmp(other) <= 0; }\",\n \"function bnCompareTo(a) {\\n\\t var r = this.s-a.s;\\n\\t if(r != 0) return r;\\n\\t var i = this.t;\\n\\t r = i-a.t;\\n\\t if(r != 0) return r;\\n\\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n\\t return 0;\\n\\t }\",\n \"function compare (a, b) {\\n if (a > b) {\\n return 1\\n }\\n else if (a < b) {\\n return -1\\n }\\n return 0\\n \\n }\",\n \"function bnCompareTo(a) {\\r\\n\\t var r = this.s - a.s;\\r\\n\\t if (r != 0) return r;\\r\\n\\t var i = this.t;\\r\\n\\t r = i - a.t;\\r\\n\\t if (r != 0) return (this.s < 0) ? -r : r;\\r\\n\\t while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;\\r\\n\\t return 0;\\r\\n\\t}\",\n \"function bnCompareTo(a) {\\r\\n\\t var r = this.s - a.s;\\r\\n\\t if (r != 0) return r;\\r\\n\\t var i = this.t;\\r\\n\\t r = i - a.t;\\r\\n\\t if (r != 0) return (this.s < 0) ? -r : r;\\r\\n\\t while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;\\r\\n\\t return 0;\\r\\n\\t}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return (this.s < 0) ? -r : r;\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r;\\n return 0;\\n}\",\n \"function bnCompareTo(a) {\\n\\t var r = this.s-a.s;\\n\\t if(r != 0) return r;\\n\\t var i = this.t;\\n\\t r = i-a.t;\\n\\t if(r != 0) return (this.s<0)?-r:r;\\n\\t while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n\\t return 0;\\n\\t}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return (this.s < 0) ? -r : r;\\n while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;\\n return 0;\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s\\n if (r != 0) return r\\n var i = this.t\\n r = i - a.t\\n if (r != 0) return (this.s < 0) ? -r : r\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r\\n return 0\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s\\n if (r != 0) return r\\n var i = this.t\\n r = i - a.t\\n if (r != 0) return (this.s < 0) ? -r : r\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r\\n return 0\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s\\n if (r != 0) return r\\n var i = this.t\\n r = i - a.t\\n if (r != 0) return (this.s < 0) ? -r : r\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r\\n return 0\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s\\n if (r != 0) return r\\n var i = this.t\\n r = i - a.t\\n if (r != 0) return (this.s < 0) ? -r : r\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r\\n return 0\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s\\n if (r != 0) return r\\n var i = this.t\\n r = i - a.t\\n if (r != 0) return (this.s < 0) ? -r : r\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r\\n return 0\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s\\n if (r != 0) return r\\n var i = this.t\\n r = i - a.t\\n if (r != 0) return (this.s < 0) ? -r : r\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r\\n return 0\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s\\n if (r != 0) return r\\n var i = this.t\\n r = i - a.t\\n if (r != 0) return (this.s < 0) ? -r : r\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r\\n return 0\\n}\",\n \"function bnCompareTo(a)\\n{\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return (this.s < 0) ? -r : r;\\n while (--i >= 0)\\n if ((r = this[i] - a[i]) != 0) return r;\\n return 0;\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\\n return 0;\\n}\",\n \"function bnCompareTo(a) {\\n\\t var r = this.s-a.s;\\n\\t if(r != 0) return r;\\n\\t var i = this.t;\\n\\t r = i-a.t;\\n\\t if(r != 0) return (this.s<0)?-r:r;\\n\\t while(--i >= 0) if((r=this.data[i]-a.data[i]) != 0) return r;\\n\\t return 0;\\n\\t}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function compare (a, b) {\\n return a > b ? 1 : a < b ? -1 : 0\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s - a.s;\\n if (r != 0) return r;\\n var i = this.t;\\n r = i - a.t;\\n if (r != 0) return this.s < 0 ? -r : r;\\n while (--i >= 0) {\\n if ((r = this[i] - a[i]) != 0) return r;\\n }return 0;\\n}\",\n \"function bnCompareTo(a) {\\n var r = this.s-a.s;\\n if(r != 0) return r;\\n var i = this.t;\\n r = i-a.t;\\n if(r != 0) return (this.s<0)?-r:r;\\n while(--i >= 0) if((r=this.data[i]-a.data[i]) != 0) return r;\\n return 0;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70131725","0.6956428","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.66924447","0.6673174","0.6673174","0.6667185","0.6667185","0.66655236","0.6657174","0.6657174","0.6639497","0.6639497","0.6639497","0.66325444","0.6619647","0.66112596","0.66058517","0.66058517","0.66030985","0.6598091","0.65939564","0.6587188","0.6587188","0.6587188","0.6587188","0.6587188","0.6587188","0.6587188","0.6585702","0.65772885","0.65772885","0.65772885","0.65772885","0.65717685","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65602607","0.65577096","0.6554198"],"string":"[\n \"0.70131725\",\n \"0.6956428\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.66924447\",\n \"0.6673174\",\n \"0.6673174\",\n \"0.6667185\",\n \"0.6667185\",\n \"0.66655236\",\n \"0.6657174\",\n \"0.6657174\",\n \"0.6639497\",\n \"0.6639497\",\n \"0.6639497\",\n \"0.66325444\",\n \"0.6619647\",\n \"0.66112596\",\n \"0.66058517\",\n \"0.66058517\",\n \"0.66030985\",\n \"0.6598091\",\n \"0.65939564\",\n \"0.6587188\",\n \"0.6587188\",\n \"0.6587188\",\n \"0.6587188\",\n \"0.6587188\",\n \"0.6587188\",\n \"0.6587188\",\n \"0.6585702\",\n \"0.65772885\",\n \"0.65772885\",\n \"0.65772885\",\n \"0.65772885\",\n \"0.65717685\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65602607\",\n \"0.65577096\",\n \"0.6554198\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.66477484"},"document_rank":{"kind":"string","value":"59"}}},{"rowIdx":4697,"cells":{"query":{"kind":"string","value":"returns bit length of the integer x"},"document":{"kind":"string","value":"function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\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 bitSize(x) {\n var j,z,w;\n for (j=x.length-1; (x[j]==0) && (j>0); j--);\n for (z=0,w=x[j]; w; (w>>=1),z++);\n z+=bpe*j;\n return z;\n }","function bitSize(x) {\n var j, z, w;\n for (j = x.length - 1; (x[j] == 0) && (j > 0); j--);\n for (z = 0, w = x[j]; w; (w >>= 1), z++);\n z += bpe * j;\n return z;\n }","function nbits(x) {\n\t \tvar n = 1, t;\n\t \tif ((t = x >>> 16) != 0) {\n\t \t\tx = t;\n\t \t\tn += 16;\n\t \t}\n\t \tif ((t = x >> 8) != 0) {\n\t \t\tx = t;\n\t \t\tn += 8;\n\t \t}\n\t \tif ((t = x >> 4) != 0) {\n\t \t\tx = t;\n\t \t\tn += 4;\n\t \t}\n\t \tif ((t = x >> 2) != 0) {\n\t \t\tx = t;\n\t \t\tn += 2;\n\t \t}\n\t \tif ((t = x >> 1) != 0) {\n\t \t\tx = t;\n\t \t\tn += 1;\n\t \t}\n\t \treturn n;\n\t }","function nbits(x)\n{\n var r = 1,\n t;\n if ((t = x >>> 16) != 0)\n {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0)\n {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0)\n {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0)\n {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0)\n {\n x = t;\n r += 1;\n }\n return r;\n}","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n }","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n }","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n }","function nbits(x) {\n var r = 1,\n t\n if ((t = x >>> 16) != 0) {\n x = t\n r += 16\n }\n if ((t = x >> 8) != 0) {\n x = t\n r += 8\n }\n if ((t = x >> 4) != 0) {\n x = t\n r += 4\n }\n if ((t = x >> 2) != 0) {\n x = t\n r += 2\n }\n if ((t = x >> 1) != 0) {\n x = t\n r += 1\n }\n return r\n}","function nbits(x) {\n var r = 1,\n t\n if ((t = x >>> 16) != 0) {\n x = t\n r += 16\n }\n if ((t = x >> 8) != 0) {\n x = t\n r += 8\n }\n if ((t = x >> 4) != 0) {\n x = t\n r += 4\n }\n if ((t = x >> 2) != 0) {\n x = t\n r += 2\n }\n if ((t = x >> 1) != 0) {\n x = t\n r += 1\n }\n return r\n}","function nbits(x) {\n var r = 1,\n t\n if ((t = x >>> 16) != 0) {\n x = t\n r += 16\n }\n if ((t = x >> 8) != 0) {\n x = t\n r += 8\n }\n if ((t = x >> 4) != 0) {\n x = t\n r += 4\n }\n if ((t = x >> 2) != 0) {\n x = t\n r += 2\n }\n if ((t = x >> 1) != 0) {\n x = t\n r += 1\n }\n return r\n}","function nbits(x) {\n var r = 1,\n t\n if ((t = x >>> 16) != 0) {\n x = t\n r += 16\n }\n if ((t = x >> 8) != 0) {\n x = t\n r += 8\n }\n if ((t = x >> 4) != 0) {\n x = t\n r += 4\n }\n if ((t = x >> 2) != 0) {\n x = t\n r += 2\n }\n if ((t = x >> 1) != 0) {\n x = t\n r += 1\n }\n return r\n}","function nbits(x) {\n var r = 1,\n t\n if ((t = x >>> 16) != 0) {\n x = t\n r += 16\n }\n if ((t = x >> 8) != 0) {\n x = t\n r += 8\n }\n if ((t = x >> 4) != 0) {\n x = t\n r += 4\n }\n if ((t = x >> 2) != 0) {\n x = t\n r += 2\n }\n if ((t = x >> 1) != 0) {\n x = t\n r += 1\n }\n return r\n}","function nbits(x) {\n var r = 1,\n t\n if ((t = x >>> 16) != 0) {\n x = t\n r += 16\n }\n if ((t = x >> 8) != 0) {\n x = t\n r += 8\n }\n if ((t = x >> 4) != 0) {\n x = t\n r += 4\n }\n if ((t = x >> 2) != 0) {\n x = t\n r += 2\n }\n if ((t = x >> 1) != 0) {\n x = t\n r += 1\n }\n return r\n}","function nbits(x) {\n var r = 1,\n t\n if ((t = x >>> 16) != 0) {\n x = t\n r += 16\n }\n if ((t = x >> 8) != 0) {\n x = t\n r += 8\n }\n if ((t = x >> 4) != 0) {\n x = t\n r += 4\n }\n if ((t = x >> 2) != 0) {\n x = t\n r += 2\n }\n if ((t = x >> 1) != 0) {\n x = t\n r += 1\n }\n return r\n}","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) { x = t;\n r += 16; }\n if ((t = x >> 8) != 0) { x = t;\n r += 8; }\n if ((t = x >> 4) != 0) { x = t;\n r += 4; }\n if ((t = x >> 2) != 0) { x = t;\n r += 2; }\n if ((t = x >> 1) != 0) { x = t;\n r += 1; }\n return r;\n }","function nbits(x) {\n\t\tvar r = 1, t;\n\t\tif ((t = x >>> 16) != 0) { x = t; r += 16; }\n\t\tif ((t = x >> 8) != 0) { x = t; r += 8; }\n\t\tif ((t = x >> 4) != 0) { x = t; r += 4; }\n\t\tif ((t = x >> 2) != 0) { x = t; r += 2; }\n\t\tif ((t = x >> 1) != 0) { x = t; r += 1; }\n\t\treturn r;\n\t}","function nbits(x) {\n var r = 1;\n var t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n }","function nbits(x) {\n var r = 1;\n var t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n }","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n}","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;r += 1;\n }\n return r;\n }","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;r += 1;\n }\n return r;\n }","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;r += 1;\n }\n return r;\n }","function getNextBinarySize(x) {\n\tvar n = 0;\n\twhile (Math.pow(2, n) + 1 < x) {\n\t\tn++;\n\t}\n\treturn Math.pow(2, n) + 1;\n}","function nbits(x) {\n var r = 1,\n t;\n if ((t = x >>> 16) != 0) {\n x = t;\n r += 16;\n }\n if ((t = x >> 8) != 0) {\n x = t;\n r += 8;\n }\n if ((t = x >> 4) != 0) {\n x = t;\n r += 4;\n }\n if ((t = x >> 2) != 0) {\n x = t;\n r += 2;\n }\n if ((t = x >> 1) != 0) {\n x = t;\n r += 1;\n }\n return r;\n}","function nbits(x) {\n\t var r = 1,\n\t t\n\t if ((t = x >>> 16) != 0) {\n\t x = t\n\t r += 16\n\t }\n\t if ((t = x >> 8) != 0) {\n\t x = t\n\t r += 8\n\t }\n\t if ((t = x >> 4) != 0) {\n\t x = t\n\t r += 4\n\t }\n\t if ((t = x >> 2) != 0) {\n\t x = t\n\t r += 2\n\t }\n\t if ((t = x >> 1) != 0) {\n\t x = t\n\t r += 1\n\t }\n\t return r\n\t}","function nbits(x) {\n\t var r = 1,\n\t t\n\t if ((t = x >>> 16) != 0) {\n\t x = t\n\t r += 16\n\t }\n\t if ((t = x >> 8) != 0) {\n\t x = t\n\t r += 8\n\t }\n\t if ((t = x >> 4) != 0) {\n\t x = t\n\t r += 4\n\t }\n\t if ((t = x >> 2) != 0) {\n\t x = t\n\t r += 2\n\t }\n\t if ((t = x >> 1) != 0) {\n\t x = t\n\t r += 1\n\t }\n\t return r\n\t}","function nbits(x) {\r\n\t var r = 1, t;\r\n\t if ((t = x >>> 16) != 0) {\r\n\t x = t;\r\n\t r += 16;\r\n\t }\r\n\t if ((t = x >> 8) != 0) {\r\n\t x = t;\r\n\t r += 8;\r\n\t }\r\n\t if ((t = x >> 4) != 0) {\r\n\t x = t;\r\n\t r += 4;\r\n\t }\r\n\t if ((t = x >> 2) != 0) {\r\n\t x = t;\r\n\t r += 2;\r\n\t }\r\n\t if ((t = x >> 1) != 0) {\r\n\t x = t;\r\n\t r += 1;\r\n\t }\r\n\t return r;\r\n\t}","function nbits(x) {\r\n\t var r = 1, t;\r\n\t if ((t = x >>> 16) != 0) {\r\n\t x = t;\r\n\t r += 16;\r\n\t }\r\n\t if ((t = x >> 8) != 0) {\r\n\t x = t;\r\n\t r += 8;\r\n\t }\r\n\t if ((t = x >> 4) != 0) {\r\n\t x = t;\r\n\t r += 4;\r\n\t }\r\n\t if ((t = x >> 2) != 0) {\r\n\t x = t;\r\n\t r += 2;\r\n\t }\r\n\t if ((t = x >> 1) != 0) {\r\n\t x = t;\r\n\t r += 1;\r\n\t }\r\n\t return r;\r\n\t}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n}","function nbits(x) {\n\t var r = 1, t;\n\t if((t=x>>>16) != 0) { x = t; r += 16; }\n\t if((t=x>>8) != 0) { x = t; r += 8; }\n\t if((t=x>>4) != 0) { x = t; r += 4; }\n\t if((t=x>>2) != 0) { x = t; r += 2; }\n\t if((t=x>>1) != 0) { x = t; r += 1; }\n\t return r;\n\t }","function nbits(x) {\r\n var r = 1, t;\r\n if((t=x>>>16) != 0) { x = t; r += 16; }\r\n if((t=x>>8) != 0) { x = t; r += 8; }\r\n if((t=x>>4) != 0) { x = t; r += 4; }\r\n if((t=x>>2) != 0) { x = t; r += 2; }\r\n if((t=x>>1) != 0) { x = t; r += 1; }\r\n return r;\r\n}","function nbits(x) {\n\tvar r = 1, t;\n\tif((t=x>>>16) != 0) { x = t; r += 16; }\n\tif((t=x>>8) != 0) { x = t; r += 8; }\n\tif((t=x>>4) != 0) { x = t; r += 4; }\n\tif((t=x>>2) != 0) { x = t; r += 2; }\n\tif((t=x>>1) != 0) { x = t; r += 1; }\n\treturn r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }","function nbits(x) {\n var r = 1, t;\n if((t=x>>>16) != 0) { x = t; r += 16; }\n if((t=x>>8) != 0) { x = t; r += 8; }\n if((t=x>>4) != 0) { x = t; r += 4; }\n if((t=x>>2) != 0) { x = t; r += 2; }\n if((t=x>>1) != 0) { x = t; r += 1; }\n return r;\n }"],"string":"[\n \"function bitSize(x) {\\n var j,z,w;\\n for (j=x.length-1; (x[j]==0) && (j>0); j--);\\n for (z=0,w=x[j]; w; (w>>=1),z++);\\n z+=bpe*j;\\n return z;\\n }\",\n \"function bitSize(x) {\\n var j, z, w;\\n for (j = x.length - 1; (x[j] == 0) && (j > 0); j--);\\n for (z = 0, w = x[j]; w; (w >>= 1), z++);\\n z += bpe * j;\\n return z;\\n }\",\n \"function nbits(x) {\\n\\t \\tvar n = 1, t;\\n\\t \\tif ((t = x >>> 16) != 0) {\\n\\t \\t\\tx = t;\\n\\t \\t\\tn += 16;\\n\\t \\t}\\n\\t \\tif ((t = x >> 8) != 0) {\\n\\t \\t\\tx = t;\\n\\t \\t\\tn += 8;\\n\\t \\t}\\n\\t \\tif ((t = x >> 4) != 0) {\\n\\t \\t\\tx = t;\\n\\t \\t\\tn += 4;\\n\\t \\t}\\n\\t \\tif ((t = x >> 2) != 0) {\\n\\t \\t\\tx = t;\\n\\t \\t\\tn += 2;\\n\\t \\t}\\n\\t \\tif ((t = x >> 1) != 0) {\\n\\t \\t\\tx = t;\\n\\t \\t\\tn += 1;\\n\\t \\t}\\n\\t \\treturn n;\\n\\t }\",\n \"function nbits(x)\\n{\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0)\\n {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0)\\n {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0)\\n {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0)\\n {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0)\\n {\\n x = t;\\n r += 1;\\n }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1,\\n t\\n if ((t = x >>> 16) != 0) {\\n x = t\\n r += 16\\n }\\n if ((t = x >> 8) != 0) {\\n x = t\\n r += 8\\n }\\n if ((t = x >> 4) != 0) {\\n x = t\\n r += 4\\n }\\n if ((t = x >> 2) != 0) {\\n x = t\\n r += 2\\n }\\n if ((t = x >> 1) != 0) {\\n x = t\\n r += 1\\n }\\n return r\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t\\n if ((t = x >>> 16) != 0) {\\n x = t\\n r += 16\\n }\\n if ((t = x >> 8) != 0) {\\n x = t\\n r += 8\\n }\\n if ((t = x >> 4) != 0) {\\n x = t\\n r += 4\\n }\\n if ((t = x >> 2) != 0) {\\n x = t\\n r += 2\\n }\\n if ((t = x >> 1) != 0) {\\n x = t\\n r += 1\\n }\\n return r\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t\\n if ((t = x >>> 16) != 0) {\\n x = t\\n r += 16\\n }\\n if ((t = x >> 8) != 0) {\\n x = t\\n r += 8\\n }\\n if ((t = x >> 4) != 0) {\\n x = t\\n r += 4\\n }\\n if ((t = x >> 2) != 0) {\\n x = t\\n r += 2\\n }\\n if ((t = x >> 1) != 0) {\\n x = t\\n r += 1\\n }\\n return r\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t\\n if ((t = x >>> 16) != 0) {\\n x = t\\n r += 16\\n }\\n if ((t = x >> 8) != 0) {\\n x = t\\n r += 8\\n }\\n if ((t = x >> 4) != 0) {\\n x = t\\n r += 4\\n }\\n if ((t = x >> 2) != 0) {\\n x = t\\n r += 2\\n }\\n if ((t = x >> 1) != 0) {\\n x = t\\n r += 1\\n }\\n return r\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t\\n if ((t = x >>> 16) != 0) {\\n x = t\\n r += 16\\n }\\n if ((t = x >> 8) != 0) {\\n x = t\\n r += 8\\n }\\n if ((t = x >> 4) != 0) {\\n x = t\\n r += 4\\n }\\n if ((t = x >> 2) != 0) {\\n x = t\\n r += 2\\n }\\n if ((t = x >> 1) != 0) {\\n x = t\\n r += 1\\n }\\n return r\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t\\n if ((t = x >>> 16) != 0) {\\n x = t\\n r += 16\\n }\\n if ((t = x >> 8) != 0) {\\n x = t\\n r += 8\\n }\\n if ((t = x >> 4) != 0) {\\n x = t\\n r += 4\\n }\\n if ((t = x >> 2) != 0) {\\n x = t\\n r += 2\\n }\\n if ((t = x >> 1) != 0) {\\n x = t\\n r += 1\\n }\\n return r\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t\\n if ((t = x >>> 16) != 0) {\\n x = t\\n r += 16\\n }\\n if ((t = x >> 8) != 0) {\\n x = t\\n r += 8\\n }\\n if ((t = x >> 4) != 0) {\\n x = t\\n r += 4\\n }\\n if ((t = x >> 2) != 0) {\\n x = t\\n r += 2\\n }\\n if ((t = x >> 1) != 0) {\\n x = t\\n r += 1\\n }\\n return r\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) { x = t;\\n r += 16; }\\n if ((t = x >> 8) != 0) { x = t;\\n r += 8; }\\n if ((t = x >> 4) != 0) { x = t;\\n r += 4; }\\n if ((t = x >> 2) != 0) { x = t;\\n r += 2; }\\n if ((t = x >> 1) != 0) { x = t;\\n r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n\\t\\tvar r = 1, t;\\n\\t\\tif ((t = x >>> 16) != 0) { x = t; r += 16; }\\n\\t\\tif ((t = x >> 8) != 0) { x = t; r += 8; }\\n\\t\\tif ((t = x >> 4) != 0) { x = t; r += 4; }\\n\\t\\tif ((t = x >> 2) != 0) { x = t; r += 2; }\\n\\t\\tif ((t = x >> 1) != 0) { x = t; r += 1; }\\n\\t\\treturn r;\\n\\t}\",\n \"function nbits(x) {\\n var r = 1;\\n var t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1;\\n var t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;r += 1;\\n }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;r += 1;\\n }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;r += 1;\\n }\\n return r;\\n }\",\n \"function getNextBinarySize(x) {\\n\\tvar n = 0;\\n\\twhile (Math.pow(2, n) + 1 < x) {\\n\\t\\tn++;\\n\\t}\\n\\treturn Math.pow(2, n) + 1;\\n}\",\n \"function nbits(x) {\\n var r = 1,\\n t;\\n if ((t = x >>> 16) != 0) {\\n x = t;\\n r += 16;\\n }\\n if ((t = x >> 8) != 0) {\\n x = t;\\n r += 8;\\n }\\n if ((t = x >> 4) != 0) {\\n x = t;\\n r += 4;\\n }\\n if ((t = x >> 2) != 0) {\\n x = t;\\n r += 2;\\n }\\n if ((t = x >> 1) != 0) {\\n x = t;\\n r += 1;\\n }\\n return r;\\n}\",\n \"function nbits(x) {\\n\\t var r = 1,\\n\\t t\\n\\t if ((t = x >>> 16) != 0) {\\n\\t x = t\\n\\t r += 16\\n\\t }\\n\\t if ((t = x >> 8) != 0) {\\n\\t x = t\\n\\t r += 8\\n\\t }\\n\\t if ((t = x >> 4) != 0) {\\n\\t x = t\\n\\t r += 4\\n\\t }\\n\\t if ((t = x >> 2) != 0) {\\n\\t x = t\\n\\t r += 2\\n\\t }\\n\\t if ((t = x >> 1) != 0) {\\n\\t x = t\\n\\t r += 1\\n\\t }\\n\\t return r\\n\\t}\",\n \"function nbits(x) {\\n\\t var r = 1,\\n\\t t\\n\\t if ((t = x >>> 16) != 0) {\\n\\t x = t\\n\\t r += 16\\n\\t }\\n\\t if ((t = x >> 8) != 0) {\\n\\t x = t\\n\\t r += 8\\n\\t }\\n\\t if ((t = x >> 4) != 0) {\\n\\t x = t\\n\\t r += 4\\n\\t }\\n\\t if ((t = x >> 2) != 0) {\\n\\t x = t\\n\\t r += 2\\n\\t }\\n\\t if ((t = x >> 1) != 0) {\\n\\t x = t\\n\\t r += 1\\n\\t }\\n\\t return r\\n\\t}\",\n \"function nbits(x) {\\r\\n\\t var r = 1, t;\\r\\n\\t if ((t = x >>> 16) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 16;\\r\\n\\t }\\r\\n\\t if ((t = x >> 8) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 8;\\r\\n\\t }\\r\\n\\t if ((t = x >> 4) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 4;\\r\\n\\t }\\r\\n\\t if ((t = x >> 2) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 2;\\r\\n\\t }\\r\\n\\t if ((t = x >> 1) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 1;\\r\\n\\t }\\r\\n\\t return r;\\r\\n\\t}\",\n \"function nbits(x) {\\r\\n\\t var r = 1, t;\\r\\n\\t if ((t = x >>> 16) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 16;\\r\\n\\t }\\r\\n\\t if ((t = x >> 8) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 8;\\r\\n\\t }\\r\\n\\t if ((t = x >> 4) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 4;\\r\\n\\t }\\r\\n\\t if ((t = x >> 2) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 2;\\r\\n\\t }\\r\\n\\t if ((t = x >> 1) != 0) {\\r\\n\\t x = t;\\r\\n\\t r += 1;\\r\\n\\t }\\r\\n\\t return r;\\r\\n\\t}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n}\",\n \"function nbits(x) {\\n\\t var r = 1, t;\\n\\t if((t=x>>>16) != 0) { x = t; r += 16; }\\n\\t if((t=x>>8) != 0) { x = t; r += 8; }\\n\\t if((t=x>>4) != 0) { x = t; r += 4; }\\n\\t if((t=x>>2) != 0) { x = t; r += 2; }\\n\\t if((t=x>>1) != 0) { x = t; r += 1; }\\n\\t return r;\\n\\t }\",\n \"function nbits(x) {\\r\\n var r = 1, t;\\r\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\r\\n if((t=x>>8) != 0) { x = t; r += 8; }\\r\\n if((t=x>>4) != 0) { x = t; r += 4; }\\r\\n if((t=x>>2) != 0) { x = t; r += 2; }\\r\\n if((t=x>>1) != 0) { x = t; r += 1; }\\r\\n return r;\\r\\n}\",\n \"function nbits(x) {\\n\\tvar r = 1, t;\\n\\tif((t=x>>>16) != 0) { x = t; r += 16; }\\n\\tif((t=x>>8) != 0) { x = t; r += 8; }\\n\\tif((t=x>>4) != 0) { x = t; r += 4; }\\n\\tif((t=x>>2) != 0) { x = t; r += 2; }\\n\\tif((t=x>>1) != 0) { x = t; r += 1; }\\n\\treturn r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\",\n \"function nbits(x) {\\n var r = 1, t;\\n if((t=x>>>16) != 0) { x = t; r += 16; }\\n if((t=x>>8) != 0) { x = t; r += 8; }\\n if((t=x>>4) != 0) { x = t; r += 4; }\\n if((t=x>>2) != 0) { x = t; r += 2; }\\n if((t=x>>1) != 0) { x = t; r += 1; }\\n return r;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.833884","0.8291418","0.7555619","0.7480939","0.74747205","0.74659693","0.74659693","0.74595004","0.74595004","0.74595004","0.74595004","0.74595004","0.74595004","0.74595004","0.74572974","0.7455497","0.7445271","0.7445271","0.7444451","0.74419636","0.74419636","0.7429455","0.7429455","0.7429455","0.7423107","0.74190557","0.7382242","0.7382242","0.7363804","0.7363804","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7229935","0.7219009","0.7214144","0.7191688","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015","0.71886015"],"string":"[\n \"0.833884\",\n \"0.8291418\",\n \"0.7555619\",\n \"0.7480939\",\n \"0.74747205\",\n \"0.74659693\",\n \"0.74659693\",\n \"0.74595004\",\n \"0.74595004\",\n \"0.74595004\",\n \"0.74595004\",\n \"0.74595004\",\n \"0.74595004\",\n \"0.74595004\",\n \"0.74572974\",\n \"0.7455497\",\n \"0.7445271\",\n \"0.7445271\",\n \"0.7444451\",\n \"0.74419636\",\n \"0.74419636\",\n \"0.7429455\",\n \"0.7429455\",\n \"0.7429455\",\n \"0.7423107\",\n \"0.74190557\",\n \"0.7382242\",\n \"0.7382242\",\n \"0.7363804\",\n \"0.7363804\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7229935\",\n \"0.7219009\",\n \"0.7214144\",\n \"0.7191688\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\",\n \"0.71886015\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.72613025"},"document_rank":{"kind":"string","value":"51"}}},{"rowIdx":4698,"cells":{"query":{"kind":"string","value":"(public) return the number of bits in \"this\""},"document":{"kind":"string","value":"function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\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 bnBitCount() {\n\t var r = 0, x = this.s&this.DM;\n\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n\t return r;\n\t }","function bnBitCount() {\n\t var r = 0, x = this.s&this.DM;\n\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n\t return r;\n\t }","function bnBitCount() {\n\tvar r = 0, x = this.s&this.DM;\n\tfor(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n\treturn r;\n }","function bnBitCount() {\n\t var r = 0, x = this.s&this.DM;\n\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n\t return r;\n\t }","function bnBitCount() {\r\n\t var r = 0, x = this.s & this.DM;\r\n\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\r\n\t return r;\r\n\t}","function bnBitCount() {\r\n\t var r = 0, x = this.s & this.DM;\r\n\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\r\n\t return r;\r\n\t}","function bnBitCount() {\n\t var r = 0, x = this.s&this.DM;\n\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n\t return r;\n\t}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n }","function bnBitCount() {\n\t var r = 0,\n\t x = this.s & this.DM\n\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n\t return r\n\t}","function bnBitCount() {\n\t var r = 0,\n\t x = this.s & this.DM\n\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n\t return r\n\t}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\n return r;\n }","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) {\n r += cbit(this[i] ^ x);\n }return r;\n }","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) {\n r += cbit(this[i] ^ x);\n }return r;\n }","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) {\n r += cbit(this[i] ^ x);\n }return r;\n }","function bnBitCount() {\n\tvar r = 0, x = this.s&this.DM;\n\tfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\n\treturn r;\n\t}","function bnBitCount() {\n var r = 0, x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\n return r;\n}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n return r;\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\n return r;\n}","function bnBitCount()\n{\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\n return r;\n}","function bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}","function bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}","function bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}","function bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}","function bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}","function bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}","function bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM;\n for (var i = 0; i < this.t; ++i) {\n r += cbit(this[i] ^ x);\n }return r;\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n return r\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n return r\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n return r\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n return r\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n return r\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n return r\n}","function bnBitCount() {\n var r = 0,\n x = this.s & this.DM\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\n return r\n}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\n return r;\n}","function bnBitCount() {\n var r = 0, x = this.s&this.DM;\n for(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\n return r;\n}","function bnBitLength()\n{\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n}","function bnBitLength() {\r\n\t if (this.t <= 0) return 0;\r\n\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\r\n\t}","function bnBitLength() {\r\n\t if (this.t <= 0) return 0;\r\n\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\r\n\t}","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n }","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n }","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n }","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n }","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n}","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\n}","function bnBitLength() {\n\t if(this.t <= 0) return 0;\n\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n\t }","function bnBitLength() {\n\t if(this.t <= 0) return 0;\n\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n\t }","function bnBitLength() {\n\t if(this.t <= 0) return 0;\n\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n\t }","function bnBitLength() {\n\tif(this.t <= 0) return 0;\n\treturn this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n\t if(this.t <= 0) return 0;\n\t return this._DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this._DM));\n\t}","function bnBitLength() {\n\t if (this.t <= 0) return 0\n\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM))\n\t}","function bnBitLength() {\n\t if (this.t <= 0) return 0\n\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM))\n\t}","function bnBitLength() {\n\t if(this.t <= 0) return 0;\n\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n\t}","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\n}","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\n }","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\n }","function bnBitLength() {\n if (this.t <= 0) return 0;\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\n }","bitCount(n) {\n var count = 0;\n while (n) {\n count += n & 1;\n n >>= 1;\n }\n return count;\n }","function bnBitLength() {\n\t if(this.t <= 0) return 0;\n\t return this.DB*(this.t-1)+nbits(this.data[this.t-1]^(this.s&this.DM));\n\t}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n}","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }","function bnBitLength() {\n if(this.t <= 0) return 0;\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n }"],"string":"[\n \"function bnBitCount() {\\n\\t var r = 0, x = this.s&this.DM;\\n\\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n\\t return r;\\n\\t }\",\n \"function bnBitCount() {\\n\\t var r = 0, x = this.s&this.DM;\\n\\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n\\t return r;\\n\\t }\",\n \"function bnBitCount() {\\n\\tvar r = 0, x = this.s&this.DM;\\n\\tfor(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n\\treturn r;\\n }\",\n \"function bnBitCount() {\\n\\t var r = 0, x = this.s&this.DM;\\n\\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n\\t return r;\\n\\t }\",\n \"function bnBitCount() {\\r\\n\\t var r = 0, x = this.s & this.DM;\\r\\n\\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\\r\\n\\t return r;\\r\\n\\t}\",\n \"function bnBitCount() {\\r\\n\\t var r = 0, x = this.s & this.DM;\\r\\n\\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\\r\\n\\t return r;\\r\\n\\t}\",\n \"function bnBitCount() {\\n\\t var r = 0, x = this.s&this.DM;\\n\\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n\\t return r;\\n\\t}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n\\t var r = 0,\\n\\t x = this.s & this.DM\\n\\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n\\t return r\\n\\t}\",\n \"function bnBitCount() {\\n\\t var r = 0,\\n\\t x = this.s & this.DM\\n\\t for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n\\t return r\\n\\t}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\\n return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) {\\n r += cbit(this[i] ^ x);\\n }return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) {\\n r += cbit(this[i] ^ x);\\n }return r;\\n }\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) {\\n r += cbit(this[i] ^ x);\\n }return r;\\n }\",\n \"function bnBitCount() {\\n\\tvar r = 0, x = this.s&this.DM;\\n\\tfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\n\\treturn r;\\n\\t}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\\n return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\\n return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\\n return r;\\n}\",\n \"function bnBitCount()\\n{\\n var r = 0,\\n x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);\\n return r;\\n}\",\n \"function bnBitCount() {\\nvar r = 0, x = this.s&this.DM;\\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\nreturn r;\\n}\",\n \"function bnBitCount() {\\nvar r = 0, x = this.s&this.DM;\\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\nreturn r;\\n}\",\n \"function bnBitCount() {\\nvar r = 0, x = this.s&this.DM;\\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\nreturn r;\\n}\",\n \"function bnBitCount() {\\nvar r = 0, x = this.s&this.DM;\\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\nreturn r;\\n}\",\n \"function bnBitCount() {\\nvar r = 0, x = this.s&this.DM;\\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\nreturn r;\\n}\",\n \"function bnBitCount() {\\nvar r = 0, x = this.s&this.DM;\\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\nreturn r;\\n}\",\n \"function bnBitCount() {\\nvar r = 0, x = this.s&this.DM;\\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\nreturn r;\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM;\\n for (var i = 0; i < this.t; ++i) {\\n r += cbit(this[i] ^ x);\\n }return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n return r\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n return r\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n return r\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n return r\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n return r\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n return r\\n}\",\n \"function bnBitCount() {\\n var r = 0,\\n x = this.s & this.DM\\n for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x)\\n return r\\n}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\n return r;\\n}\",\n \"function bnBitCount() {\\n var r = 0, x = this.s&this.DM;\\n for(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\\n return r;\\n}\",\n \"function bnBitLength()\\n{\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n}\",\n \"function bnBitLength() {\\r\\n\\t if (this.t <= 0) return 0;\\r\\n\\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\r\\n\\t}\",\n \"function bnBitLength() {\\r\\n\\t if (this.t <= 0) return 0;\\r\\n\\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\r\\n\\t}\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n }\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n }\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n }\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n }\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n}\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));\\n}\",\n \"function bnBitLength() {\\n\\t if(this.t <= 0) return 0;\\n\\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n\\t }\",\n \"function bnBitLength() {\\n\\t if(this.t <= 0) return 0;\\n\\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n\\t }\",\n \"function bnBitLength() {\\n\\t if(this.t <= 0) return 0;\\n\\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n\\t }\",\n \"function bnBitLength() {\\n\\tif(this.t <= 0) return 0;\\n\\treturn this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n\\t if(this.t <= 0) return 0;\\n\\t return this._DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this._DM));\\n\\t}\",\n \"function bnBitLength() {\\n\\t if (this.t <= 0) return 0\\n\\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM))\\n\\t}\",\n \"function bnBitLength() {\\n\\t if (this.t <= 0) return 0\\n\\t return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM))\\n\\t}\",\n \"function bnBitLength() {\\n\\t if(this.t <= 0) return 0;\\n\\t return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n\\t}\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\\n}\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\\n }\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\\n }\",\n \"function bnBitLength() {\\n if (this.t <= 0) return 0;\\n return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM);\\n }\",\n \"bitCount(n) {\\n var count = 0;\\n while (n) {\\n count += n & 1;\\n n >>= 1;\\n }\\n return count;\\n }\",\n \"function bnBitLength() {\\n\\t if(this.t <= 0) return 0;\\n\\t return this.DB*(this.t-1)+nbits(this.data[this.t-1]^(this.s&this.DM));\\n\\t}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n}\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\",\n \"function bnBitLength() {\\n if(this.t <= 0) return 0;\\n return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7724705","0.7724705","0.7695087","0.7681344","0.7667404","0.7667404","0.76382494","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7611839","0.7565225","0.7565225","0.7564895","0.7553599","0.7553599","0.7553599","0.75523937","0.7542392","0.7540721","0.7540721","0.7540721","0.7540721","0.7540721","0.7513849","0.7500483","0.74856174","0.74856174","0.74856174","0.74856174","0.74856174","0.74856174","0.74856174","0.7479269","0.7467435","0.7467435","0.7467435","0.7467435","0.7467435","0.7467435","0.7467435","0.74168074","0.74168074","0.7287562","0.72483164","0.72483164","0.7183957","0.7183957","0.7179273","0.7179273","0.7164797","0.7164797","0.7159938","0.7159938","0.7157262","0.71421134","0.71328926","0.7093348","0.7093348","0.70899117","0.7084764","0.7050716","0.7050716","0.7050716","0.7047338","0.7046803","0.7043122","0.7043122","0.7043122","0.7043122","0.7043122","0.7043122","0.7043122","0.7018576","0.7018576","0.7018576","0.7018576","0.7018576","0.7018576","0.7018576","0.7018576","0.7018576"],"string":"[\n \"0.7724705\",\n \"0.7724705\",\n \"0.7695087\",\n \"0.7681344\",\n \"0.7667404\",\n \"0.7667404\",\n \"0.76382494\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7611839\",\n \"0.7565225\",\n \"0.7565225\",\n \"0.7564895\",\n \"0.7553599\",\n \"0.7553599\",\n \"0.7553599\",\n \"0.75523937\",\n \"0.7542392\",\n \"0.7540721\",\n \"0.7540721\",\n \"0.7540721\",\n \"0.7540721\",\n \"0.7540721\",\n \"0.7513849\",\n \"0.7500483\",\n \"0.74856174\",\n \"0.74856174\",\n \"0.74856174\",\n \"0.74856174\",\n \"0.74856174\",\n \"0.74856174\",\n \"0.74856174\",\n \"0.7479269\",\n \"0.7467435\",\n \"0.7467435\",\n \"0.7467435\",\n \"0.7467435\",\n \"0.7467435\",\n \"0.7467435\",\n \"0.7467435\",\n \"0.74168074\",\n \"0.74168074\",\n \"0.7287562\",\n \"0.72483164\",\n \"0.72483164\",\n \"0.7183957\",\n \"0.7183957\",\n \"0.7179273\",\n \"0.7179273\",\n \"0.7164797\",\n \"0.7164797\",\n \"0.7159938\",\n \"0.7159938\",\n \"0.7157262\",\n \"0.71421134\",\n \"0.71328926\",\n \"0.7093348\",\n \"0.7093348\",\n \"0.70899117\",\n \"0.7084764\",\n \"0.7050716\",\n \"0.7050716\",\n \"0.7050716\",\n \"0.7047338\",\n \"0.7046803\",\n \"0.7043122\",\n \"0.7043122\",\n \"0.7043122\",\n \"0.7043122\",\n \"0.7043122\",\n \"0.7043122\",\n \"0.7043122\",\n \"0.7018576\",\n \"0.7018576\",\n \"0.7018576\",\n \"0.7018576\",\n \"0.7018576\",\n \"0.7018576\",\n \"0.7018576\",\n \"0.7018576\",\n \"0.7018576\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":4699,"cells":{"query":{"kind":"string","value":"(protected) r = this << nDB"},"document":{"kind":"string","value":"function bnpDLShiftTo(n,r) {\n var i;\n for(i = this.t-1; i >= 0; --i) r[i+n] = this[i];\n for(i = n-1; i >= 0; --i) r[i] = 0;\n r.t = this.t+n;\n r.s = this.s;\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 db_wrapper(idb) {\n\t\tObject.defineProperty(this, \"_db\", {\n\t\t\tconfigurable: false,\n\t\t\tenumerable: false,\n\t\t\twritable: false,\n\t\t\tvalue: idb,\n\t\t});\n\n\t\tstores.forEach(function (store) {\n\t\t\tObject.defineProperty(this, store, {\n\t\t\t\tconfigurable: false,\n\t\t\t\tenumerable: true,\n\t\t\t\twritable: false,\n\t\t\t\tvalue: new store_wrapper(store, idb),\n\t\t\t});\n\t\t}, this);\n\t}","get record() {\n return new B_Record(this.get_record_bin());\n }","constructor(dbpf) {\n\t\tthis.dbpf = dbpf;\n\t\tthis.memRefs = new Set();\n\t\tfor (let { mem } of this.dbpf.memRefs()) {\n\t\t\tthis.memRefs.add(mem);\n\t\t}\n\t\tthis.$mem = 1;\n\t}","function appendDB (x) { db = AppendInefficient (db, list(x)); }","function BasicQueryableMemoryDB() {\n MemoryDB.apply(this, arguments);\n}","get dbRepresentation(){\n return Object.assign({}, this._obj);\n }","get data(){\r\n\t\treturn this.__data \r\n\t\t\t?? (this.__data = idb.createStore(this.__db__, this.__store__)) }","function pushDB (x) { db = cons (x, db); }","constructor() { this.leerDB(); }","get db() {\n return this._db;\n }","constructor() {\n this.db = level(chainDB);\n }","undo() {\n this.db._write(this.capture);\n return this.db;\n }","constructor (db) {\n super(db);\n }","constructor (db) {\n super(db);\n }","setR(r) {\nthis._r = r;\nreturn this;\n}","function gen_op_iwmmxt_ldb_raw()\n{\n gen_opc_ptr.push({func:op_iwmmxt_ldb_raw});\n}","function bnClone() {\n var r = nbi();\n this.copyTo(r);\n return r;\n } // (public) return value as integer","function i(){this.expando=me.expando+i.uid++}","function RegistryDatabase(db) {\n this.db = db;\n}","save() {\n this.db._write(this.data);\n return this.db;\n }","getWalkedRecordCopy() {}","db() { \n return new sqlite3.Database(this.db_file); \n }","write() {\n const statement = this.dbConnector.statements.set(this.params, this.writeBuffer);\n this.dbConnector.query(statement, this.onWriteResult.bind(this), [], true);\n }","function Database() {\n var id = null;\n this.getId = function () {return id;};\n\n if (1 == arguments.length && arguments[0][rhoUtil.rhoIdParam()]) {\n if (moduleNS != arguments[0][rhoUtil.rhoClassParam()]) {\n throw \"Wrong class instantiation!\";\n }\n id = arguments[0][rhoUtil.rhoIdParam()];\n } else {\n id = rhoUtil.nextId();\n // constructor methods are following:\n \n }\n }","function Br(t) {\n var e, n, r = qr(t.readTime), i = void 0 !== t.lastLimboFreeSnapshotVersion ? qr(t.lastLimboFreeSnapshotVersion) : B.min();\n return void 0 !== t.query.documents ? (O(1 === (n = t.query).documents.length), \n e = Zt(zt(Dn(n.documents[0])))) : e = function(t) {\n return Zt(Mn(t));\n }(t.query), new Rr(e, t.targetId, 0 /* Listen */ , t.lastListenSequenceNumber, r, i, X.fromBase64String(t.resumeToken))\n /** Encodes TargetData into a DbTarget for storage locally. */;\n}","_getIndexDBImpl() {\n return window.openDatabase ? shimIndexedDB || indexedDB : indexedDB;\n }","constructor(stmt, db) {\n this.stmt = stmt;\n this.db = db;\n this.pos = 1; // Index of the leftmost parameter is 1\n this.allocatedmem = []; // Pointers to allocated memory, that need to be freed when the statemend is destroyed\n }","mapToDb() {\n return {\n fullName: this.fullName,\n username: this.username,\n password: this.password,\n rank: this.rank,\n branch: this.branch,\n permissions: this.permissions || [PERMISSIONS.SOLDIER],\n isArchived: this.isArchived\n };\n }","function bnpRShiftTo(n, r) {\n\t var self = this\n\t r.s = self.s\n\t var ds = Math.floor(n / self.DB)\n\t if (ds >= self.t) {\n\t r.t = 0\n\t return\n\t }\n\t var bs = n % self.DB\n\t var cbs = self.DB - bs\n\t var bm = (1 << bs) - 1\n\t r[0] = self[ds] >> bs\n\t for (var i = ds + 1; i < self.t; ++i) {\n\t r[i - ds - 1] |= (self[i] & bm) << cbs\n\t r[i - ds] = self[i] >> bs\n\t }\n\t if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n\t r.t = self.t - ds\n\t r.clamp()\n\t}","function bnpRShiftTo(n, r) {\n\t var self = this\n\t r.s = self.s\n\t var ds = Math.floor(n / self.DB)\n\t if (ds >= self.t) {\n\t r.t = 0\n\t return\n\t }\n\t var bs = n % self.DB\n\t var cbs = self.DB - bs\n\t var bm = (1 << bs) - 1\n\t r[0] = self[ds] >> bs\n\t for (var i = ds + 1; i < self.t; ++i) {\n\t r[i - ds - 1] |= (self[i] & bm) << cbs\n\t r[i - ds] = self[i] >> bs\n\t }\n\t if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n\t r.t = self.t - ds\n\t r.clamp()\n\t}","function SDB(state) {\n var stack = state.stack;\n var n = stack.pop();\n\n if (exports.DEBUG) {\n console.log(state.step, 'SDB[]', n);\n }\n\n state.deltaBase = n;\n }","static getDb (): any {\n return getDbInstance()\n }","function getDB() {\n return db;\n}","function bnpRShiftTo(n,r) {\n\t r.s = this.s;\n\t var ds = Math.floor(n/this.DB);\n\t if(ds >= this.t) { r.t = 0; return; }\n\t var bs = n%this.DB;\n\t var cbs = this.DB-bs;\n\t var bm = (1<<bs)-1;\n\t r[0] = this[ds]>>bs;\n\t for(var i = ds+1; i < this.t; ++i) {\n\t r[i-ds-1] |= (this[i]&bm)<<cbs;\n\t r[i-ds] = this[i]>>bs;\n\t }\n\t if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;\n\t r.t = this.t-ds;\n\t r.clamp();\n\t}","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() { var r = nbi(); this.copyTo(r); return r; }","function bnClone() {\n var r = nbi();this.copyTo(r);return r;\n }","function bnClone() {\n var r = nbi();this.copyTo(r);return r;\n }","function bnClone() {\n var r = nbi();this.copyTo(r);return r;\n }","function bnpRShiftTo(n, r) {\r\n\t r.s = this.s;\r\n\t var ds = Math.floor(n / this.DB);\r\n\t if (ds >= this.t) {\r\n\t r.t = 0;\r\n\t return;\r\n\t }\r\n\t var bs = n % this.DB;\r\n\t var cbs = this.DB - bs;\r\n\t var bm = (1 << bs) - 1;\r\n\t r[0] = this[ds] >> bs;\r\n\t for (var i = ds + 1; i < this.t; ++i) {\r\n\t r[i - ds - 1] |= (this[i] & bm) << cbs;\r\n\t r[i - ds] = this[i] >> bs;\r\n\t }\r\n\t if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;\r\n\t r.t = this.t - ds;\r\n\t r.clamp();\r\n\t}","function bnpRShiftTo(n, r) {\r\n\t r.s = this.s;\r\n\t var ds = Math.floor(n / this.DB);\r\n\t if (ds >= this.t) {\r\n\t r.t = 0;\r\n\t return;\r\n\t }\r\n\t var bs = n % this.DB;\r\n\t var cbs = this.DB - bs;\r\n\t var bm = (1 << bs) - 1;\r\n\t r[0] = this[ds] >> bs;\r\n\t for (var i = ds + 1; i < this.t; ++i) {\r\n\t r[i - ds - 1] |= (this[i] & bm) << cbs;\r\n\t r[i - ds] = this[i] >> bs;\r\n\t }\r\n\t if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;\r\n\t r.t = this.t - ds;\r\n\t r.clamp();\r\n\t}","get_all_db_records_bin() {\n var res = [];\n res.push(this.get_record_bin());\n return res;\n }","copy() {\n return Record.create(getSnapshot(self))\n }","getDatabase() {\n return this.__db;\n }","function bnpRShiftTo(n, r) {\n var self = this\n r.s = self.s\n var ds = Math.floor(n / self.DB)\n if (ds >= self.t) {\n r.t = 0\n return\n }\n var bs = n % self.DB\n var cbs = self.DB - bs\n var bm = (1 << bs) - 1\n r[0] = self[ds] >> bs\n for (var i = ds + 1; i < self.t; ++i) {\n r[i - ds - 1] |= (self[i] & bm) << cbs\n r[i - ds] = self[i] >> bs\n }\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n r.t = self.t - ds\n r.clamp()\n}","function bnpRShiftTo(n, r) {\n var self = this\n r.s = self.s\n var ds = Math.floor(n / self.DB)\n if (ds >= self.t) {\n r.t = 0\n return\n }\n var bs = n % self.DB\n var cbs = self.DB - bs\n var bm = (1 << bs) - 1\n r[0] = self[ds] >> bs\n for (var i = ds + 1; i < self.t; ++i) {\n r[i - ds - 1] |= (self[i] & bm) << cbs\n r[i - ds] = self[i] >> bs\n }\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n r.t = self.t - ds\n r.clamp()\n}","function bnpRShiftTo(n, r) {\n var self = this\n r.s = self.s\n var ds = Math.floor(n / self.DB)\n if (ds >= self.t) {\n r.t = 0\n return\n }\n var bs = n % self.DB\n var cbs = self.DB - bs\n var bm = (1 << bs) - 1\n r[0] = self[ds] >> bs\n for (var i = ds + 1; i < self.t; ++i) {\n r[i - ds - 1] |= (self[i] & bm) << cbs\n r[i - ds] = self[i] >> bs\n }\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n r.t = self.t - ds\n r.clamp()\n}","function bnpRShiftTo(n, r) {\n var self = this\n r.s = self.s\n var ds = Math.floor(n / self.DB)\n if (ds >= self.t) {\n r.t = 0\n return\n }\n var bs = n % self.DB\n var cbs = self.DB - bs\n var bm = (1 << bs) - 1\n r[0] = self[ds] >> bs\n for (var i = ds + 1; i < self.t; ++i) {\n r[i - ds - 1] |= (self[i] & bm) << cbs\n r[i - ds] = self[i] >> bs\n }\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n r.t = self.t - ds\n r.clamp()\n}","function bnpRShiftTo(n, r) {\n var self = this\n r.s = self.s\n var ds = Math.floor(n / self.DB)\n if (ds >= self.t) {\n r.t = 0\n return\n }\n var bs = n % self.DB\n var cbs = self.DB - bs\n var bm = (1 << bs) - 1\n r[0] = self[ds] >> bs\n for (var i = ds + 1; i < self.t; ++i) {\n r[i - ds - 1] |= (self[i] & bm) << cbs\n r[i - ds] = self[i] >> bs\n }\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n r.t = self.t - ds\n r.clamp()\n}","function bnpRShiftTo(n, r) {\n var self = this\n r.s = self.s\n var ds = Math.floor(n / self.DB)\n if (ds >= self.t) {\n r.t = 0\n return\n }\n var bs = n % self.DB\n var cbs = self.DB - bs\n var bm = (1 << bs) - 1\n r[0] = self[ds] >> bs\n for (var i = ds + 1; i < self.t; ++i) {\n r[i - ds - 1] |= (self[i] & bm) << cbs\n r[i - ds] = self[i] >> bs\n }\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n r.t = self.t - ds\n r.clamp()\n}","function bnpRShiftTo(n, r) {\n var self = this\n r.s = self.s\n var ds = Math.floor(n / self.DB)\n if (ds >= self.t) {\n r.t = 0\n return\n }\n var bs = n % self.DB\n var cbs = self.DB - bs\n var bm = (1 << bs) - 1\n r[0] = self[ds] >> bs\n for (var i = ds + 1; i < self.t; ++i) {\n r[i - ds - 1] |= (self[i] & bm) << cbs\n r[i - ds] = self[i] >> bs\n }\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\n r.t = self.t - ds\n r.clamp()\n}","function bnpRShiftTo(n,r) {\n\t r.s = this.s;\n\t var ds = Math.floor(n/this.DB);\n\t if(ds >= this.t) { r.t = 0; return; }\n\t var bs = n%this.DB;\n\t var cbs = this.DB-bs;\n\t var bm = (1<<bs)-1;\n\t r[0] = this[ds]>>bs;\n\t for(var i = ds+1; i < this.t; ++i) {\n\t r[i-ds-1] |= (this[i]&bm)<<cbs;\n\t r[i-ds] = this[i]>>bs;\n\t }\n\t if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;\n\t r.t = this.t-ds;\n\t r.clamp();\n\t }","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}","function AbstractChainedBatch (db) {\n this._db = db\n this._operations = []\n this._written = false\n}"],"string":"[\n \"function db_wrapper(idb) {\\n\\t\\tObject.defineProperty(this, \\\"_db\\\", {\\n\\t\\t\\tconfigurable: false,\\n\\t\\t\\tenumerable: false,\\n\\t\\t\\twritable: false,\\n\\t\\t\\tvalue: idb,\\n\\t\\t});\\n\\n\\t\\tstores.forEach(function (store) {\\n\\t\\t\\tObject.defineProperty(this, store, {\\n\\t\\t\\t\\tconfigurable: false,\\n\\t\\t\\t\\tenumerable: true,\\n\\t\\t\\t\\twritable: false,\\n\\t\\t\\t\\tvalue: new store_wrapper(store, idb),\\n\\t\\t\\t});\\n\\t\\t}, this);\\n\\t}\",\n \"get record() {\\n return new B_Record(this.get_record_bin());\\n }\",\n \"constructor(dbpf) {\\n\\t\\tthis.dbpf = dbpf;\\n\\t\\tthis.memRefs = new Set();\\n\\t\\tfor (let { mem } of this.dbpf.memRefs()) {\\n\\t\\t\\tthis.memRefs.add(mem);\\n\\t\\t}\\n\\t\\tthis.$mem = 1;\\n\\t}\",\n \"function appendDB (x) { db = AppendInefficient (db, list(x)); }\",\n \"function BasicQueryableMemoryDB() {\\n MemoryDB.apply(this, arguments);\\n}\",\n \"get dbRepresentation(){\\n return Object.assign({}, this._obj);\\n }\",\n \"get data(){\\r\\n\\t\\treturn this.__data \\r\\n\\t\\t\\t?? (this.__data = idb.createStore(this.__db__, this.__store__)) }\",\n \"function pushDB (x) { db = cons (x, db); }\",\n \"constructor() { this.leerDB(); }\",\n \"get db() {\\n return this._db;\\n }\",\n \"constructor() {\\n this.db = level(chainDB);\\n }\",\n \"undo() {\\n this.db._write(this.capture);\\n return this.db;\\n }\",\n \"constructor (db) {\\n super(db);\\n }\",\n \"constructor (db) {\\n super(db);\\n }\",\n \"setR(r) {\\nthis._r = r;\\nreturn this;\\n}\",\n \"function gen_op_iwmmxt_ldb_raw()\\n{\\n gen_opc_ptr.push({func:op_iwmmxt_ldb_raw});\\n}\",\n \"function bnClone() {\\n var r = nbi();\\n this.copyTo(r);\\n return r;\\n } // (public) return value as integer\",\n \"function i(){this.expando=me.expando+i.uid++}\",\n \"function RegistryDatabase(db) {\\n this.db = db;\\n}\",\n \"save() {\\n this.db._write(this.data);\\n return this.db;\\n }\",\n \"getWalkedRecordCopy() {}\",\n \"db() { \\n return new sqlite3.Database(this.db_file); \\n }\",\n \"write() {\\n const statement = this.dbConnector.statements.set(this.params, this.writeBuffer);\\n this.dbConnector.query(statement, this.onWriteResult.bind(this), [], true);\\n }\",\n \"function Database() {\\n var id = null;\\n this.getId = function () {return id;};\\n\\n if (1 == arguments.length && arguments[0][rhoUtil.rhoIdParam()]) {\\n if (moduleNS != arguments[0][rhoUtil.rhoClassParam()]) {\\n throw \\\"Wrong class instantiation!\\\";\\n }\\n id = arguments[0][rhoUtil.rhoIdParam()];\\n } else {\\n id = rhoUtil.nextId();\\n // constructor methods are following:\\n \\n }\\n }\",\n \"function Br(t) {\\n var e, n, r = qr(t.readTime), i = void 0 !== t.lastLimboFreeSnapshotVersion ? qr(t.lastLimboFreeSnapshotVersion) : B.min();\\n return void 0 !== t.query.documents ? (O(1 === (n = t.query).documents.length), \\n e = Zt(zt(Dn(n.documents[0])))) : e = function(t) {\\n return Zt(Mn(t));\\n }(t.query), new Rr(e, t.targetId, 0 /* Listen */ , t.lastListenSequenceNumber, r, i, X.fromBase64String(t.resumeToken))\\n /** Encodes TargetData into a DbTarget for storage locally. */;\\n}\",\n \"_getIndexDBImpl() {\\n return window.openDatabase ? shimIndexedDB || indexedDB : indexedDB;\\n }\",\n \"constructor(stmt, db) {\\n this.stmt = stmt;\\n this.db = db;\\n this.pos = 1; // Index of the leftmost parameter is 1\\n this.allocatedmem = []; // Pointers to allocated memory, that need to be freed when the statemend is destroyed\\n }\",\n \"mapToDb() {\\n return {\\n fullName: this.fullName,\\n username: this.username,\\n password: this.password,\\n rank: this.rank,\\n branch: this.branch,\\n permissions: this.permissions || [PERMISSIONS.SOLDIER],\\n isArchived: this.isArchived\\n };\\n }\",\n \"function bnpRShiftTo(n, r) {\\n\\t var self = this\\n\\t r.s = self.s\\n\\t var ds = Math.floor(n / self.DB)\\n\\t if (ds >= self.t) {\\n\\t r.t = 0\\n\\t return\\n\\t }\\n\\t var bs = n % self.DB\\n\\t var cbs = self.DB - bs\\n\\t var bm = (1 << bs) - 1\\n\\t r[0] = self[ds] >> bs\\n\\t for (var i = ds + 1; i < self.t; ++i) {\\n\\t r[i - ds - 1] |= (self[i] & bm) << cbs\\n\\t r[i - ds] = self[i] >> bs\\n\\t }\\n\\t if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n\\t r.t = self.t - ds\\n\\t r.clamp()\\n\\t}\",\n \"function bnpRShiftTo(n, r) {\\n\\t var self = this\\n\\t r.s = self.s\\n\\t var ds = Math.floor(n / self.DB)\\n\\t if (ds >= self.t) {\\n\\t r.t = 0\\n\\t return\\n\\t }\\n\\t var bs = n % self.DB\\n\\t var cbs = self.DB - bs\\n\\t var bm = (1 << bs) - 1\\n\\t r[0] = self[ds] >> bs\\n\\t for (var i = ds + 1; i < self.t; ++i) {\\n\\t r[i - ds - 1] |= (self[i] & bm) << cbs\\n\\t r[i - ds] = self[i] >> bs\\n\\t }\\n\\t if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n\\t r.t = self.t - ds\\n\\t r.clamp()\\n\\t}\",\n \"function SDB(state) {\\n var stack = state.stack;\\n var n = stack.pop();\\n\\n if (exports.DEBUG) {\\n console.log(state.step, 'SDB[]', n);\\n }\\n\\n state.deltaBase = n;\\n }\",\n \"static getDb (): any {\\n return getDbInstance()\\n }\",\n \"function getDB() {\\n return db;\\n}\",\n \"function bnpRShiftTo(n,r) {\\n\\t r.s = this.s;\\n\\t var ds = Math.floor(n/this.DB);\\n\\t if(ds >= this.t) { r.t = 0; return; }\\n\\t var bs = n%this.DB;\\n\\t var cbs = this.DB-bs;\\n\\t var bm = (1<<bs)-1;\\n\\t r[0] = this[ds]>>bs;\\n\\t for(var i = ds+1; i < this.t; ++i) {\\n\\t r[i-ds-1] |= (this[i]&bm)<<cbs;\\n\\t r[i-ds] = this[i]>>bs;\\n\\t }\\n\\t if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;\\n\\t r.t = this.t-ds;\\n\\t r.clamp();\\n\\t}\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() { var r = nbi(); this.copyTo(r); return r; }\",\n \"function bnClone() {\\n var r = nbi();this.copyTo(r);return r;\\n }\",\n \"function bnClone() {\\n var r = nbi();this.copyTo(r);return r;\\n }\",\n \"function bnClone() {\\n var r = nbi();this.copyTo(r);return r;\\n }\",\n \"function bnpRShiftTo(n, r) {\\r\\n\\t r.s = this.s;\\r\\n\\t var ds = Math.floor(n / this.DB);\\r\\n\\t if (ds >= this.t) {\\r\\n\\t r.t = 0;\\r\\n\\t return;\\r\\n\\t }\\r\\n\\t var bs = n % this.DB;\\r\\n\\t var cbs = this.DB - bs;\\r\\n\\t var bm = (1 << bs) - 1;\\r\\n\\t r[0] = this[ds] >> bs;\\r\\n\\t for (var i = ds + 1; i < this.t; ++i) {\\r\\n\\t r[i - ds - 1] |= (this[i] & bm) << cbs;\\r\\n\\t r[i - ds] = this[i] >> bs;\\r\\n\\t }\\r\\n\\t if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;\\r\\n\\t r.t = this.t - ds;\\r\\n\\t r.clamp();\\r\\n\\t}\",\n \"function bnpRShiftTo(n, r) {\\r\\n\\t r.s = this.s;\\r\\n\\t var ds = Math.floor(n / this.DB);\\r\\n\\t if (ds >= this.t) {\\r\\n\\t r.t = 0;\\r\\n\\t return;\\r\\n\\t }\\r\\n\\t var bs = n % this.DB;\\r\\n\\t var cbs = this.DB - bs;\\r\\n\\t var bm = (1 << bs) - 1;\\r\\n\\t r[0] = this[ds] >> bs;\\r\\n\\t for (var i = ds + 1; i < this.t; ++i) {\\r\\n\\t r[i - ds - 1] |= (this[i] & bm) << cbs;\\r\\n\\t r[i - ds] = this[i] >> bs;\\r\\n\\t }\\r\\n\\t if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;\\r\\n\\t r.t = this.t - ds;\\r\\n\\t r.clamp();\\r\\n\\t}\",\n \"get_all_db_records_bin() {\\n var res = [];\\n res.push(this.get_record_bin());\\n return res;\\n }\",\n \"copy() {\\n return Record.create(getSnapshot(self))\\n }\",\n \"getDatabase() {\\n return this.__db;\\n }\",\n \"function bnpRShiftTo(n, r) {\\n var self = this\\n r.s = self.s\\n var ds = Math.floor(n / self.DB)\\n if (ds >= self.t) {\\n r.t = 0\\n return\\n }\\n var bs = n % self.DB\\n var cbs = self.DB - bs\\n var bm = (1 << bs) - 1\\n r[0] = self[ds] >> bs\\n for (var i = ds + 1; i < self.t; ++i) {\\n r[i - ds - 1] |= (self[i] & bm) << cbs\\n r[i - ds] = self[i] >> bs\\n }\\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n r.t = self.t - ds\\n r.clamp()\\n}\",\n \"function bnpRShiftTo(n, r) {\\n var self = this\\n r.s = self.s\\n var ds = Math.floor(n / self.DB)\\n if (ds >= self.t) {\\n r.t = 0\\n return\\n }\\n var bs = n % self.DB\\n var cbs = self.DB - bs\\n var bm = (1 << bs) - 1\\n r[0] = self[ds] >> bs\\n for (var i = ds + 1; i < self.t; ++i) {\\n r[i - ds - 1] |= (self[i] & bm) << cbs\\n r[i - ds] = self[i] >> bs\\n }\\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n r.t = self.t - ds\\n r.clamp()\\n}\",\n \"function bnpRShiftTo(n, r) {\\n var self = this\\n r.s = self.s\\n var ds = Math.floor(n / self.DB)\\n if (ds >= self.t) {\\n r.t = 0\\n return\\n }\\n var bs = n % self.DB\\n var cbs = self.DB - bs\\n var bm = (1 << bs) - 1\\n r[0] = self[ds] >> bs\\n for (var i = ds + 1; i < self.t; ++i) {\\n r[i - ds - 1] |= (self[i] & bm) << cbs\\n r[i - ds] = self[i] >> bs\\n }\\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n r.t = self.t - ds\\n r.clamp()\\n}\",\n \"function bnpRShiftTo(n, r) {\\n var self = this\\n r.s = self.s\\n var ds = Math.floor(n / self.DB)\\n if (ds >= self.t) {\\n r.t = 0\\n return\\n }\\n var bs = n % self.DB\\n var cbs = self.DB - bs\\n var bm = (1 << bs) - 1\\n r[0] = self[ds] >> bs\\n for (var i = ds + 1; i < self.t; ++i) {\\n r[i - ds - 1] |= (self[i] & bm) << cbs\\n r[i - ds] = self[i] >> bs\\n }\\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n r.t = self.t - ds\\n r.clamp()\\n}\",\n \"function bnpRShiftTo(n, r) {\\n var self = this\\n r.s = self.s\\n var ds = Math.floor(n / self.DB)\\n if (ds >= self.t) {\\n r.t = 0\\n return\\n }\\n var bs = n % self.DB\\n var cbs = self.DB - bs\\n var bm = (1 << bs) - 1\\n r[0] = self[ds] >> bs\\n for (var i = ds + 1; i < self.t; ++i) {\\n r[i - ds - 1] |= (self[i] & bm) << cbs\\n r[i - ds] = self[i] >> bs\\n }\\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n r.t = self.t - ds\\n r.clamp()\\n}\",\n \"function bnpRShiftTo(n, r) {\\n var self = this\\n r.s = self.s\\n var ds = Math.floor(n / self.DB)\\n if (ds >= self.t) {\\n r.t = 0\\n return\\n }\\n var bs = n % self.DB\\n var cbs = self.DB - bs\\n var bm = (1 << bs) - 1\\n r[0] = self[ds] >> bs\\n for (var i = ds + 1; i < self.t; ++i) {\\n r[i - ds - 1] |= (self[i] & bm) << cbs\\n r[i - ds] = self[i] >> bs\\n }\\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n r.t = self.t - ds\\n r.clamp()\\n}\",\n \"function bnpRShiftTo(n, r) {\\n var self = this\\n r.s = self.s\\n var ds = Math.floor(n / self.DB)\\n if (ds >= self.t) {\\n r.t = 0\\n return\\n }\\n var bs = n % self.DB\\n var cbs = self.DB - bs\\n var bm = (1 << bs) - 1\\n r[0] = self[ds] >> bs\\n for (var i = ds + 1; i < self.t; ++i) {\\n r[i - ds - 1] |= (self[i] & bm) << cbs\\n r[i - ds] = self[i] >> bs\\n }\\n if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs\\n r.t = self.t - ds\\n r.clamp()\\n}\",\n \"function bnpRShiftTo(n,r) {\\n\\t r.s = this.s;\\n\\t var ds = Math.floor(n/this.DB);\\n\\t if(ds >= this.t) { r.t = 0; return; }\\n\\t var bs = n%this.DB;\\n\\t var cbs = this.DB-bs;\\n\\t var bm = (1<<bs)-1;\\n\\t r[0] = this[ds]>>bs;\\n\\t for(var i = ds+1; i < this.t; ++i) {\\n\\t r[i-ds-1] |= (this[i]&bm)<<cbs;\\n\\t r[i-ds] = this[i]>>bs;\\n\\t }\\n\\t if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;\\n\\t r.t = this.t-ds;\\n\\t r.clamp();\\n\\t }\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\",\n \"function AbstractChainedBatch (db) {\\n this._db = db\\n this._operations = []\\n this._written = false\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5814989","0.5600617","0.5564867","0.55613804","0.5514192","0.54521364","0.5375183","0.5350181","0.532378","0.5322483","0.5318495","0.5165761","0.5160849","0.5160849","0.5146469","0.51333195","0.5132165","0.512582","0.5124944","0.509832","0.50938004","0.50562215","0.5039593","0.50230074","0.5018389","0.5008492","0.5000091","0.49949205","0.4994091","0.4994091","0.49833357","0.49687907","0.4957116","0.49530694","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49440128","0.49419758","0.49419758","0.49419758","0.4940182","0.4940182","0.49342033","0.4932229","0.49231893","0.49215627","0.49215627","0.49215627","0.49215627","0.49215627","0.49215627","0.49215627","0.4917353","0.4915926","0.4915926","0.4915926","0.4915926","0.4915926","0.4915926","0.4915926","0.4915926","0.4915926"],"string":"[\n \"0.5814989\",\n \"0.5600617\",\n \"0.5564867\",\n \"0.55613804\",\n \"0.5514192\",\n \"0.54521364\",\n \"0.5375183\",\n \"0.5350181\",\n \"0.532378\",\n \"0.5322483\",\n \"0.5318495\",\n \"0.5165761\",\n \"0.5160849\",\n \"0.5160849\",\n \"0.5146469\",\n \"0.51333195\",\n \"0.5132165\",\n \"0.512582\",\n \"0.5124944\",\n \"0.509832\",\n \"0.50938004\",\n \"0.50562215\",\n \"0.5039593\",\n \"0.50230074\",\n \"0.5018389\",\n \"0.5008492\",\n \"0.5000091\",\n \"0.49949205\",\n \"0.4994091\",\n \"0.4994091\",\n \"0.49833357\",\n \"0.49687907\",\n \"0.4957116\",\n \"0.49530694\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49440128\",\n \"0.49419758\",\n \"0.49419758\",\n \"0.49419758\",\n \"0.4940182\",\n \"0.4940182\",\n \"0.49342033\",\n \"0.4932229\",\n \"0.49231893\",\n \"0.49215627\",\n \"0.49215627\",\n \"0.49215627\",\n \"0.49215627\",\n \"0.49215627\",\n \"0.49215627\",\n \"0.49215627\",\n \"0.4917353\",\n \"0.4915926\",\n \"0.4915926\",\n \"0.4915926\",\n \"0.4915926\",\n \"0.4915926\",\n \"0.4915926\",\n \"0.4915926\",\n \"0.4915926\",\n \"0.4915926\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":46,"numItemsPerPage":100,"numTotalItems":82052,"offset":4600,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3Nzk3MTczMiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhc2NyaXB0LXYxIiwiZXhwIjoxNzc3OTc1MzMyLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.9b3tAkAy3FTpTCtmZTt6zbL-fy2xF1r9gTZ22gzfIiXeLaZ7dYcrdz9fgX67_tdfo0juBUYhTNznSJoQ3VJRDw","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 |
|---|---|---|---|---|---|---|
Process the argument ISF file name | function ParseArguments()
{
// Assume failure
var RC = false;
var Txt = "";
var Help =
"Syntax: CScript HDRLockedFingers.js <ISF File Name> [Excel File Name]\n"
+ "Eg: CScript HDRLockedFingers.js \"HDR Finger.isf\" \"HDR Finger.xls\"\n";
// Grab the shell
var SH = new ActiveXObject( "WS... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function handleArg(argv){\n //when arguement is a filename\n if(argv.f){\n readFile(argv.f)\n //when arguemnt is a url\n }else if(argv.u){\n checkUrlAndReport(argv.u)\n }\n}",
"function FileName() { }",
"function inputName(arg) {\n if(arg==undefined) return;\n if((arg[0]=='h'... | [
"0.55536985",
"0.53700435",
"0.5359511",
"0.53029966",
"0.52980417",
"0.52587706",
"0.5248428",
"0.52332395",
"0.5189357",
"0.517219",
"0.5160977",
"0.5111586",
"0.5103232",
"0.5071891",
"0.50233656",
"0.49894962",
"0.49629313",
"0.49336845",
"0.49180362",
"0.49118653",
"0.49... | 0.45494157 | 65 |
Perform analysis (obtain locked fingers data from ISF file) | function Analyze()
{
// Assume failure
var RC = false;
var Txt = "";
Txt = "Loading ISF file:\n" + ISFAbsolutePath;
WScript.StdOut.WriteLine( Txt );
// Load the item store file
var Handle = IISF.LoadItemStore( ISFAbsolutePath );
if (Handle == 0xFFFFFFFF)
{
Txt = "Unable to load ISF:\... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Execute()\n{\n // Parse out arguments\n var RC = ParseArguments();\n if (RC == false)\n {\n return;\n }\n\n // Initialize ISF automation interface\n RC = Initialize();\n if (RC == false)\n {\n return;\n }\n\n // Obtain locked fingers data from ISF file\n RC = Analyze();\n... | [
"0.5383484",
"0.5293031",
"0.5265998",
"0.5205388",
"0.5131746",
"0.5112181",
"0.5105427",
"0.50269777",
"0.49450845",
"0.4923091",
"0.49006742",
"0.48756954",
"0.4822329",
"0.48097256",
"0.4806594",
"0.4760821",
"0.472762",
"0.4721916",
"0.4721916",
"0.472061",
"0.46977198",... | 0.53028893 | 1 |
Generate an Excel spreadsheet with the analysis results | function GenerateExcelSpreadsheet()
{
// Assume failure
var RC = false;
var Txt = "";
// Start Excel and get automation object
var XL = new ActiveXObject( "Excel.Application" );
if (XL == null)
{
Txt = "Error launching Excel";
WScript.StdOut.WriteLine( Txt );
return RC;
}
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function createReports() {\r\n var RawDataReport = AdWordsApp.report(\"SELECT Domain, Clicks \" + \"FROM AUTOMATIC_PLACEMENTS_PERFORMANCE_REPORT \" + \"WHERE Clicks > 0 \" + \"AND Conversions < 1 \" + \"DURING LAST_7_DAYS\");\r\n RawDataReport.exportToSheet(RawDataReportSheet);\r\n}",
"function writeCalcu... | [
"0.6222583",
"0.62089926",
"0.6159351",
"0.6130673",
"0.60925",
"0.60206217",
"0.5994975",
"0.5980732",
"0.5980444",
"0.59343266",
"0.5907707",
"0.58989424",
"0.58714694",
"0.5857018",
"0.5818055",
"0.58031404",
"0.58006537",
"0.5750388",
"0.5738071",
"0.57039016",
"0.5661787... | 0.5456599 | 41 |
Populate Excel spreadsheet with analysis data | function PopulateExcelSpreadsheet( Sheet )
{
// Assume failure
var RC = false;
Sheet.Cells( 1, 1 ).Value = "Total Samples";
Sheet.Cells( 1, 1 ).Font.Bold = true;
Sheet.Cells( 1, 1 ).ColumnWidth = 14;
Sheet.Cells( 1, 2 ).Value = gSamples;
Sheet.Cells( 2, 1 ).Value = "Locked Fingers";
Sheet.Cell... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function PopulateExcelSpreadsheet( Sheet )\n{\n // Assume failure\n var RC = false;\n\n Sheet.Cells( 1, 1 ).Value = \"Camped Cell Samples\";\n Sheet.Cells( 1, 1 ).Font.Bold = true;\n Sheet.Cells( 1, 2 ).Value = gCampedSamples;\n\n Sheet.Cells( 2, 1 ).Value = \"Best Cell Samples\";\n Sheet.Cells( 2, 1... | [
"0.67145187",
"0.62211055",
"0.62096936",
"0.612006",
"0.61181134",
"0.6088887",
"0.60420173",
"0.597469",
"0.5963698",
"0.5940129",
"0.58284754",
"0.5788499",
"0.5760381",
"0.57247156",
"0.5706517",
"0.5704335",
"0.56910205",
"0.5661749",
"0.5639755",
"0.55928975",
"0.559070... | 0.5967155 | 8 |
Main body of script | function Execute()
{
// Parse out arguments
var RC = ParseArguments();
if (RC == false)
{
return;
}
// Initialize ISF automation interface
RC = Initialize();
if (RC == false)
{
return;
}
// Obtain locked fingers data from ISF file
RC = Analyze();
if (RC == false)
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Script() {}",
"function main() {\r\n\t// Init the myGM functions.\r\n\tmyGM.init();\r\n\r\n\t// If the script was already executed, do nothing.\r\n\tif(myGM.$('#' + myGM.prefix + 'alreadyExecutedScript'))\treturn;\r\n\r\n\t// Add the hint, that the script was already executed.\r\n\tvar alreadyExecuted\t... | [
"0.7165051",
"0.7107813",
"0.6833344",
"0.6792179",
"0.6684481",
"0.66397905",
"0.6564415",
"0.6532038",
"0.6510321",
"0.64907974",
"0.6485136",
"0.6476064",
"0.64310676",
"0.640327",
"0.63867325",
"0.6366844",
"0.63439775",
"0.6329587",
"0.6311022",
"0.6307362",
"0.62917274"... | 0.0 | -1 |
adding new cards to dom | function addItemtoDom(event) {
event.preventDefault();
const colnumber = event.currentTarget.dataset.colnumber;
const inputField = $(`#addCard${colnumber}`);
const inputValue = inputField.val();
const newItem = {};
//give each column unique date
const uniqueId = Date.now();
console.log("... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function addEachCard(div) {\n document.getElementById(\"observation-cards\").appendChild(div);\n}",
"function addingCards(newCards) {\n $(\".card-group\").html(\"\");\n for (let i = 0; i < newCards.length; i++) {\n $(\".card-group\").append(newCards[i]);\n }\n}",
"function AddCards(allCards) {... | [
"0.7971572",
"0.78237605",
"0.7815331",
"0.7746124",
"0.75726765",
"0.75204164",
"0.74663734",
"0.7434464",
"0.7406498",
"0.74064136",
"0.7401438",
"0.73679054",
"0.7351043",
"0.7347119",
"0.7344003",
"0.7342261",
"0.7339863",
"0.73112017",
"0.7298399",
"0.7288684",
"0.728067... | 0.0 | -1 |
Funcion que permite cargar la informacion de los controles de la ventana winFrmCgg_res_tipo_tramite. | function cargarCgg_res_tipo_tramiteCtrls(){
if(inRecordCgg_res_tipo_tramite){
txtCrtpt_codigo.setValue(inRecordCgg_res_tipo_tramite.get('CRTPT_CODIGO'));
txtCrtpt_nombre.setValue(inRecordCgg_res_tipo_tramite.get('CRTPT_NOMBRE'));
txtCrtpt_abreviatura.setValue(inRecordCgg_res_tipo_tramite.get('CRTPT_ABREVIATU... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function cargarCgg_res_beneficiarioCtrls(){\n if(inInfoPersona.CRPER_CODIGO_AUSPICIANTE != undefined && inInfoPersona.CRPER_CODIGO_AUSPICIANTE.length>0){\n if(inInfoPersona.CRPJR_CODIGO.length>0)\n {\n txtCrper_codigo.setValue(inInfoPersona.CRPJR_RAZON_SOCIAL);\n ... | [
"0.70468134",
"0.6995546",
"0.6770277",
"0.67004454",
"0.66322136",
"0.652097",
"0.64441854",
"0.6369144",
"0.6304318",
"0.6212062",
"0.6144936",
"0.61073387",
"0.6054101",
"0.60518086",
"0.5889436",
"0.5856644",
"0.58169246",
"0.5762397",
"0.5759952",
"0.57533777",
"0.565848... | 0.80802685 | 0 |
The bookstore example uses a simple, inmemory database for illustrative purposes only. | function inMemoryDatabase() {
this.shelves = {};
this.id = 0;
var db = this;
db.createShelf('Fiction', function(err, fiction) {
db.createBook(fiction.id, 'Neal Stephenson', 'REAMDE', function(){});
});
db.createShelf('Fantasy', function(err, fantasy) {
db.createBook... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function booksInBookshelf(id) {\n// var db = ScriptDb.getMyDb();\n var dbShelf = ParseDb.getMyDb(applicationId, restApiKey, \"bookshelf\");\n var dbGen = ParseDb.getMyDb(applicationId, restApiKey, \"book_generic\");\n var books = []; \n var bookshelf = dbShelf.load(id);\n \n for (var i = 0 ; i < bookshelf.... | [
"0.65561855",
"0.64541733",
"0.6342942",
"0.6342942",
"0.62446105",
"0.6206391",
"0.6196477",
"0.6141604",
"0.6138874",
"0.6064659",
"0.6064659",
"0.603558",
"0.6026368",
"0.6025438",
"0.60168475",
"0.6015919",
"0.6014612",
"0.6013844",
"0.601143",
"0.5985367",
"0.59779066",
... | 0.74283147 | 0 |
If raw data provided, give this data to each plugin, for either streaming or nonstreaming plugins (preferring the nonstreaming interface) and then return the result of the first plugin to produce an output. Extensionmatched plugins take priority over MIMEmatched plugins. | function loadData(data, plugins, next) {
async.map(plugins, function(plugin, next) {
if(plugin.load instanceof Function) {
try {
plugin.load(data);
} catch(e) {
plugins.splice(plugins.indexOf(plugin), 1);
}
} else {
try {
plugin.stream(data);
} catch(e) {
plugins.splice(plugins.index... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function pluginData(data) {\r\n // if (!data.result || data.result.length == 0) {\r\n // return;\r\n // }\r\n\r\n switch (data.method) {\r\n // This is here so plugins not using JS can run JS code.\r\n case 'eval':\r\n eval(data.params);\r\n break;\r\n\r\n case 'log':\r\n cons... | [
"0.5340591",
"0.52842176",
"0.49914593",
"0.4940922",
"0.4870833",
"0.48523527",
"0.4847092",
"0.48440716",
"0.48066893",
"0.475991",
"0.47563764",
"0.47371867",
"0.47350153",
"0.47303733",
"0.46849784",
"0.4680363",
"0.46726793",
"0.46650863",
"0.46170825",
"0.46162766",
"0.... | 0.51387393 | 2 |
Turn the ``cols`` object into a CSV string | function toString() {
// If there are any results
if(module.exports.cols instanceof Object) {
// Get the list of columns
var columns = Object.keys(module.exports.cols);
// And determine how many rows exist with a map-reduce of each column's length
var rows = columns.map(function(column) {
return module.exp... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static tableToCsv(columns, data) {\n let csv = '';\n let i;\n\n for (i = 0; i < columns.length; i++) {\n csv += ExperimentView.csvEscape(columns[i]);\n if (i < columns.length - 1) {\n csv += ',';\n }\n }\n csv += '\\n';\n\n for (i = 0; i < data.length; i++) {\n for (let... | [
"0.7343767",
"0.6465807",
"0.64262605",
"0.63624156",
"0.6087266",
"0.606725",
"0.5989563",
"0.59763926",
"0.59590274",
"0.5917005",
"0.5848988",
"0.58420706",
"0.58368874",
"0.5815534",
"0.5803173",
"0.578276",
"0.578276",
"0.5758503",
"0.5710925",
"0.5710925",
"0.5680611",
... | 0.7055212 | 1 |
Queries form from the DOM document. Reregisters event listener to the form element. | refresh() {
this._setForm();
let data = this._eventData;
this._eventData = [];
for (let item of data) {
this.addElementListener(item.event, item.name, item.listener, item.options);
}
data = this._submitData;
this._submitData = [];
for (let ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"removeForm() {\n if (this.$formContainer === null) {\n return;\n }\n\n delete this.formSaveAjax;\n // Allow form widgets to detach properly.\n Drupal.detachBehaviors(this.$formContainer.get(0), null, 'unload');\n this.$formContainer\n .off('change.quicked... | [
"0.5764669",
"0.5510994",
"0.5470158",
"0.5444036",
"0.53967774",
"0.52977955",
"0.52552336",
"0.52324224",
"0.5222056",
"0.5200516",
"0.5123161",
"0.51040363",
"0.50716543",
"0.50447",
"0.50371873",
"0.503678",
"0.49965283",
"0.49911445",
"0.49903798",
"0.49865714",
"0.49832... | 0.0 | -1 |
Setup the form and form elements. | _setForm() {
this.$form = $(this._selector);
this._form = this.$form[0];
if (!(this._form instanceof HTMLFormElement)) {
if (typeof this._selector === 'string') {
throw new TypeError(`Form with selector "${this._selector}" does not exist.`);
}
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function initForm(){\n\t\tsetActions();\n\t\tvalidateForm();\n\t}",
"function initForms () {\n selectize.initSelectize()\n forms.initDefaultForm()\n comment.initCommentForm()\n tutorial.initTutorialForm()\n}",
"function setupForm() {\n Handlebars.registerHelper('if_eq', function(a, b, options) {\n if (... | [
"0.7110128",
"0.7036048",
"0.70315325",
"0.67525756",
"0.67270064",
"0.6717746",
"0.66373134",
"0.6586088",
"0.6563755",
"0.6522459",
"0.64559317",
"0.6407964",
"0.6320936",
"0.6294984",
"0.62676066",
"0.62274134",
"0.6207327",
"0.6187857",
"0.6102384",
"0.60815674",
"0.60472... | 0.5941753 | 27 |
console.log('estado:', deputadosPorEstado); console.log('partido:', deputadosPorPartido); | function calculateColor(uf){
uf = deputadosPorEstado[uf];
var color = '';
var diff= uf.FAVOR - uf.CONTRA;
if(diff === 0){
// indeciso
return "#ffc107";
} else if( diff > 0 ){
// democrático
return "#3f51b5";
} else if ( diff < 0 ){
// golpista
return "#4caf50";
}
var colorRange=(... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function reservacion(completo,opciones){\n /* opciones = opciones || {};\n if(completo)\n console.log(opciones.metodoPago);\n else\n console.log('No se pudo completar la operación'); */\n let {metodoPago,cantidad,dias}=opciones\n console.log(metodoPago);\n console.log(cantidad);\... | [
"0.65330416",
"0.63887185",
"0.638188",
"0.63695097",
"0.62548435",
"0.61450475",
"0.6071263",
"0.58638805",
"0.5851418",
"0.58471674",
"0.58454746",
"0.5810766",
"0.5786878",
"0.5772935",
"0.57442033",
"0.5712702",
"0.5690157",
"0.5678077",
"0.56699264",
"0.5664137",
"0.5637... | 0.0 | -1 |
Draw ship on canvas | function drawShip() {
ctx.beginPath();
ctx.arc(ship.x, ship.y, ship.size, 0, Math.PI * 2);
ctx.fillStyle = "#0095dd";
ctx.fill();
ctx.closePath();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function drawShip(x, y, a, color = \"#fff\") {\n\tcontext.strokeStyle = color;\n\tcontext.lineWidth = shipSize / 20;\n\tcontext.beginPath();\n\tcontext.moveTo(\n\t\tx + 5 / 3 * ship.r * Math.cos(a),\n\t\ty - 5 / 3 * ship.r * Math.sin(a)\n\t);\n\tcontext.lineTo(\n\t\tx - ship.r * (2 / 3 * Math.cos(a) + Math.sin(a))... | [
"0.73307246",
"0.7292945",
"0.7240514",
"0.70968914",
"0.70679927",
"0.70678055",
"0.69460505",
"0.69313395",
"0.6819617",
"0.68084806",
"0.6673084",
"0.66211444",
"0.6565242",
"0.6541813",
"0.6518426",
"0.6476916",
"0.646885",
"0.6449862",
"0.6442341",
"0.64351207",
"0.64258... | 0.7736465 | 0 |
Draw missile on canvas | function drawMissile() {
ctx.beginPath();
ctx.arc(missile.x, missile.y, missile.size, 0, Math.PI * 2);
ctx.fillStyle = "#0095dd";
ctx.fill();
ctx.closePath();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Missile( options ){\n \tthis.startX = options.startX;\n \tthis.startY = options.startY;\n \tthis.endX = options.endX;\n \tthis.endY = options.endY;\n \tthis.color = options.color;\n \tthis.trailColor = options.trailColor;\n \tthis.x = options.startX;\n \tthis.y = options.startY;\n \tthis.state = ... | [
"0.6862109",
"0.6411843",
"0.6185355",
"0.6176331",
"0.61517423",
"0.6122696",
"0.6122202",
"0.61017275",
"0.6084033",
"0.6066001",
"0.6053716",
"0.6047882",
"0.6027432",
"0.6023979",
"0.60232294",
"0.6017285",
"0.6011078",
"0.60078675",
"0.59658724",
"0.59592927",
"0.5908518... | 0.7736583 | 0 |
Move missile on canvas | function moveMissile() {
missile.y += missile.dy;
requestAnimationFrame(moveMissile);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function move_missiles()\n{\t\t\t\n\tmissile_timer -= 1;\n\tfor(var i = 0;i<missiles.length;i++)\n\t{\n\t\tif (missiles[i]['direction'] == 'right')\n\t\t{\n\t\t\tmissiles[i]['position'][0] += 10;\n\t\t}\n\t\telse if (missiles[i]['direction'] == 'left')\n\t\t{\n\t\t\tmissiles[i]['position'][0] -= 10;\n\t\t}\n\t\tel... | [
"0.7381109",
"0.6911517",
"0.68255615",
"0.6734111",
"0.6728306",
"0.66694015",
"0.65017676",
"0.648861",
"0.64335585",
"0.6285051",
"0.628246",
"0.62708956",
"0.6267049",
"0.6234154",
"0.62236005",
"0.6216867",
"0.6204717",
"0.61236006",
"0.61117524",
"0.6107199",
"0.6106169... | 0.76470906 | 0 |
Move ship on canvas | function moveShip() {
ship.x += ship.dx;
// Wall collision (right/left)
if (ship.x + ship.size > canvas.width) {
ship.x = canvas.width - ship.size;
}
if (ship.x < 0) {
ship.x = 0;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function updateShip() {\n\tif (shipX <= 0) {\n\t\tshipX = 0;\n\t}\n\tif (shipX + ship.width >= canvas.width) {\n\t\tshipX = canvas.width - ship.width;\n\t}\n\tshipX = shipX + shipDx;\n\tif (shipY <= 0) {\n\t\tshipY = 0;\n\t}\n\tif (shipY + ship.height >= canvas.height) {\n\t\tshipY = canvas.height - ship.height;\n... | [
"0.7938656",
"0.7266769",
"0.7181889",
"0.7178855",
"0.715526",
"0.7044651",
"0.7015255",
"0.70127255",
"0.70070595",
"0.69112563",
"0.6906098",
"0.68490624",
"0.6842384",
"0.68394476",
"0.6830848",
"0.68249065",
"0.6810121",
"0.67809856",
"0.67587775",
"0.6752165",
"0.674693... | 0.78305084 | 1 |
Update canvas drawing and animation | function update() {
moveShip();
// Draw everything
draw();
requestAnimationFrame(update);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function animate() {\n\treqAnimFrame(animate);\n\tcanvasDraw();\n}",
"function update() {\r\n if (!animating) return;\r\n draw();\r\n requestAnimationFrame(update);\r\n }",
"function updateCanvas() {\n clearGraph();\n\n updatePoints();\n}",
"function animate() {\n update();\n ... | [
"0.7890532",
"0.78426087",
"0.76418555",
"0.75344515",
"0.74478054",
"0.74158657",
"0.74130356",
"0.73673016",
"0.73492616",
"0.72663087",
"0.72492373",
"0.7226727",
"0.7204215",
"0.7154049",
"0.7119781",
"0.71090126",
"0.71090126",
"0.71090126",
"0.70958084",
"0.7063793",
"0... | 0.0 | -1 |
Generate a new easing function. function to avoid JS Hint error "Don't make functions within a loop" | function generateNewEasingFunc(resumePercent, remainPercent, scale, originalEasing) {
return function easingFunc(percent) {
const newPercent = resumePercent + remainPercent * percent;
return scale(originalEasing(newPercent));
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static out(easing) {\n return t => 1 - easing(1 - t)\n }",
"static out(easing) {\n return t => 1 - easing(1 - t);\n }",
"function makeEaseOut(timing) {\n return function (timeFraction) {\n return 1 - timing(1 - timeFraction);\n }\n}",
"function createEasingFunction(easing, ea... | [
"0.70288706",
"0.6972033",
"0.6958702",
"0.67244637",
"0.6699543",
"0.6690426",
"0.6625007",
"0.6615669",
"0.6559035",
"0.65099674",
"0.65099674",
"0.64860874",
"0.6348254",
"0.6333551",
"0.6297691",
"0.6293978",
"0.6261518",
"0.62466514",
"0.6244351",
"0.62174404",
"0.612744... | 0.6322568 | 14 |
Evaluate: | a[0] a[1] 1 | | b[0] b[1] 1 | | x y w | | function testPoint(a, b, x, y, w) {
var d0 = robustSum([a[1]], [-b[1]])
var d1 = robustSum([a[0]], [-b[0]])
var d2 = det([a, b])
t.ok(validate(d2), "validate det")
var p0 = robustProduct(x, d0)
var p1 = robustProduct(y, d1)
var p2 = robustProduct(w, d2)
t.ok(validate(p0), "validate p... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Q(a,b){return R(a,W(b))}",
"function elementwise(op, a, b) {\n if (b && a.length != b.length) {\n console.warn(\"dimension mismatch, blindly trying anyway\")\n }\n let r = []\n for (let i = 0; i < Math.min(a.length, b.length); i++) {\n r[i] = op(a[i], b[i])\n }\n return r... | [
"0.5965039",
"0.5856262",
"0.5719725",
"0.5668233",
"0.5633823",
"0.561806",
"0.56178045",
"0.55805516",
"0.55649936",
"0.55529296",
"0.55400306",
"0.5537692",
"0.5537692",
"0.5534493",
"0.5525577",
"0.54827875",
"0.54826474",
"0.54730874",
"0.547258",
"0.5470823",
"0.5467131... | 0.5515613 | 15 |
for asynchronously running/closing server for test purposes | function runServer() {
const port = process.env.PORT || 8080;
return new Promise((resolve, reject) => {
server = app.listen(port, () => {
console.log(`Your app is listening on port ${port}`);
resolve(server);
})
.on('error', err => {
reject(err);
});
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"async close() {\r\n\t\tconst close = util.promisify(this.httpServer.close).bind(this.httpServer);\r\n\t\treturn close();\r\n\t}",
"async shutdown() { }",
"async stop() {\n // 1. Stop listening for connections at http-server \n this.server.close();\n logger.info('Server closed', {\n ... | [
"0.70702136",
"0.6977789",
"0.6897095",
"0.682322",
"0.6804936",
"0.67646533",
"0.6684778",
"0.6672225",
"0.66364753",
"0.66356146",
"0.66109574",
"0.66072446",
"0.6569529",
"0.65270543",
"0.6490999",
"0.6429479",
"0.64270943",
"0.64199644",
"0.6380249",
"0.63774383",
"0.6376... | 0.0 | -1 |
get transfer report data | getTransferReportData() {
const transferReportRef = firebase.database().ref('transfer_report');
transferReportRef.on('value', (snapshot) => {
let transferReport = snapshot.val();
this.setState({
transferReport: transferReport
});
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getReport(){\n\n }",
"function getReportData() {\n if($scope.selectedInst.startDate !== \"\"){\n reqData = {\n startDate: $scope.selectedInst.startDate,\n instType: $scope.selectedInst.instType\n };\n Dashbo... | [
"0.655407",
"0.63894665",
"0.60958177",
"0.59767705",
"0.5866943",
"0.5846194",
"0.58175516",
"0.58014095",
"0.57637656",
"0.57326686",
"0.5726738",
"0.57104933",
"0.56727636",
"0.5631146",
"0.56273323",
"0.5624737",
"0.55972505",
"0.55511266",
"0.5530202",
"0.55037326",
"0.5... | 0.5229358 | 49 |
get expense category data | getExpenseCategoryData() {
const expenseCategoryRef = firebase.database().ref('expense_category');
expenseCategoryRef.on('value', (snapshot) => {
let expenseCategory = snapshot.val();
this.setState({
expenseCategory: expenseCategory
});
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"async getAllExpenseTypes() {\n try {\n let expenseTypesData = await this.expenseTypeDynamo.getAllEntriesInDB();\n let expenseTypes = _.map(expenseTypesData, (expenseTypeData) => {\n expenseTypeData.categories = _.map(expenseTypeData.categories, (category) => {\n return JSON.parse(categ... | [
"0.6563236",
"0.6380393",
"0.6363149",
"0.62509763",
"0.6226267",
"0.61631644",
"0.61118716",
"0.6028993",
"0.59869635",
"0.59378237",
"0.59366494",
"0.5919497",
"0.5898329",
"0.5884228",
"0.58358496",
"0.58031696",
"0.57738197",
"0.5770936",
"0.5766181",
"0.57590383",
"0.572... | 0.5524757 | 29 |
from my representation of block to pathery's 'mapid,x,y' representation | function id_from_block(mapid, block) {
var x = block[0];
var y = block[1];
var id = mapid + '\\,' + x + '\\,' + y;
return id;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"convertCoords(regionId, x, y) {\n let xcoord = mapArray[regionId - 3].center[1] - (w / 2) + (w * x);\n let ycoord = mapArray[regionId - 3].center[0] + (k / 2) - (k * y);\n return { xcoord, ycoord };\n }",
"geoLayout() {\n this.pieces.forEach((row, i) => row.forEach((piece, j) => {\n let x, y;\n... | [
"0.634676",
"0.6181108",
"0.61058617",
"0.59699154",
"0.5957187",
"0.5860765",
"0.5838135",
"0.5838135",
"0.58280843",
"0.579826",
"0.5790928",
"0.5756872",
"0.5732404",
"0.5718984",
"0.57145745",
"0.5673929",
"0.5673929",
"0.5659219",
"0.56401825",
"0.5637809",
"0.5630849",
... | 0.65771323 | 0 |
from pathery's representation to my representation of block | function block_from_block_string(block_string) {
var string_coordinates = block_string.split(',');
var x = parseInt(string_coordinates[0]);
var y = parseInt(string_coordinates[1]);
var block = [x, y];
return block;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static getBlockAsString(block) {\n return JSON.stringify(block);\n }",
"toComponent(block) {\n switch (block.type) {\n case BlockType.Heading:\n return <Heading key={block.key} text={block.text} />;\n case BlockType.Text:\n return <Paragraph key={block.key} text={block.text} />;\n ... | [
"0.6233432",
"0.61434066",
"0.608808",
"0.60601807",
"0.6017449",
"0.59777105",
"0.59724015",
"0.5886264",
"0.5886264",
"0.5886264",
"0.5886264",
"0.5886264",
"0.5886264",
"0.5886264",
"0.5886264",
"0.5886264",
"0.5822866",
"0.5785202",
"0.5656537",
"0.5651493",
"0.5649363",
... | 0.50244623 | 70 |
also updates the current mapid | function get_mapid() {
var old_mapid = exports.mapid;
var outer_grid = $('.shown-maps .grid_outer');
if (outer_grid.length > 0) {
exports.mapid = parseInt(outer_grid.attr('id').split(',')[0]);
} else {
exports.mapid = -1; // mapeditor mapid
}
if (old_mapid !== exports.mapid) {refre... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function updateMap() {\n\t\t\tid = trail_select.value;\n\t\t\tconsole.log(id);\n\t\t\tvar newlayer = layer.getLayer(id);\n\t\t\tnewlayer.removeFrom(map);\n\t\t\tnewlayer.setStyle({\n\t\t\t\t\tweight: 5,\n\t\t\t\t\tcolor: '#00ff00',\n\t\t\t\t\topacity: 1.0\n\t\t\t});\n\t\t\tnewlayer.addTo(map)\n\t\t\tvar prevlayer ... | [
"0.6699316",
"0.66740304",
"0.66334426",
"0.6628178",
"0.66269815",
"0.6623925",
"0.66216576",
"0.6619243",
"0.661313",
"0.66003704",
"0.65701693",
"0.65673083",
"0.6557646",
"0.6527192",
"0.6525528",
"0.65135986",
"0.64707476",
"0.6466153",
"0.64304066",
"0.64272076",
"0.635... | 0.58749706 | 70 |
SOLUTION SAVING /////////////////////////////////////////// //////////////// html5 storage | function HTML5_SolutionStorage() {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _save(){\n try{\n _storage_service.jStorage = json_encode(_storage);\n // If userData is used as the storage engine, additional\n if(_storage_elm) {\n _storage_elm.setAttribute(\"jStorage\",_storage_service.jStorage);\n _storage_elm.sav... | [
"0.695352",
"0.6910278",
"0.67380065",
"0.6736166",
"0.654777",
"0.65023375",
"0.64908814",
"0.6462967",
"0.6460841",
"0.64599866",
"0.64467144",
"0.64265186",
"0.64206463",
"0.6419226",
"0.6419226",
"0.6419226",
"0.64183664",
"0.6417796",
"0.6390357",
"0.6382935",
"0.6373133... | 0.65942293 | 4 |
var phil_link = " add_message("Wu's philosophy on the assist") TODO: autosave best TODO: clear solutions for past maps? | function save_current_solution() {
var mapid = get_mapid();
var solution = get_current_solution();
var name = $('#mt_save_solution_name').val();
$('#mt_save_solution_name').val('');
function add_solution() {
solution_storage.add_solution(mapid, solution, name);
}
if (!name) {
// choose name base... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function showPhrase(link, path, trans, lang, explan) {\r\n}",
"function makeLink() {\n// var a=\"http://www.geocodezip.com/v3_MW_example_linktothis.html\"\n/*\n var url = window.location.pathname;\n var a = url.substring(url.lastIndexOf('/')+1)\n + \"?lat=\" + mapProfile.getCenter(... | [
"0.60552365",
"0.56925845",
"0.5669718",
"0.5622623",
"0.55885786",
"0.5587947",
"0.55799043",
"0.55766654",
"0.55523086",
"0.55512524",
"0.55025804",
"0.5492828",
"0.5480845",
"0.5456547",
"0.54282576",
"0.5425289",
"0.54234797",
"0.5408568",
"0.5407849",
"0.5406813",
"0.540... | 0.0 | -1 |
BLOCK PLACEMENT HISTORY ////////////////////////////////////////// ////////////////////////////////////////// SINGLE BLOCK MOVE | function BlocksDiffMove(mapid, blocks) { // click (add or remove) the block
this.mapid = mapid;
this.blocks = blocks;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"moveBlock(block) {\n block.state.pos.add(block.state.spe);\n }",
"function moveBlock() {\n //check if block can move down\n if (canMove()) {\n clearGrid();\n\n var pos = curBlock.pos;\n var num = blockNames.indexOf(curBlock.name) + 1;\n var shape = curBlock.type;\n fo... | [
"0.67173564",
"0.6515419",
"0.6442989",
"0.63859284",
"0.6370058",
"0.6278556",
"0.62516564",
"0.6248915",
"0.6209492",
"0.6167708",
"0.61214566",
"0.6110167",
"0.6105487",
"0.6103156",
"0.60723543",
"0.6056209",
"0.6019085",
"0.60071355",
"0.6006816",
"0.59972024",
"0.597256... | 0.65394604 | 1 |
TODO: make this work for builtin loadBest | function ChangeBoardMove(mapid, old_blocks, new_blocks) {
// change entire board, e.g. load solution, reset
this.mapid = mapid;
this.old_blocks = old_blocks;
this.new_blocks = new_blocks;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function load() {\r\n var score = Utilities.getObject('bejeweled_high_score');\r\n if (score !== null) {\r\n BEST_SCORE = score;\r\n }\r\n }",
"function forceLoad() {}",
"load() {}",
"load() {}",
"function load()\n{\n setupParts();\n\tbgn();\n}",
"get loadType() {}",... | [
"0.5831975",
"0.5743614",
"0.571259",
"0.571259",
"0.5631153",
"0.55469173",
"0.5405571",
"0.5396429",
"0.53283215",
"0.524157",
"0.52403224",
"0.52094436",
"0.52094436",
"0.5198371",
"0.50743294",
"0.5073847",
"0.5073642",
"0.50535744",
"0.504593",
"0.50432163",
"0.5036096",... | 0.0 | -1 |
logic for determining what squares to consider for paint_line_to returns array of blocks to consider | function line_candidates(from_block, to_block) {
var x_diff = to_block[0] - from_block[0];
var y_diff = to_block[1] - from_block[1];
var candidates = [];
var niters = Math.max(Math.abs(x_diff), Math.abs(y_diff))
var xinc = Math.min(Math.abs(x_diff / y_diff), 1) * (x_diff > 0 ? 1 : -1);
var yinc = Math.min... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function highlightSquare(evt) {\n var id = evt.target.getAttribute(\"id\");\n id = id.replace(\"square_aux_\", \"\");\n var idSplited = id.split('.');\n var i = parseInt(idSplited[0]);\n var j = parseInt(idSplited[1]);\n if (i < width && j < height) {\n var verticalLine = document.getEleme... | [
"0.59378713",
"0.5858817",
"0.57538754",
"0.5723327",
"0.57110673",
"0.5702433",
"0.5671079",
"0.5641562",
"0.56382596",
"0.56337255",
"0.5617977",
"0.5607673",
"0.5596192",
"0.5584646",
"0.5545794",
"0.55362993",
"0.5531646",
"0.5503764",
"0.5500345",
"0.54985636",
"0.547320... | 0.64591575 | 0 |
NOTE: this is unused | function click_block(mapid, block) {
var id = id_from_block(mapid, block);
$("#" + id).click();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private internal function m248() {}",
"private public function m246() {}",
"protected internal function m252() {}",
"transient private protected internal function m182() {}",
"transient protected internal function m189() {}",
"transient private internal function m185() {}",
"transient final protected i... | [
"0.74040616",
"0.73645556",
"0.7150411",
"0.6979429",
"0.6942979",
"0.68783736",
"0.6705218",
"0.65452915",
"0.64838815",
"0.6467706",
"0.64219797",
"0.64040905",
"0.6365586",
"0.63431096",
"0.6319178",
"0.62969124",
"0.6284792",
"0.6205623",
"0.61862403",
"0.6120282",
"0.603... | 0.0 | -1 |
Filter by individual country | function countrySearch() {
// Get the input element
const ctryInput = document.getElementById("ctry");
//Add Event listener
ctryInput.addEventListener("keyup", e => {
const ctryClone = ctryInput.value.toLowerCase();
const names = document.querySelectorAll("main h1");
const content = docum... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function addCountryFilter(country) {\n var uppercase = country.toUpperCase();\n if(uppercase === \"ALL\") {\n activeSheet.applyFilterAsync(\n \"Country / Region\",\n \"\",\n tableau.FilterUpdateTyp... | [
"0.7640313",
"0.75982517",
"0.7276434",
"0.7147836",
"0.70501894",
"0.6906618",
"0.6873157",
"0.6818389",
"0.6805732",
"0.67788434",
"0.6760752",
"0.67075807",
"0.66809344",
"0.65569794",
"0.6519352",
"0.6515951",
"0.64517975",
"0.6359275",
"0.63262796",
"0.63070476",
"0.6279... | 0.0 | -1 |
compile the viewerspecific LESS into CSS and inject it into the viewer iframe's style element | injectStyle() {
const lessFile = path.join(
atom.packages.getLoadedPackage('pdfjs-viewer').path,
'pdfjs', 'web', 'viewer.less')
var css = atom.themes.loadLessStylesheet(lessFile)
const invertColors = atom.config.get('pdfjs-viewer.invertColors')
if (invertColors) {
css += '.page, .thumb... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _loadStyles() {\n var request = new XMLHttpRequest();\n request.open(\"GET\", \"LiveDevelopment/main.less\", true);\n request.onload = function onLoad(event) {\n var parser = new less.Parser();\n parser.parse(request.responseText, function onParse(err, tree) {\n ... | [
"0.63505733",
"0.6074779",
"0.60326767",
"0.5979328",
"0.5803666",
"0.5728204",
"0.56845677",
"0.56368285",
"0.56267446",
"0.5598583",
"0.5589148",
"0.55604345",
"0.5513008",
"0.5513008",
"0.55022913",
"0.55022913",
"0.5498674",
"0.5455775",
"0.54467833",
"0.54233986",
"0.540... | 0.7658661 | 0 |
handle clicks on external links | handleLink(event) {
// only left click, no modifiers, on 'a' element with '_top' target
// 'meta' is not actually detected, and 'alt' clicks never make it here
if ((event.button == 0) &&
!event.ctrlKey && !event.shiftKey &&
// !event.altKey && !event.metaKey &&
(event.target.tagName ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function handleClickedLink( url, view ) {\n\t// return true if the link was handled or to prevent other plugins or Colloquy from handling it\n\treturn false;\n}",
"function handleHowExternalLinksOpen() {\n document.onclick = function (e) {\n e = e || window.event;\n var e... | [
"0.7435591",
"0.73822165",
"0.7276288",
"0.7089854",
"0.7081115",
"0.70706743",
"0.69614434",
"0.69111794",
"0.68936294",
"0.6805468",
"0.6712781",
"0.6707126",
"0.66212225",
"0.661823",
"0.6616171",
"0.6605452",
"0.6589971",
"0.65685534",
"0.656483",
"0.6558894",
"0.65319514... | 0.6878175 | 9 |
determine page position of mouse click, and call SyncTeX to obtain (La)TeX source line number | handleSynctex(event) {
// get enclosing page div
const page = event.target.closest('div.page')
if (!page) {
return
}
// get page number
const pageNo = parseInt(page.getAttribute('data-page-number'), 10)
if (isNaN(pageNo)) {
return
}
// compute mouse coordinates relative t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function reportClick2(output, event) {\n event = event || window.event;\n var target = event.target || event.srcElement;\n var pageX = event.pageX, pageY = event.pageY;\n if (pageX == undefined) {\n pageX = event.clientX + document.body.scrollLeft;\n pageY = event.clientY + document.body.scrollTop;\n }\... | [
"0.59780824",
"0.59627783",
"0.5914543",
"0.59109586",
"0.5907357",
"0.58666945",
"0.5854666",
"0.58488786",
"0.58023095",
"0.57441294",
"0.56991583",
"0.56912565",
"0.5659724",
"0.56488675",
"0.5641135",
"0.56135595",
"0.56122005",
"0.5597734",
"0.5592026",
"0.55906373",
"0.... | 0.6215773 | 0 |
parse SyncTeX output for values | synctexStdout (output, synctex){
// split buffered lines
lines = output.split(/\r?\n/g)
for (let line of lines) {
if (line.startsWith('Input:')) {
synctex.input = line.substr(6)
// if (process.platform == 'win32') {
// // attempt to fix issue #6
// synctex.input = s... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"getS() {\r\n let unparseS = this.#rawtext[4];\r\n let unparseMatrix = [];\r\n let s = [];\r\n\r\n for(let line of unparseS.split('\\n')) {\r\n unparseMatrix.push(line.split('\\t'));\r\n }\r\n\r\n for(let i in unparseMatrix) {\r\n if(i > 2) {\r\n s.push(unparseMatrix[i].slice(1).m... | [
"0.5583674",
"0.5481091",
"0.546047",
"0.54369694",
"0.53631705",
"0.5265229",
"0.5221531",
"0.5221531",
"0.5220149",
"0.5220149",
"0.5165086",
"0.51272595",
"0.510016",
"0.5081256",
"0.5077846",
"0.50710964",
"0.50604916",
"0.50460374",
"0.50460374",
"0.50460374",
"0.5021681... | 0.5483062 | 1 |
upon SyncTeX exit, open source file at line number | synctexExit(code, synctex) {
if (code == 0) {
console.log('PdfjsViewerView: Opening SyncTeX result: line '
+ synctex.line + ' of ' + synctex.input)
atom.workspace.open(synctex.input, {
initialLine: synctex.line - 1,
searchAllPanes: true
})
} else {
console.log('Pd... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function go_to(line_number) {\r\n\tPC = line_number;\r\n}",
"function openMark(c_index) {\n saveLastOpenedMark(true);\n updateMarksOnPage(c_index);\n //If it's already open, then openClose() will close it\n if (findCurrentOpenedMark() !== c_index) {\n openClose(c_index);\n }\n let page =... | [
"0.5987039",
"0.5235687",
"0.5198589",
"0.5099201",
"0.5098465",
"0.5062345",
"0.50511545",
"0.50328106",
"0.5024142",
"0.5022267",
"0.5010141",
"0.5007535",
"0.49936023",
"0.49933314",
"0.49846554",
"0.4977844",
"0.4977844",
"0.4977844",
"0.4977844",
"0.4977844",
"0.49366385... | 0.6738871 | 0 |
handle changes to PDF file | handleFilechange(event, path) {
console.log('PdfjsViewerView: file', event, path)
this.reloadPdf()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function updateCorsiPDF(pdf) {\n\twaitingDialog.show(\"Salvataggio in corso...\", {progressType: \"primary\"}); // Show waiting dialog\n\n\t// FormData Object to pass to XMLHTTP request\n\tvar formData = new FormData();\n\tformData.append(\"corsi_pdf\", pdf);\n\n\tvar link = server + \"php/upload.php\";\n\tvar req... | [
"0.6356933",
"0.62800014",
"0.6055446",
"0.6046855",
"0.60111886",
"0.60051256",
"0.59805006",
"0.5924107",
"0.58593285",
"0.5762046",
"0.57152253",
"0.5710921",
"0.5679001",
"0.56706864",
"0.5608449",
"0.55970854",
"0.5580664",
"0.5548116",
"0.55222666",
"0.55112606",
"0.550... | 0.79413074 | 0 |
When the user clicks on the button, toggle between hiding and showing the dropdown content | function myFunction() {
document.getElementById("myDropdown-3").classList.toggle("show");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function dropDownShowClick(){\n document.getElementById(\"forDropDown\").style.display=\"block\";\n document.getElementById(\"dropDownShowBtn\").style.display=\"none\";\n document.getElementById(\"dropDownHideBtn\").style.display=\"block\";\n}",
"function btn_show() {\n document.getElementById(\"drop... | [
"0.78088385",
"0.7671879",
"0.74918294",
"0.73910683",
"0.7350857",
"0.73457146",
"0.7332308",
"0.7264288",
"0.72625244",
"0.7242689",
"0.72131056",
"0.72122794",
"0.7175608",
"0.71719986",
"0.71553904",
"0.7151304",
"0.7146252",
"0.71220434",
"0.71034634",
"0.7098101",
"0.70... | 0.0 | -1 |
call the constructor method | constructor(props){
//Call the constructor of Super class i.e The Component
super(props);
//maintain the state required for this component
this.state = {
restaurant_ID: props.match.params.restaurant_ID,
customer_ID: cookie.load('customer'),
restaurant_... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _construct()\n\t\t{;\n\t\t}",
"function _ctor() {\n\t}",
"constructur() {}",
"function Constructor() {\n // All construction is actually done in the init method\n if ( this.initialize )\n this.initialize.apply(this, arguments);\n }",
"function Constructor() {}",
"function Con... | [
"0.80362153",
"0.79341316",
"0.78611135",
"0.7843023",
"0.78206825",
"0.78206825",
"0.78206825",
"0.76931036",
"0.7557418",
"0.7528882",
"0.7528882",
"0.7528882",
"0.7528882",
"0.7528882",
"0.7528882",
"0.7528882",
"0.7507304",
"0.74755096",
"0.7461952",
"0.7433301",
"0.74325... | 0.0 | -1 |
Call the Will Mount to set the auth Flag to false | componentDidMount(){
this.fetchCurrentOrder();
this.fetchCustomerAddresses(this.state.customer_ID);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"componentWillMount() {\r\n this.setState({\r\n authFlag: false\r\n })\r\n }",
"componentWillMount() {\n this.setState({\n authFlag: false\n });\n }",
"componentWillMount() {\n this.setState({\n authFlag: false\n });\n }",
"componentWillMount() {\n this.setState({\n ... | [
"0.6273045",
"0.62575996",
"0.62575996",
"0.62575996",
"0.62296814",
"0.62161314",
"0.6198508",
"0.6198508",
"0.6163718",
"0.6163718",
"0.6163718",
"0.6163718",
"0.6154516",
"0.6154516",
"0.6154516",
"0.6154516",
"0.61041677",
"0.58749634",
"0.57465154",
"0.569418",
"0.564655... | 0.0 | -1 |
After click the play again button, the hidden html "overlay" will appear on the window. | function playAgain(){
document.getElementsByClassName("overlay")[0].style.visibility="hidden";
startGame();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function playAgain(){\n popupCongratulation.classList.remove(\"show-overlay\");\n loadGame();\n}",
"function playAgain() {\n\n\tpopup.classList.remove('show')\n\tpairs = 0;\n\tremoveDeck();\n\tstartGame();\n}",
"function playAgain() {\n modal.classList.remove(\"show\");\n restartGame();\n}",
"fun... | [
"0.7780991",
"0.72885054",
"0.72417444",
"0.7235191",
"0.71318823",
"0.71163476",
"0.7110868",
"0.70990336",
"0.709509",
"0.70827276",
"0.70741004",
"0.70714086",
"0.70578796",
"0.7020413",
"0.6933276",
"0.6924758",
"0.68858945",
"0.68850267",
"0.68788856",
"0.6858991",
"0.68... | 0.75544494 | 1 |
Each time can only open two cards, these two cards will be push in an empty array openedCards=[] These two cards will be checked if they are matched or not If matched, add "match" to these two cards' classList, then remove "open" and "show " from classList and last empty openedCards array If unmatched, add "unmatch" to... | function disable(){
Array.prototype.filter.call(cards, function(card){
card.classList.add("disabled");
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function addToOpen() {\n\n const openCards = []; //new array for open cards\n\n //add open cards to the array\n for (let i = 0; i < cards.length; i++) {\n if (cards[i].classList.contains('open') === true) {\n openCards.push(cards[i]);\n }\n }\n\n //check if the open cards ma... | [
"0.8527311",
"0.8450938",
"0.83253723",
"0.8284278",
"0.8243474",
"0.8178937",
"0.80482256",
"0.803405",
"0.8031876",
"0.80090535",
"0.7998909",
"0.7990161",
"0.79812586",
"0.79804987",
"0.79663175",
"0.7946321",
"0.79305094",
"0.78772813",
"0.7871123",
"0.78702027",
"0.78498... | 0.0 | -1 |
After each click, update moves to html. | function moveCounter(){
moves++;
counter.innerHTML= moves;
//start timer on first click
if(moves == 1){
second = 0;
minute = 0;
hour = 0;
startTimer();
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function onClick(){\n\t\tposition++;\n\t\tdisplayHTML();\n\t}//close onClick function",
"function moveBeadHTML(from, to, status){\n $(\"#spot\"+from).html(\"\"); \n $(\"#spot\"+from).attr(\"data-counter\", \"false\"); \n let beadImageHtml= `<img class=\"counter img-fluid\" src=\"images/counter.jpeg\">`;... | [
"0.70394015",
"0.60370624",
"0.59498453",
"0.59007156",
"0.58966523",
"0.5770067",
"0.57499725",
"0.5731504",
"0.57087374",
"0.56685567",
"0.5652493",
"0.5648376",
"0.55988604",
"0.55916744",
"0.55724144",
"0.5571498",
"0.554922",
"0.55333424",
"0.55217797",
"0.5519179",
"0.5... | 0.0 | -1 |
Display cards:Adding class name (open, show and dsabled) to clicked card Add "disabled" to the card's class, make this card cannot be click again. | function display (){
this.classList.toggle("open");
this.classList.toggle("show");
this.classList.toggle("disabled");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function displayCard(card) {\n card.className = \"card open show disable\";\n}",
"function showCard() {\n if (openCards.length < 2) {\n this.classList.toggle(\"open\");\n this.classList.toggle(\"show\");\n this.classList.toggle(\"disable\");\n } else {\n return false;\n }\n }",
"function showCa... | [
"0.7942892",
"0.7788179",
"0.7614285",
"0.75181973",
"0.74819666",
"0.74685025",
"0.73658013",
"0.73390496",
"0.7325463",
"0.73128897",
"0.72914094",
"0.7288503",
"0.72718424",
"0.722628",
"0.7213351",
"0.7177964",
"0.7171591",
"0.71244156",
"0.7082135",
"0.7081296",
"0.70737... | 0.0 | -1 |
From coords get real address and put that value in form. | function reverseGeocode(coords) {
fetch('http://nominatim.openstreetmap.org/reverse?format=json&lon=' + coords[0] + '&lat=' + coords[1])
.then(function (response) {
return response.json();
}).then(function (json) {
// TOWN
console.log(json.address);
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function coordsToAdress(coords) {\n const url =`https://www.mapquestapi.com/geocoding/v1/reverse?key=${GAPI_KEY}&location=${coords.coords.latitude},${coords.coords.longitude}`;\n console.log(coords);\n $.getJSON(url, function (response) {\n const addressObject = response.results[0].... | [
"0.7384958",
"0.72573787",
"0.6567199",
"0.6301241",
"0.62114316",
"0.61138624",
"0.6036717",
"0.6017119",
"0.59860843",
"0.5897298",
"0.5798293",
"0.5747296",
"0.5746853",
"0.57357055",
"0.5715914",
"0.5712867",
"0.5679946",
"0.5673366",
"0.5614941",
"0.5613038",
"0.5608402"... | 0.51299584 | 85 |
corresponding functions for Trigger commands | function createTrigger(params) {
crTrgg.register(ow, context, log, props);
crTrgg.createTrigger(params);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function Trigger() { }",
"function setFunctions() {\r\n var commands = [\r\n { command: \"command1\", description: \"description1\" },\r\n { command: \"command2\", description: \"description2\" },\r\n ];\r\n messagePayload.commands = commands;\r\n\r\n console.log(\r\n JSON.stringify(\r\n sendPa... | [
"0.700767",
"0.6369062",
"0.62516713",
"0.62066096",
"0.6206276",
"0.6040072",
"0.6014924",
"0.59824985",
"0.59630746",
"0.5904428",
"0.5865967",
"0.58563113",
"0.58233804",
"0.5815685",
"0.57950693",
"0.57894164",
"0.5776049",
"0.57479304",
"0.56944287",
"0.5687543",
"0.5645... | 0.0 | -1 |
maybe add heatmap later? | function initMap() {
var myLatLng = {
lat: 42.886386,
lng: -78.878176
};
var map = new google.maps.Map(document.getElementById('map'), {
zoom: 10,
center: myLatLng
});
var marker = new google.maps.Marker({
position: {
lat: 42.892424,
lng: -78.871549
},
map: map,
t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function initialHeatmaps(){\r\n setupHeatmap(jsonData.length);\r\n setupGlbHeatmap();\r\n}",
"function addHeatmap(map) {\n\t/* Data points defined as an array of LatLng objects */\n\tvar heatmapData = genHeatMapData();\n\tvar heatmap = new google.maps.visualization.HeatmapLayer({\n\t\tdata : heatmapData,\n... | [
"0.7394071",
"0.7203954",
"0.7078096",
"0.6931978",
"0.6873112",
"0.66278",
"0.660872",
"0.656308",
"0.6461581",
"0.64137334",
"0.6408689",
"0.6403958",
"0.6357345",
"0.63014454",
"0.6301063",
"0.6275814",
"0.626229",
"0.62617016",
"0.62357455",
"0.62218213",
"0.6216079",
"... | 0.0 | -1 |
Function for Stop Timer | function stopTimer() {
window.clearInterval(timeinterval);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function stopTimer(){ clearInterval(interval)}",
"function stopTimer() {clearTimeout(startTimer)}",
"function stopTimer(){\r\n clearInterval(timer);\r\n }",
"function stop() {\n timer.stop();\n}",
"function stopTimer(){\n clearInterval(timer);\n }",
"function stopTimer() {\n ... | [
"0.85853267",
"0.8535992",
"0.8379098",
"0.83345544",
"0.8325101",
"0.82884747",
"0.82776463",
"0.8268185",
"0.82477003",
"0.8234251",
"0.8226573",
"0.82136273",
"0.82091016",
"0.8206621",
"0.8200573",
"0.81922984",
"0.81810564",
"0.8164908",
"0.8151197",
"0.8133498",
"0.8103... | 0.78749055 | 44 |
Matrix Utilities: Rotation Matrix about xaxis | function rotationX(angle) {
var matrix = [[1, 0, 0], [0, Math.cos(angle), -Math.sin(angle)], [0, Math.sin(angle), Math.cos(angle)]];
return matrix;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function xyRotMatrix(a){\r\n\treturn [[Math.cos(a), Math.sin(a), 0],[-Math.sin(a), Math.cos(a), 0],[0,0,1]];\r\n}",
"rotate(axis, angle) {\n let x = axis[0];\n let y = axis[1];\n let z = axis[2];\n let n = Math.sqrt(x * x + y * y + z * z);\n x /= n;\n y /= n;\n z ... | [
"0.74874014",
"0.7400532",
"0.7212825",
"0.7147966",
"0.68759817",
"0.68364817",
"0.6832825",
"0.68203175",
"0.6795999",
"0.67957824",
"0.6670489",
"0.66588515",
"0.6623146",
"0.66074044",
"0.6599422",
"0.6539136",
"0.65385276",
"0.6498271",
"0.6468815",
"0.6468251",
"0.64582... | 0.7098199 | 4 |
Rotation Matrix about yaxis | function rotationY(angle) {
var matrix = [[Math.cos(angle), 0, Math.sin(angle)], [0, 1, 0], [-Math.sin(angle), 0, Math.cos(angle)]];
return matrix;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function rotate_y() {\n curr_sin = Math.sin(map.degree);\n curr_cos = Math.cos(map.degree);\n var x = (this.x * curr_cos) + (this.z * curr_sin);\n this.z = (this.x * (-curr_sin)) + (this.z * (curr_cos));\n this.x = x;\n }",
"function Matrixes4_rotationY(angle) {\n var c = ... | [
"0.75722575",
"0.75469136",
"0.7020137",
"0.6915297",
"0.6842812",
"0.669447",
"0.6645827",
"0.6561925",
"0.6555012",
"0.6459236",
"0.6432163",
"0.6390815",
"0.6384799",
"0.6337545",
"0.6303303",
"0.6213811",
"0.6162408",
"0.61519396",
"0.61120486",
"0.6109272",
"0.6088077",
... | 0.7362744 | 2 |
Rotation Matrix about zaxis | function rotationZ(angle) {
var matrix = [[Math.cos(angle), -Math.sin(angle), 0], [Math.sin(angle), Math.cos(angle), 0], [0, 0 ,1]];
return matrix;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function rotate_z() {\n curr_sin = Math.sin(map.degree);\n curr_cos = Math.cos(map.degree);\n var x = (this.x * curr_cos) + (this.y * (-curr_sin));\n this.y = (this.x * curr_sin) + (this.y * (curr_cos));\n this.x = x;\n }",
"function rotation (x, y, z) {\n let so = [[0, -z... | [
"0.79612166",
"0.75073725",
"0.7394705",
"0.7359525",
"0.73549765",
"0.7288484",
"0.7208845",
"0.7128654",
"0.7094069",
"0.7092742",
"0.70920163",
"0.702741",
"0.70166767",
"0.6990136",
"0.68694955",
"0.68568695",
"0.685571",
"0.6805478",
"0.6793507",
"0.6783463",
"0.6750606"... | 0.76899934 | 1 |
Scalation Matrix in xdirection | function scaleX(factor) {
var matrix = [[factor, 0, 0], [0, 1, 0], [0, 0, 1]];
return matrix;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function scale(x,y) {\n matrix[0] *= x;\n matrix[1] *= x;\n matrix[2] *= y;\n matrix[3] *= y;\n }",
"function translateX(matrix, x) {\n return [matrix[0], matrix[1], matrix[2], matrix[3], matrix[4], matrix[5], matrix[6], matrix[7], matrix[8]... | [
"0.66815245",
"0.6278486",
"0.5726937",
"0.56945854",
"0.5693284",
"0.56524473",
"0.56499267",
"0.55592173",
"0.55340105",
"0.55210155",
"0.5518534",
"0.54775256",
"0.54387766",
"0.5425288",
"0.5391684",
"0.5372343",
"0.5362993",
"0.53526",
"0.5339748",
"0.53265846",
"0.53245... | 0.58400965 | 2 |
Scalation Matrix in ydirection | function scaleY(factor) {
var matrix = [[1, 0, 0], [0, factor, 0], [0, 0, 1]];
return matrix;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getYScalTransform(animParams, height, chartData) {\n\t\tlet i = animParams.chartIndex;\n\t\tlet l = animParams.labelsXInfo[i].start;\n\t\tlet r = animParams.labelsXInfo[i].end;\n\t\tif (l == r) {\n\t\t\treturn animParams.finalTransforms[i];\n\t\t}\n\t\tlet yRangeLocal = getYRange(chartData, l, r);\n\t\tle... | [
"0.65562284",
"0.6312737",
"0.59749705",
"0.59121543",
"0.56873244",
"0.56102264",
"0.5593326",
"0.553085",
"0.54956156",
"0.54512185",
"0.54490536",
"0.5424582",
"0.542068",
"0.54178613",
"0.5376193",
"0.53662604",
"0.53615594",
"0.53567654",
"0.5348954",
"0.5347519",
"0.533... | 0.56474674 | 5 |
Scalation Matrix in zdirection | function scaleZ(factor) {
var matrix = [[1, 0, 0], [0, 1, 0], [0, 0 ,factor]];
return matrix;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"updateMatrix() {\n this.matrix.set(\n 1 - 2 * (Math.pow(this.y, 2) + Math.pow(this.z, 2)),\n 2 * (this.x * this.y - this.s * this.z),\n 2 * (this.x * this.z + this.s * this.y),\n 0,\n 2 * (this.x * this.y + this.s * this.z),\n 1 - 2 * (Math.p... | [
"0.61650944",
"0.60390526",
"0.58922094",
"0.5815004",
"0.57519245",
"0.57320184",
"0.5657857",
"0.5637643",
"0.56170356",
"0.5615397",
"0.5559777",
"0.55528843",
"0.5524574",
"0.54968387",
"0.54952127",
"0.5494612",
"0.54929566",
"0.548553",
"0.5477501",
"0.54729635",
"0.541... | 0.6909256 | 0 |
It enable undo and reset buttons. | function enableUndoReset() {
$("#undo").prop("disabled",false);
$("#reset").prop("disabled",false);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function resetUndoButtons () {\n\t\tdocument.getElementById(\"undoButton\").disabled = true;\n\t\tdocument.getElementById(\"redoButton\").disabled = true;\n\t}",
"function resetUndoButtons () {\n\t\tdocument.getElementById(\"undoButton\").disabled = true;\n\t\tdocument.getElementById(\"redoButton\").disabled = t... | [
"0.8175881",
"0.7975978",
"0.757982",
"0.745943",
"0.74001974",
"0.73060656",
"0.72660065",
"0.6706293",
"0.65928704",
"0.6587759",
"0.63854676",
"0.63271576",
"0.63237226",
"0.6306348",
"0.6244115",
"0.6238874",
"0.62248594",
"0.6220936",
"0.62166125",
"0.6208905",
"0.617193... | 0.8133119 | 1 |
It creates rotations animation frames | function animateCommute() {
var transformation1;
var transformation2;
var transformationSelector1 = document.getElementById('TransformationSelector1').value;
var transformationSelector2 = document.getElementById('TransformationSelector2').value;
var frameSize = 20;
var extra = axes.slice()... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function animate() {\n var timeNow = new Date().getTime();\n if (lastTime != 0) {\n var elapsed = timeNow - lastTime; \n rotAngle= (rotAngle+1.0) % 360;\n }\n var elapsed=timeNow-lastTime;\n lastTime = timeNow;\n \n //when framecount is less than 120, the effect is just rotati... | [
"0.7143087",
"0.678111",
"0.678111",
"0.6762755",
"0.67036504",
"0.6693846",
"0.6605351",
"0.65949506",
"0.6593068",
"0.6542379",
"0.6478402",
"0.6408935",
"0.6405344",
"0.63247114",
"0.6309393",
"0.6267712",
"0.6200402",
"0.61991596",
"0.6194055",
"0.6172283",
"0.6151421",
... | 0.6062617 | 30 |
dimIndex is 0 for X, 1 for Y | function slide(amt, dimIndex, posArray, wrapFn){
this.offset[dimIndex] += amt;
// figure out if we are wrapping and if so, how many times
// wrap rows as neccesary and set their update status
var wrapNum;
if(this.offset[dimIndex] < 0){
wrapNum = Math.min(this.numRows-1, Math.ceil(Math.abs(t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get dimension() {\r\n return this.cpoints.shape[1];\r\n }",
"get dimension() {\r\n return this.cpoints.shape[1];\r\n }",
"function index2dArray(x, y, w, h) {\n return x + y * w;\n}",
"function GetDimension()\n{\n\treturn m_dimension;\n}",
"xy_ij(i, j) {\n if (Array.isArray(i)) [i, j... | [
"0.6050544",
"0.6050544",
"0.59032375",
"0.5829529",
"0.57125956",
"0.56006765",
"0.55944884",
"0.5588342",
"0.5582964",
"0.55672497",
"0.5563879",
"0.5492976",
"0.54185706",
"0.5416348",
"0.5416348",
"0.5416348",
"0.5416348",
"0.5416348",
"0.5416348",
"0.5414073",
"0.5401366... | 0.0 | -1 |
direction is 0 for neg, 1 for pos | function wrap_horizontal(direction){
if(direction) {
// this.xPos.push(this.xPos.shift());
this.ptInfo.push(this.ptInfo.shift());
for(var y = 0; y<this.numRows; y++) {
this.ptInfo[this.numRows-1][y].update = true;
}
} else {
// this.xPos.unshift(this.xPos.pop());
this... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function direction(x, y){ \n\tif (((dirX != 0) && (!x)) || ((dirY != 0) && (!y))) { \n\t\tdirX = x;\n\t\tdirY = y;\n\t}\n}",
"get direction() { return this._direction; }",
"get direction() { return this._direction; }",
"get direction() {\n return {\n 37: -1,\n 38: -1,\n 39: 1,\n 40: 1... | [
"0.73193645",
"0.71578246",
"0.71578246",
"0.6989378",
"0.6964537",
"0.68913746",
"0.68595654",
"0.68365294",
"0.6748359",
"0.670563",
"0.6702249",
"0.66543555",
"0.66543555",
"0.66543555",
"0.66543555",
"0.66543555",
"0.6649152",
"0.66261476",
"0.66083413",
"0.66083413",
"0.... | 0.0 | -1 |
direction is 0 for neg, 1 for pos | function wrap_vertical(direction){
if(direction){
// this.yPos.push(this.yPos.shift());
for(var x = 0; x<this.numRows; x++) {
this.ptInfo[x].push(this.ptInfo[x].shift());
this.ptInfo[x][this.numRows-1].update = true;
}
} else {
// this.yPos.unshift(this.yPos.pop());
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function direction(x, y){ \n\tif (((dirX != 0) && (!x)) || ((dirY != 0) && (!y))) { \n\t\tdirX = x;\n\t\tdirY = y;\n\t}\n}",
"get direction() { return this._direction; }",
"get direction() { return this._direction; }",
"get direction() {\n return {\n 37: -1,\n 38: -1,\n 39: 1,\n 40: 1... | [
"0.73193645",
"0.71578246",
"0.71578246",
"0.6989378",
"0.6964537",
"0.68913746",
"0.68595654",
"0.68365294",
"0.6748359",
"0.670563",
"0.6702249",
"0.66543555",
"0.66543555",
"0.66543555",
"0.66543555",
"0.66543555",
"0.6649152",
"0.66261476",
"0.66083413",
"0.66083413",
"0.... | 0.0 | -1 |
I get all of the friends in the remote collection. | function getSearch() {
var request = $http({
method: "get",
url: "http://tmb_rpc.qa.pdone.com/search_processor.php?mode=SEARCH&page=1&phrase=e&page_length=100&type=news",
});
return( request.then( handleSuccess, handleError ) );
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getFriends() {\n var friends = [], friend;\n for (var i = 0, length = user.contacts.length; i < length; i++) {\n if (user.contacts[i].removed == 0) {\n friend = usersFactory.getUserByUsername(user.contacts[i].username);\n if (!Meth... | [
"0.72235197",
"0.71988577",
"0.7002391",
"0.6926407",
"0.67752826",
"0.6653365",
"0.6609451",
"0.6558943",
"0.6496401",
"0.64737797",
"0.6412854",
"0.63960236",
"0.63946396",
"0.62490726",
"0.6229333",
"0.61980224",
"0.615326",
"0.61139584",
"0.61016047",
"0.6098154",
"0.6094... | 0.0 | -1 |
Examples pigIt('Pig latin is cool'); // igPay atinlay siay oolcay pigIt('Hello world !'); // elloHay orldWay ! | function pigIt(str){
let newArr = [];
let arr = str.split(" ");
for (let i=0; i<arr.length; i++) {
if (arr[i]!='?' && arr[i]!='!') {
let word = arr[i];
let letter = word.charAt(0);
let newWord = word.slice(1) + letter + "ay";
newArr.push(newWord);
} else {
newArr.push(arr[i])... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function pigLatinify(sentence) {\n const words = sentence.split(' ');\n\n const translateWord = (word) => {\n vowels = 'aeiou'.split('');\n if (vowels.indexOf(word[0]) != -1) {\n return `${word}ay`;\n } else {\n let phonemeEnd = 0;\n while (!(vowels.index... | [
"0.6590179",
"0.64808846",
"0.63976747",
"0.6396448",
"0.6366696",
"0.62404877",
"0.6236926",
"0.6220485",
"0.6199845",
"0.6181981",
"0.61684847",
"0.61666036",
"0.6131933",
"0.6116186",
"0.61128724",
"0.61021894",
"0.60919654",
"0.6085303",
"0.60636246",
"0.60613966",
"0.604... | 0.5671738 | 69 |
Creating the database and posts table definition | async function connectDB () {
if (db) {
debug(`Database Already Created && Opened`);
return db;
}
const postsTable = await readTable(config.db.create_sql_tables.posts);
await new Promise((resolve, reject) => {
db = new sqlite3.Database(config.db.dbfile,
sqlite3.OPEN_READWRITE | sql... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function seedDB(){\n initializeData(removeExistingPosts,removeExistingComments,createNewPosts(samplePosts,createNewComments,sampleComment));\n}",
"up () {\n this.create('posts', (table) => {\n table.increments()\n table.integer('user_id').references('id').inTable('users')\n table.string('... | [
"0.70287937",
"0.6920679",
"0.67103344",
"0.65276265",
"0.64656925",
"0.6382254",
"0.6359012",
"0.6344923",
"0.62556463",
"0.6249585",
"0.62180465",
"0.62175936",
"0.6180406",
"0.61482817",
"0.61359876",
"0.6021464",
"0.5996139",
"0.59512246",
"0.5950814",
"0.59443563",
"0.59... | 0.60948306 | 15 |
3. lesson 3 scoping move the variable within functin to global scope | function myApartment() {
var myCoffeeMaker = 'Aeropress';
var buildingAddress = '150 E 14th St, New York, NY';
var myCloset = 'Extra coats in the back';
var buildingLaundryCode = 4927;
var myRefridgerator = 'Filled with veggies and dark chocolate.';
var myDog = 'Nikko';
var buildingPhone = '(481) 516-2342';
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function addTodo() {\n //whatever code...\n //LOCAL SCOPE\n let bob = 3;\n}",
"function addTodo() {\r\n //whatever code...\r\n //LOCAL SCOPE\r\n var bob = 3;\r\n}",
"function add()\n{\n var xx = \"sdsjd\"; //variable declared inside function can only be used for that function(function scoped)\n}",
"... | [
"0.6653926",
"0.6530011",
"0.6472656",
"0.6366675",
"0.6289086",
"0.62820464",
"0.62709355",
"0.6248423",
"0.6227793",
"0.62263525",
"0.62066007",
"0.61812264",
"0.61794436",
"0.6177216",
"0.61719537",
"0.6168983",
"0.61620104",
"0.6149353",
"0.61308485",
"0.6105247",
"0.6100... | 0.0 | -1 |
el metodo se va a fijar si el boton tiene la clase hide sino se la va a agregar | toggleBtnEmpezar(){
if (btnEmpezar.classList.contains('hide')){
btnEmpezar.classList.remove('hide')
} else {
btnEmpezar.classList.add('hide')
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function hide() {\n toogle = 'hide'\n\n }",
"function addHideButton(x) {\n return null\n}",
"function showOrHide() {\n bild.classList.toggle('hide')\n}",
"onHide() {}",
"onHide() {}",
"show() {\n this.button.removeClass(\"hidden\");\n }",
"hideAddButton() {\n this.buttons.addButt... | [
"0.69361424",
"0.6922426",
"0.6892546",
"0.68413234",
"0.68413234",
"0.68174666",
"0.6815154",
"0.67271537",
"0.6679472",
"0.6679472",
"0.66531026",
"0.6650131",
"0.6636871",
"0.66063076",
"0.66049194",
"0.6604424",
"0.66040635",
"0.6603668",
"0.65889287",
"0.65570194",
"0.65... | 0.6805017 | 7 |
se va a llamar en el navegador cuando js lo llame | elegirColor(ev){
/* console.log(ev) */
const NOMBRECOLOR = ev.target.dataset.color; //en el evento click vemos el dataset de cada color.
//Debemos transformar ese color al numero correspondiente
const NUMEROCOLOR = this.transformarColorANumero(NOMBRECOLOR)
this.iluminarColor(NOM... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function nascer()\n{\n\n estado = 3;\n flag_vida = 1;\n vidas_jogador[jog_activo]--;\n\tsom_inicio.play();\n if(jog_activo == 0)\n move_obj($('jogador_1'),290,320);\n else\n move_obj($('jogador_2'),290,320);\n\n // coloca objectos iniciais\n inicializa_objectos();\n objectos_c... | [
"0.64342034",
"0.62411654",
"0.62350446",
"0.6198248",
"0.6154945",
"0.6120531",
"0.6098895",
"0.6076482",
"0.60742587",
"0.60532326",
"0.6035566",
"0.6030729",
"0.601747",
"0.6001825",
"0.59999907",
"0.59837514",
"0.5967992",
"0.5950127",
"0.59485126",
"0.5945351",
"0.591417... | 0.0 | -1 |
Bullet Logic P1 Bullets | function Bullet(I) {
I.active = true;
I.xVelocity = 30;
I.yVelocity = 0;
I.width = 40;
I.height = 4;
I.color = "#7FFF00";
I.inBounds = function() {
return (
I.x >= 0 && I.x <= CANVAS_WIDTH && I.y >= 0 && I.y <= CANVAS_HEIGHT
);
};
I.draw = function() {
ca... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function spawnBullet(p){\n add([rect(6,18), \n pos(p), \n origin('center'), \n color(0.5, 0.5, 1),\n 'bullet'\n ])\n }",
"function Bullet() {\n this.srcX = 331;\n this.srcY = 500;\n this.drawX = -20;\n this.drawY = 0;\n this.width = 16;\n this.height = 14;\n this.explosion = new Explosi... | [
"0.6974338",
"0.6816566",
"0.6786509",
"0.6581971",
"0.65330476",
"0.6509508",
"0.64901364",
"0.6480903",
"0.6437764",
"0.6417107",
"0.6401408",
"0.6401408",
"0.6401408",
"0.6401408",
"0.639667",
"0.6379996",
"0.63512826",
"0.6341315",
"0.6336961",
"0.6332688",
"0.6331329",
... | 0.0 | -1 |
Update icon for tab | function updateTabIcon(tab, options) {
let icon;
let badge;
let badgeColor = '#555';
try {
if (options) {
icon = options.icon;
badge = options.badge;
} else {
var blocked;
var disabled;
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function update_icon()\n {\n const icon = bookmarks.is_unlocked() ? \"unlocked-bookmarks.svg\" :\n \"locked-bookmarks.svg\";\n const path = `/icons/main/${icon}`;\n browser.browserAction.setIcon({\n path:\n {\n ... | [
"0.765455",
"0.7623679",
"0.7577989",
"0.7161192",
"0.71154404",
"0.70820993",
"0.7038623",
"0.7014906",
"0.689834",
"0.6853722",
"0.68132484",
"0.6805539",
"0.67853904",
"0.67818785",
"0.67736995",
"0.6765114",
"0.6765114",
"0.6751297",
"0.6729748",
"0.67239493",
"0.67184263... | 0.7298236 | 3 |
Creates context menu item | function addMenu(title, options) {
var createProperties = {
contexts: ["all"],
title: adguard.i18n.getMessage(title)
};
if (options) {
if (options.id) {
createProperties.id = options.id;
}
if (options.parentId) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function createMainMenu() {\n chrome.contextMenus.create({\n id: 'parentMenu',\n title: 'Search \"%s\" on:',\n contexts: ['selection']\n });\n}",
"function createContextMenuItem(label,onclick,divider) {\n\n\tif (onclick == \"\")\n\t\tvar menuHTML = '<div class=\"contextMenuDivInactive\... | [
"0.71566486",
"0.7150466",
"0.7148318",
"0.71336246",
"0.7126788",
"0.7009224",
"0.6952768",
"0.6941859",
"0.6928714",
"0.69089675",
"0.6906397",
"0.68632203",
"0.6828996",
"0.6810401",
"0.6771755",
"0.6626699",
"0.6550772",
"0.65260047",
"0.65224373",
"0.64886695",
"0.644197... | 0.7236928 | 0 |
Update context menu for tab | function updateTabContextMenu(tab) {
// Isn't supported by Android WebExt
if (!adguard.contextMenus) {
return;
}
adguard.contextMenus.removeAll();
if (adguard.settings.showContextMenu()) {
if (adguard.prefs.mobile) {
customizeMobileContextM... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function useContextMenu(tab) {\n if (addOnPrefs.useContextMenu) {\n var url = tab.url;\n var tabId = tab.id;\n destroyPreviousContextMenu(tabId);\n var datawakeInfo = storage.getDatawakeInfo(tabId);\n contextMenus[tabId] = contextMenu.Menu({\n label: \"Datawake Menu... | [
"0.70212114",
"0.6927158",
"0.6924702",
"0.6906198",
"0.6843413",
"0.67981917",
"0.67857164",
"0.6707404",
"0.6699512",
"0.6699512",
"0.6597538",
"0.65107584",
"0.6501404",
"0.6436692",
"0.6435966",
"0.6433753",
"0.64157784",
"0.6403758",
"0.6296309",
"0.6295183",
"0.6206347"... | 0.76073915 | 0 |
! betternormalscroll v1.14.1 (c) 20162019 ustbhuangyi Released under the MIT License. | function a(t,i){for(;i+1<t.length;i++)t[i]=t[i+1];t.pop()} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function mkdOnWindowScroll() {\n \n }",
"function OCM_scrolling() {\r\n\t\t\t\t\t\r\n\t\t\t\t\t$offCanvasEl.mousewheel(function (event, delta) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tthis.scrollTop -= (delta * 30);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tevent.preventDefault();\r\n\t\t\t\t\t});\r\n\t\t\t\t\t\r\n\t\t\t... | [
"0.6926268",
"0.67611235",
"0.6744457",
"0.6743667",
"0.6718017",
"0.6713843",
"0.66943103",
"0.66943103",
"0.66943103",
"0.66943103",
"0.66652805",
"0.66652805",
"0.6653458",
"0.6641574",
"0.6626136",
"0.66128874",
"0.66128874",
"0.66011393",
"0.6569429",
"0.6566255",
"0.652... | 0.0 | -1 |
Load Drive API client library. | loadDriveApi() {
window.gapi.client.load('drive', 'v3');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function loadDriveApi() {\n\tgapi.client.load('drive', 'v3', buscarArquivoHoje);\n}",
"function apiClientLoad() {\n\n //gapi.client.load('oauth2', 'v2', apiClientLoaded);\n gapi.client.load('plus', 'v1', apiClientLoaded);\n}",
"loadDriveApi() {\n var event = new CustomEvent(\"startloaddrive\");\n ... | [
"0.78346795",
"0.6759061",
"0.6677482",
"0.66763383",
"0.6563972",
"0.6477016",
"0.63805455",
"0.63769317",
"0.6372109",
"0.6365058",
"0.6361253",
"0.6345905",
"0.6345905",
"0.6345905",
"0.63422436",
"0.6339838",
"0.6326001",
"0.6326001",
"0.6326001",
"0.6326001",
"0.6326001"... | 0.77509207 | 1 |
Build the Jekyll Site | function jekyllBuild() {
browserSync.notify(messages.jekyllBuild);
if (env === 'prod') {
return cp.spawn(jekyll, ['build'], { stdio: 'inherit' });
} else {
return cp.spawn(
jekyll,
['build', '--config', '_config.yml,_config.dev.yml'],
{
stdio: 'inherit',
},
);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"build(source){\n const paths = Helpers.files(source);\n const view = Helpers.includes(paths.includes);\n\n //build _site directory, unless it already exists\n const sitePath = paths.site;\n fs.mkdir(sitePath, (err) => {\n if (err) {\n if (err.code === 'EEXIST') console.log('the _site fol... | [
"0.7367393",
"0.6933835",
"0.6828492",
"0.66889805",
"0.65909195",
"0.64345425",
"0.6205691",
"0.61614203",
"0.61429024",
"0.60682553",
"0.6061803",
"0.6045798",
"0.60446155",
"0.60264015",
"0.5986318",
"0.59101593",
"0.5895866",
"0.58575934",
"0.58570063",
"0.580719",
"0.576... | 0.59983224 | 14 |
Returns the C function with a specified identifier (for C++, you need to do manual name mangling) | function getCFunc(ident) {
var func = Module['_' + ident]; // closure exported function
if (!func) {
try {
func = eval('_' + ident); // explicit lookup
} catch(e) {}
}
assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
return func;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getCFunc(ident) {\n try {\n var func = Module['_' + ident]; // closure exported function\n if (!func) func = eval('_' + ident); // explicit lookup\n } catch (e) {}\n assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');\n ... | [
"0.75231504",
"0.75231504",
"0.7520175",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",
"0.75044906",... | 0.7469628 | 42 |
Sets a value in memory in a dynamic way at runtime. Uses the type data. This is the same as makeSetValue, except that makeSetValue is done at compiletime and generates the needed code then, whereas this function picks the right code at runtime. Note that setValue and getValue only do aligned writes and reads! Note that... | function setValue(ptr, value, type, noSafe) {
type = type || 'i8';
if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
switch(type) {
case 'i1': HEAP8[((ptr)>>0)]=value; break;
case 'i8': HEAP8[((ptr)>>0)]=value; break;
case 'i16': HEAP16[((ptr)>>1)]=value; break;
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function setValue(ptr, value, type, noSafe) {\n type = type || 'i8';\n if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit\n switch(type) {\n case 'i1': HEAP8[(ptr)]=value; break;\n case 'i8': HEAP8[(ptr)]=value; break;\n case 'i16': HEAP16[((ptr)>>1)]=value; break;\n ... | [
"0.70037204",
"0.69912416",
"0.69912416",
"0.69912416",
"0.69762725",
"0.69762725",
"0.69762725",
"0.6955605",
"0.6955605",
"0.6955605",
"0.6955605",
"0.6949471",
"0.6949471",
"0.6949471",
"0.6913426",
"0.6913426",
"0.6913426",
"0.69094163",
"0.68989986",
"0.6898297",
"0.6898... | 0.6889543 | 22 |
allocate(): This is for internal use. You can use it yourself as well, but the interface is a little tricky (see docs right below). The reason is that it is optimized for multiple syntaxes to save space in generated code. So you should normally not use allocate(), and instead allocate memory using _malloc(), initialize... | function allocate(slab, types, allocator, ptr) {
var zeroinit, size;
if (typeof slab === 'number') {
zeroinit = true;
size = slab;
} else {
zeroinit = false;
size = slab.length;
}
var singleType = typeof types === 'string' ? types : null;
var ret;
if (allocator == ALLOC_NONE) {
ret =... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _allocate(bytes) {\n var address = Module._malloc(bytes.length);\n Module.HEAPU8.set(bytes, address);\n\n return address;\n }",
"constructor() {\n this.length = 0;\n this._capacity = 0;\n // Sets up the pointer where the memory is allocated\n this.ptr = memory.allocat... | [
"0.68709147",
"0.6681199",
"0.63991416",
"0.6207962",
"0.6196632",
"0.6175716",
"0.61651045",
"0.61509424",
"0.6149775",
"0.6102238",
"0.60735273",
"0.60699433",
"0.60699433",
"0.60699433",
"0.60699433",
"0.60543585",
"0.6044165",
"0.603227",
"0.6024579",
"0.5928423",
"0.5928... | 0.60528016 | 19 |
Given a pointer 'ptr' to a nullterminated UTF16LEencoded string in the emscripten HEAP, returns a copy of that string as a Javascript String object. | function UTF16ToString(ptr) {
var i = 0;
var str = '';
while (1) {
var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
if (codeUnit == 0)
return str;
++i;
// fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
str += String.fromCharCode(cod... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function UTF16ToString(ptr) {\n var i = 0;\n\n var str = '';\n while (1) {\n var codeUnit = HEAP16[(((ptr) + (i * 2)) >> 1)];\n if (codeUnit == 0)\n return str;\n ++i;\n // fromCharCode constructs a character from a UTF-16 code unit, s... | [
"0.71345544",
"0.71345544",
"0.71065223",
"0.71065223",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.7089183",
"0.697702",
"0.6938373",
"0.69288766",
"0.69288766",
"0.689808",... | 0.7106646 | 13 |
Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr', nullterminated and encoded in UTF16LE form. The copy will require at most (str.length2+1)2 bytes of space in the HEAP. | function stringToUTF16(str, outPtr) {
for(var i = 0; i < str.length; ++i) {
// charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
}
// Null-terminate the pointe... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function stringToUTF16(str, outPtr) {\n for (var i = 0; i < str.length; ++i) {\n // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.\n var codeUnit = str.charCodeAt(i); // possibly a lead surrogate\n HEAP16[(((outPtr) + (i * 2)) >> 1)... | [
"0.80290776",
"0.7993579",
"0.7993579",
"0.7931322",
"0.7931322",
"0.7931322",
"0.7931322",
"0.7931322",
"0.7931322",
"0.7487391",
"0.7394279",
"0.739367",
"0.739367",
"0.73627746",
"0.7355913",
"0.7355913",
"0.7355913",
"0.7355913",
"0.7355913",
"0.7355913",
"0.7355913",
"... | 0.794772 | 15 |
Given a pointer 'ptr' to a nullterminated UTF32LEencoded string in the emscripten HEAP, returns a copy of that string as a Javascript String object. | function UTF32ToString(ptr) {
var i = 0;
var str = '';
while (1) {
var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
if (utf32 == 0)
return str;
++i;
// Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function __getString(ptr) {\n if (!ptr) return null;\n const buffer = memory.buffer;\n const id = new Uint32Array(buffer)[ptr + ID_OFFSET >>> 2];\n if (id !== STRING_ID) throw Error(`not a string: ${ptr}`);\n return getStringImpl(buffer, ptr);\n }",
"function UTF32ToString(ptr) {\n var i =... | [
"0.70205736",
"0.68332297",
"0.68074226",
"0.68074226",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6767575",
"0.6676319",
"0.6656409",
"0.6656409",
"0.6656409",
"0.6656409",... | 0.67930496 | 11 |
Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr', nullterminated and encoded in UTF32LE form. The copy will require at most (str.length+1)4 bytes of space in the HEAP, but can use less, since str.length does not return the number of characters in the string, but the number of U... | function stringToUTF32(str, outPtr) {
var iChar = 0;
for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
// Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
var codeUnit = str.ch... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function stringToUTF32(str, outPtr) {\n var iChar = 0;\n for (var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {\n // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the he... | [
"0.79397404",
"0.78454715",
"0.78454715",
"0.78064543",
"0.78064543",
"0.78064543",
"0.78064543",
"0.78064543",
"0.78064543",
"0.76360685",
"0.76156414",
"0.7611457",
"0.7611457",
"0.757421",
"0.7559589",
"0.7559589",
"0.7559589",
"0.7559589",
"0.7559589",
"0.7559589",
"0.755... | 0.78261834 | 15 |
dynamic area handled by sbrk | function enlargeMemory() {
abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_McDonaldAlloc(size) {\n size = roundUp(size, this._alignment);\n\n for (let i = 0; i < this._chunkCount; ++i) {\n const chunk = this._chunks[i];\n let isFound = false;\n let start = chunk.start;\n\n if (start + size <= chunk.end) {\n isFou... | [
"0.50616634",
"0.49353954",
"0.49187168",
"0.4819843",
"0.4819843",
"0.47982058",
"0.47443765",
"0.47317523",
"0.47197354",
"0.47161573",
"0.47159427",
"0.4697439",
"0.46973792",
"0.46959123",
"0.46869344",
"0.4674198",
"0.46555442",
"0.46497506",
"0.46371117",
"0.46344137",
... | 0.0 | -1 |
Tools This processes a JS string into a Cline array of numbers, 0terminated. For LLVMoriginating strings, see parser.js:parseLLVMString function | function intArrayFromString(stringy, dontAddNull, length /* optional */) {
var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
if (length) {
ret.length = length;
}
if (!dontAddNull) {
ret.push(0);
}
return ret;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function intArrayFromString(stringy, dontAddNull, length /* optional */ ) {\n var ret = (new Runtime.UTF8Processor()).processJSString(stringy);\n if (length) {\n ret.length = length;\n }\n if (!dontAddNull) {\n ret.push(0);\n }\n return ret;\n }",
... | [
"0.58884805",
"0.581145",
"0.581145",
"0.5556285",
"0.5541743",
"0.55156434",
"0.54336584",
"0.54336584",
"0.5410302",
"0.5410302",
"0.5410302",
"0.5203161",
"0.51673627",
"0.5165204",
"0.5140153",
"0.51294726",
"0.51294726",
"0.51086026",
"0.51017606",
"0.50933874",
"0.50669... | 0.5820682 | 30 |
Write a Javascript array to somewhere in the heap | function writeStringToMemory(string, buffer, dontAddNull) {
var array = intArrayFromString(string, dontAddNull);
var i = 0;
while (i < array.length) {
var chr = array[i];
HEAP8[(((buffer)+(i))>>0)]=chr;
i = i + 1;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function write(array, stream) {\n array = array.slice()\n function next() {\n while(array.length)\n if(stream.write(array.shift()) === false)\n return stream.once('drain', next)\n \n stream.end()\n }\n\n next()\n}",
"writeValue(buffer, value) {\n assert.isBuffer(buffer);\n ... | [
"0.5939622",
"0.59226626",
"0.5787374",
"0.57775414",
"0.57775414",
"0.571348",
"0.5663694",
"0.5645978",
"0.56428266",
"0.5637981",
"0.5614834",
"0.56105554",
"0.55599105",
"0.555978",
"0.55525315",
"0.5546563",
"0.5522782",
"0.5521473",
"0.5513374",
"0.5513374",
"0.5513374"... | 0.0 | -1 |
Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse. | function LazyUint8Array() {
this.lengthKnown = false;
this.chunks = []; // Loaded chunks. Index is the chunk number
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function LazyUint8Array() {\n this.lengthKnown = false;\n this.chunks = []; // Loaded chunks. Index is the chunk number\n }",
"function LazyUint8Array() {\nthis.lengthKnown = false;\nthis.chunks = []; // Loaded chunks. Index is the chunk number\n}",
"function LazyUint8Array() {\r\n this.l... | [
"0.81654984",
"0.81491023",
"0.8149054",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.8143981",
"0.81040406",
"0.81040406",
"0.81040406",
"0.81040406... | 0.81542194 | 27 |
======== compiled code from system/lib/compilerrt , see readme therein | function ___muldsi3($a, $b) {
$a = $a | 0;
$b = $b | 0;
var $1 = 0, $2 = 0, $3 = 0, $6 = 0, $8 = 0, $11 = 0, $12 = 0;
$1 = $a & 65535;
$2 = $b & 65535;
$3 = Math_imul($2, $1) | 0;
$6 = $a >>> 16;
$8 = ($3 >>> 16) + (Math_imul($2, $6) | 0) | 0;
$11 = $b >>> 16;
$12 = Math_imul($11, $1) | 0;
return ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function compile() {\n\n}",
"function VersionCompiler() {\n}",
"Compile() {\n\n }",
"function Compiler() {\n}",
"function compileLibC () {\n console.log('compileLibC');\n\n /* compile a fake program that uses c library */\n execSync(\n 'cl65 -T -t c64 -O -Os ' +\n '-Ln build/libc.lbl ' +\n ... | [
"0.6403422",
"0.63883287",
"0.57854426",
"0.5650239",
"0.56429785",
"0.5586955",
"0.5580404",
"0.556086",
"0.54912066",
"0.5480425",
"0.5451898",
"0.54312015",
"0.53887993",
"0.53754646",
"0.53143036",
"0.5301165",
"0.5294658",
"0.5280735",
"0.5278442",
"0.5240244",
"0.523989... | 0.0 | -1 |
return new, unset BigInteger | function nbi() { return new BigInteger(null); } | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function BigInteger(a, b) {\n if (a != null) this.fromString(a, b);\n} // return new, unset BigInteger",
"clone() {\n return new BigInteger(this.digits.slice());\n }",
"clone() {\n return new BigInteger(this.digits.slice());\n }",
"function nbi()\n{\n return new BigInteger(null);\n}",
... | [
"0.7428058",
"0.69610363",
"0.69610363",
"0.64015156",
"0.6362602",
"0.6362602",
"0.623988",
"0.623988",
"0.6111579",
"0.6111579",
"0.6111579",
"0.60725933",
"0.60725933",
"0.60725933",
"0.60725933",
"0.60725933",
"0.6041273",
"0.60077846",
"0.5987963",
"0.5987963",
"0.597454... | 0.6249981 | 74 |
am: Compute w_j += (xthis_i), propagate carries, c is initial carry, returns final carry. c < 3dvalue, x < 2dvalue, this_i < dvalue We need to select the fastest one that works in this environment. am1: use a single mult and divide to get the high bits, max digit bits should be 26 because max internal value = 2dvalue^2... | function am1(i,x,w,j,c,n) {
while(--n >= 0) {
var v = x*this[i++]+w[j]+c;
c = Math.floor(v/0x4000000);
w[j++] = v&0x3ffffff;
}
return c;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n var v = x * this[i++] + w[j] + c;\n c = Math.floor(v / 0x4000000);\n w[j++] = v & 0x3ffffff;\n }\n\n return c;\n} // am2 avoids a big mult-and-extract completely.",
"function am1(i, x, w, j, c, n) {\n while (--n >= 0) {\n ... | [
"0.72942585",
"0.7269491",
"0.72358465",
"0.7231032",
"0.7231032",
"0.7231032",
"0.7231032",
"0.7231032",
"0.7231032",
"0.7231032",
"0.7170475",
"0.7158511",
"0.7143046",
"0.71355367",
"0.7131832",
"0.7131832",
"0.7131832",
"0.7131832",
"0.7131832",
"0.7124021",
"0.7124021",
... | 0.7009762 | 86 |
am2 avoids a big multandextract completely. Max digit bits should be <= 30 because we do bitwise ops on values up to 2hdvalue^2hdvalue1 (< 2^31) | function am2(i,x,w,j,c,n) {
var xl = x&0x7fff, xh = x>>15;
while(--n >= 0) {
var l = this[i]&0x7fff;
var h = this[i++]>>15;
var m = xh*l+h*xl;
l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);
c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);
w[j++] = l&0x3fffffff;
}
return c;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function am2(i,x,w,j,c,n){var xl=x&0x7fff,xh=x>>15;while(--n>=0){var l=this[i]&0x7fff;var h=this[i++]>>15;var m=xh*l+h*xl;l=xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);c=(l>>>30)+(m>>>15)+xh*h+(c>>>30);w[j++]=l&0x3fffffff;}return c;}// Alternately, set max digit bits to 28 since some",
"function am2(i, x, w, j, c,... | [
"0.6851531",
"0.6258883",
"0.6119003",
"0.6056417",
"0.5773433",
"0.5773433",
"0.5708519",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"0.5693391",
"... | 0.5683907 | 57 |
Alternately, set max digit bits to 28 since some browsers slow down when dealing with 32bit numbers. | function am3(i,x,w,j,c,n) {
var xl = x&0x3fff, xh = x>>14;
while(--n >= 0) {
var l = this[i]&0x3fff;
var h = this[i++]>>14;
var m = xh*l+h*xl;
l = xl*l+((m&0x3fff)<<14)+w[j]+c;
c = (l>>28)+(m>>14)+xh*h;
w[j++] = l&0xfffffff;
}
return c;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function limitDigitDisplay(numb){\n return new Intl.NumberFormat('en-US', {minimumFractionDigits: 0,maximumFractionDigits: 8}).format(numb);\n}",
"function am2(i,x,w,j,c,n){var xl=x&0x7fff,xh=x>>15;while(--n>=0){var l=this[i]&0x7fff;var h=this[i++]>>15;var m=xh*l+h*xl;l=xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3ffffff... | [
"0.63417995",
"0.60637635",
"0.59968776",
"0.59458524",
"0.5878678",
"0.58499455",
"0.5831066",
"0.57583326",
"0.57344615",
"0.571807",
"0.57118917",
"0.5695717",
"0.5691538",
"0.5676504",
"0.5668075",
"0.5662858",
"0.5655844",
"0.56378764",
"0.5586695",
"0.5567974",
"0.55679... | 0.0 | -1 |
(protected) copy this to r | function bnpCopyTo(r) {
for(var i = this.t-1; i >= 0; --i) r[i] = this[i];
r.t = this.t;
r.s = this.s;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"copyR(rv) {\nthis._r.setFromRQ(r);\nreturn this;\n}",
"copyRV(rv) {\nRQ.setQV(this._r.xyzw, rv);\nreturn this;\n}",
"copyFrom(source) {\n this.r = source.r;\n this.g = source.g;\n this.b = source.b;\n this.a = source.a;\n return this;\n }",
"setR(r) {\nthis._r = r;\nretu... | [
"0.75497603",
"0.72476476",
"0.72389024",
"0.7011037",
"0.6864913",
"0.64402145",
"0.64402145",
"0.6410029",
"0.6410029",
"0.63942933",
"0.63942933",
"0.63565814",
"0.63523525",
"0.63438",
"0.63438",
"0.63438",
"0.63438",
"0.63438",
"0.63438",
"0.63438",
"0.63438",
"0.63438... | 0.6274418 | 66 |
(protected) set from integer value x, DV <= x < DV | function bnpFromInt(x) {
this.t = 1;
this.s = (x<0)?-1:0;
if(x > 0) this[0] = x;
else if(x < -1) this[0] = x+DV;
else this.t = 0;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"set x(value) {this._x = value;}",
"set x(v) {}",
"set setX (x) {\n this.x = x;\n }",
"set x(value) {}",
"function fromInt(o,x) {\r\n o.t = 1;\r\n o.s = (x<0)?-1:0;\r\n if(x > 0) o[0] = x;\r\n else if(x < -1) o[0] = x+DV;\r\n else o.t = 0;\r\n}",
"function numberInSet() {\n\n}",
"static s... | [
"0.5840981",
"0.5767726",
"0.56658965",
"0.5584814",
"0.5517628",
"0.5415022",
"0.5413354",
"0.53563",
"0.5282238",
"0.52688783",
"0.5221515",
"0.52208304",
"0.5156121",
"0.5138402",
"0.5137577",
"0.5112822",
"0.50835586",
"0.504482",
"0.50268924",
"0.501813",
"0.50094223",
... | 0.0 | -1 |
return bigint initialized to value | function nbv(i) { var r = nbi(); r.fromInt(i); return r; } | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function nbi() { return new BigInteger(null); }",
"function nbi() { return new BigInteger(null); }",
"function nbi() { return new BigInteger(null); }",
"function nbi() { return new BigInteger(null); }",
"function nbi() { return new BigInteger(null); }",
"function nbi() { return new BigInteger(null); }",
... | [
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"0.6788916",
"... | 0.0 | -1 |
(protected) set from string and radix | function bnpFromString(s,b) {
var k;
if(b == 16) k = 4;
else if(b == 8) k = 3;
else if(b == 256) k = 8; // byte array
else if(b == 2) k = 1;
else if(b == 32) k = 5;
else if(b == 4) k = 2;
else { this.fromRadix(s,b); return; }
this.t = 0;
this.s = 0;
var i = s.length, mi = fal... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"setFromStr(name, value) {\n//---------\nreturn this.set(FourCC.fourCCInt(name), value);\n}",
"static fromString(str, unsigned, radix) {\n if (str.length === 0)\n throw Error('empty string');\n if (str === 'NaN' || str === 'Infinity' || str === '+Infinity' || str === '-Infinity')\n ... | [
"0.59506947",
"0.5796183",
"0.5756244",
"0.571688",
"0.5703274",
"0.56444424",
"0.56098574",
"0.54871666",
"0.5446435",
"0.54307956",
"0.54285616",
"0.5418904",
"0.54126376",
"0.536724",
"0.53525347",
"0.53468573",
"0.5345744",
"0.53238094",
"0.53238094",
"0.53238094",
"0.530... | 0.0 | -1 |
(protected) clamp off excess high words | function bnpClamp() {
var c = this.s&this.DM;
while(this.t > 0 && this[this.t-1] == c) --this.t;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function truncateWords(longText, wordLimit) {\n // longText (a String with several words in it)\n // wordLimit (an Integer that sets the number of words you want in the returned text)\n\n // declaration, assignments\n var splitWords = [];\n var numWords = 0;\n var numWords_Short = 0;\n // var ... | [
"0.6410447",
"0.62497896",
"0.6212312",
"0.61360306",
"0.6088829",
"0.602778",
"0.60098094",
"0.59800375",
"0.5962549",
"0.5930364",
"0.59274495",
"0.5911854",
"0.58764017",
"0.5866618",
"0.5858178",
"0.584635",
"0.5839283",
"0.58268946",
"0.58057034",
"0.58053905",
"0.579874... | 0.0 | -1 |
(public) return string representation in given radix | function bnToString(b) {
if(this.s < 0) return "-"+this.negate().toString(b);
var k;
if(b == 16) k = 4;
else if(b == 8) k = 3;
else if(b == 2) k = 1;
else if(b == 32) k = 5;
else if(b == 4) k = 2;
else return this.toRadix(b);
var km = (1<<k)-1, d, m = false, r = "", i = this.t;
v... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function bigInt2StrHelper(bi, r) {\n return bi.toString(r);\n}",
"function arrayToString(arr,radix) {\n return Array.from(arr).map(c=>(c%radix).toString(radix)).join(\"\")\n}",
"toString() {\n let res = '';\n for (let i = this.digits.length - 1; i >= 0; i--) {\n res += this.digits[... | [
"0.6569635",
"0.6452269",
"0.6398552",
"0.6398552",
"0.63979465",
"0.63979465",
"0.63979465",
"0.63979465",
"0.63979465",
"0.63979465",
"0.63979465",
"0.6391342",
"0.63456917",
"0.63456917",
"0.63392365",
"0.6335141",
"0.63327986",
"0.63327986",
"0.6324256",
"0.63225746",
"0.... | 0.63123995 | 45 |
(public) return + if this > a, if this < a, 0 if equal | function bnCompareTo(a) {
var r = this.s-a.s;
if(r != 0) return r;
var i = this.t;
r = i-a.t;
if(r != 0) return (this.s<0)?-r:r;
while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;
return 0;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function value(a,b) {\r\na = a[1]+a[0];\r\nb = b[1]+b[0];\r\nreturn a == b ? 0 : (a < b ? -1 : 1)\r\n}",
"gt(other) { return this.cmp(other) > 0; }",
"function bnCompareTo(a) {\n var r = this.s-a.s;\n if(r != 0) return r;\n var i = this.t;\n r = i-a.t;\n if(r != 0) return (this.s<0)?-r... | [
"0.70131725",
"0.6956428",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",
"0.66924447",... | 0.66477484 | 59 |
returns bit length of the integer x | function nbits(x) {
var r = 1, t;
if((t=x>>>16) != 0) { x = t; r += 16; }
if((t=x>>8) != 0) { x = t; r += 8; }
if((t=x>>4) != 0) { x = t; r += 4; }
if((t=x>>2) != 0) { x = t; r += 2; }
if((t=x>>1) != 0) { x = t; r += 1; }
return r;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function bitSize(x) {\n var j,z,w;\n for (j=x.length-1; (x[j]==0) && (j>0); j--);\n for (z=0,w=x[j]; w; (w>>=1),z++);\n z+=bpe*j;\n return z;\n }",
"function bitSize(x) {\n var j, z, w;\n for (j = x.length - 1; (x[j] == 0) && (j > 0); j--);\n for (z = 0, w = x[j]; w; (w >>= 1... | [
"0.833884",
"0.8291418",
"0.7555619",
"0.7480939",
"0.74747205",
"0.74659693",
"0.74659693",
"0.74595004",
"0.74595004",
"0.74595004",
"0.74595004",
"0.74595004",
"0.74595004",
"0.74595004",
"0.74572974",
"0.7455497",
"0.7445271",
"0.7445271",
"0.7444451",
"0.74419636",
"0.74... | 0.72613025 | 51 |
(public) return the number of bits in "this" | function bnBitLength() {
if(this.t <= 0) return 0;
return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function bnBitCount() {\n\t var r = 0, x = this.s&this.DM;\n\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n\t return r;\n\t }",
"function bnBitCount() {\n\t var r = 0, x = this.s&this.DM;\n\t for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n\t return r;\n\t }"... | [
"0.7724705",
"0.7724705",
"0.7695087",
"0.7681344",
"0.7667404",
"0.7667404",
"0.76382494",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
"0.7611839",
... | 0.0 | -1 |
(protected) r = this << nDB | function bnpDLShiftTo(n,r) {
var i;
for(i = this.t-1; i >= 0; --i) r[i+n] = this[i];
for(i = n-1; i >= 0; --i) r[i] = 0;
r.t = this.t+n;
r.s = this.s;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function db_wrapper(idb) {\n\t\tObject.defineProperty(this, \"_db\", {\n\t\t\tconfigurable: false,\n\t\t\tenumerable: false,\n\t\t\twritable: false,\n\t\t\tvalue: idb,\n\t\t});\n\n\t\tstores.forEach(function (store) {\n\t\t\tObject.defineProperty(this, store, {\n\t\t\t\tconfigurable: false,\n\t\t\t\tenumerable: tr... | [
"0.5814989",
"0.5600617",
"0.5564867",
"0.55613804",
"0.5514192",
"0.54521364",
"0.5375183",
"0.5350181",
"0.532378",
"0.5322483",
"0.5318495",
"0.5165761",
"0.5160849",
"0.5160849",
"0.5146469",
"0.51333195",
"0.5132165",
"0.512582",
"0.5124944",
"0.509832",
"0.50938004",
... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.